java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_of_cslls_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 02:21:36,108 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 02:21:36,109 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 02:21:36,123 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 02:21:36,123 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 02:21:36,124 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 02:21:36,125 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 02:21:36,126 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 02:21:36,128 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 02:21:36,129 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 02:21:36,130 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 02:21:36,130 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 02:21:36,131 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 02:21:36,132 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 02:21:36,132 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 02:21:36,134 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 02:21:36,135 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 02:21:36,137 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 02:21:36,138 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 02:21:36,139 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 02:21:36,140 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 02:21:36,140 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 02:21:36,141 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 02:21:36,142 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 02:21:36,142 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 02:21:36,143 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 02:21:36,143 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 02:21:36,144 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 02:21:36,144 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 02:21:36,144 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 02:21:36,145 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 02:21:36,145 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 02:21:36,154 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 02:21:36,154 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 02:21:36,155 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 02:21:36,155 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 02:21:36,156 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 02:21:36,156 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 02:21:36,156 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 02:21:36,156 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 02:21:36,156 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 02:21:36,157 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 02:21:36,157 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 02:21:36,157 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 02:21:36,157 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 02:21:36,157 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 02:21:36,157 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 02:21:36,158 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 02:21:36,158 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 02:21:36,158 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 02:21:36,158 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 02:21:36,158 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 02:21:36,158 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 02:21:36,159 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 02:21:36,159 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 02:21:36,187 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 02:21:36,200 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 02:21:36,204 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 02:21:36,205 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 02:21:36,206 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 02:21:36,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_of_cslls_true-valid-memsafety.i [2018-02-04 02:21:36,356 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 02:21:36,357 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 02:21:36,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 02:21:36,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 02:21:36,364 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 02:21:36,365 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:21:36" (1/1) ... [2018-02-04 02:21:36,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32376bc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:21:36, skipping insertion in model container [2018-02-04 02:21:36,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:21:36" (1/1) ... [2018-02-04 02:21:36,380 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:21:36,408 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:21:36,503 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:21:36,522 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:21:36,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:21:36 WrapperNode [2018-02-04 02:21:36,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 02:21:36,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 02:21:36,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 02:21:36,530 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 02:21:36,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:21:36" (1/1) ... [2018-02-04 02:21:36,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:21:36" (1/1) ... [2018-02-04 02:21:36,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:21:36" (1/1) ... [2018-02-04 02:21:36,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:21:36" (1/1) ... [2018-02-04 02:21:36,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:21:36" (1/1) ... [2018-02-04 02:21:36,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:21:36" (1/1) ... [2018-02-04 02:21:36,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:21:36" (1/1) ... [2018-02-04 02:21:36,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 02:21:36,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 02:21:36,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 02:21:36,559 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 02:21:36,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:21:36" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 02:21:36,594 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 02:21:36,594 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 02:21:36,595 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 02:21:36,595 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 02:21:36,595 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 02:21:36,595 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 02:21:36,595 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 02:21:36,595 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 02:21:36,595 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 02:21:36,595 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 02:21:36,595 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 02:21:36,595 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 02:21:36,595 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 02:21:36,596 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 02:21:37,020 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 02:21:37,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:21:37 BoogieIcfgContainer [2018-02-04 02:21:37,020 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 02:21:37,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 02:21:37,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 02:21:37,024 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 02:21:37,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:21:36" (1/3) ... [2018-02-04 02:21:37,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a6753f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:21:37, skipping insertion in model container [2018-02-04 02:21:37,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:21:36" (2/3) ... [2018-02-04 02:21:37,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a6753f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:21:37, skipping insertion in model container [2018-02-04 02:21:37,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:21:37" (3/3) ... [2018-02-04 02:21:37,026 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_of_cslls_true-valid-memsafety.i [2018-02-04 02:21:37,032 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 02:21:37,037 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 101 error locations. [2018-02-04 02:21:37,059 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 02:21:37,059 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 02:21:37,060 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 02:21:37,060 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 02:21:37,060 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 02:21:37,060 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 02:21:37,060 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 02:21:37,060 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 02:21:37,061 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 02:21:37,072 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states. [2018-02-04 02:21:37,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 02:21:37,080 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:37,080 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:21:37,081 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:37,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1603684078, now seen corresponding path program 1 times [2018-02-04 02:21:37,116 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:37,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:37,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:37,188 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:37,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:21:37,189 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:37,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:37,190 INFO L182 omatonBuilderFactory]: Interpolants [224#false, 225#(= 1 (select |#valid| |main_#t~malloc0.base|)), 226#(= 1 (select |#valid| main_~tree~0.base)), 223#true] [2018-02-04 02:21:37,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:37,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:21:37,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:21:37,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:21:37,201 INFO L87 Difference]: Start difference. First operand 220 states. Second operand 4 states. [2018-02-04 02:21:37,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:37,563 INFO L93 Difference]: Finished difference Result 325 states and 349 transitions. [2018-02-04 02:21:37,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 02:21:37,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 02:21:37,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:37,575 INFO L225 Difference]: With dead ends: 325 [2018-02-04 02:21:37,575 INFO L226 Difference]: Without dead ends: 321 [2018-02-04 02:21:37,577 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:21:37,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-02-04 02:21:37,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 208. [2018-02-04 02:21:37,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-04 02:21:37,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 224 transitions. [2018-02-04 02:21:37,615 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 224 transitions. Word has length 8 [2018-02-04 02:21:37,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:37,615 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 224 transitions. [2018-02-04 02:21:37,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:21:37,616 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 224 transitions. [2018-02-04 02:21:37,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 02:21:37,616 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:37,616 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:21:37,617 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:37,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1603684077, now seen corresponding path program 1 times [2018-02-04 02:21:37,618 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:37,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:37,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:37,685 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:37,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:21:37,685 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:37,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:37,685 INFO L182 omatonBuilderFactory]: Interpolants [762#true, 763#false, 764#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 765#(and (= main_~tree~0.offset 0) (= (select |#length| main_~tree~0.base) 12))] [2018-02-04 02:21:37,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:37,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:21:37,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:21:37,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:21:37,687 INFO L87 Difference]: Start difference. First operand 208 states and 224 transitions. Second operand 4 states. [2018-02-04 02:21:37,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:37,874 INFO L93 Difference]: Finished difference Result 206 states and 222 transitions. [2018-02-04 02:21:37,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 02:21:37,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 02:21:37,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:37,876 INFO L225 Difference]: With dead ends: 206 [2018-02-04 02:21:37,877 INFO L226 Difference]: Without dead ends: 206 [2018-02-04 02:21:37,877 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:21:37,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-04 02:21:37,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-02-04 02:21:37,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-04 02:21:37,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 222 transitions. [2018-02-04 02:21:37,886 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 222 transitions. Word has length 8 [2018-02-04 02:21:37,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:37,886 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 222 transitions. [2018-02-04 02:21:37,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:21:37,886 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 222 transitions. [2018-02-04 02:21:37,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 02:21:37,887 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:37,887 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:21:37,887 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:37,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1863813244, now seen corresponding path program 1 times [2018-02-04 02:21:37,888 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:37,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:37,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:37,956 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:37,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:21:37,957 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:37,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:37,957 INFO L182 omatonBuilderFactory]: Interpolants [1184#(and (= 1 (select |#valid| main_~tree~0.base)) (= main_~tree~0.offset 0) (= 12 (select |#length| main_~tree~0.base))), 1180#true, 1181#false, 1182#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 1183#(and (= main_~tree~0.offset 0) (= 12 (select |#length| main_~tree~0.base)))] [2018-02-04 02:21:37,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:37,958 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:21:37,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:21:37,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:21:37,958 INFO L87 Difference]: Start difference. First operand 206 states and 222 transitions. Second operand 5 states. [2018-02-04 02:21:38,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:38,298 INFO L93 Difference]: Finished difference Result 355 states and 383 transitions. [2018-02-04 02:21:38,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 02:21:38,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-02-04 02:21:38,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:38,301 INFO L225 Difference]: With dead ends: 355 [2018-02-04 02:21:38,301 INFO L226 Difference]: Without dead ends: 355 [2018-02-04 02:21:38,301 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:21:38,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-02-04 02:21:38,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 199. [2018-02-04 02:21:38,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-04 02:21:38,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 215 transitions. [2018-02-04 02:21:38,311 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 215 transitions. Word has length 11 [2018-02-04 02:21:38,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:38,311 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 215 transitions. [2018-02-04 02:21:38,311 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:21:38,311 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 215 transitions. [2018-02-04 02:21:38,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 02:21:38,311 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:38,312 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:21:38,312 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:38,312 INFO L82 PathProgramCache]: Analyzing trace with hash -476893285, now seen corresponding path program 1 times [2018-02-04 02:21:38,313 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:38,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:38,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:38,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:38,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:21:38,348 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:38,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:38,348 INFO L182 omatonBuilderFactory]: Interpolants [1744#false, 1745#(= 1 (select |#valid| |main_#t~malloc3.base|)), 1746#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 1747#(= 1 (select |#valid| |main_#t~mem5.base|)), 1743#true] [2018-02-04 02:21:38,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:38,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:21:38,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:21:38,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:21:38,349 INFO L87 Difference]: Start difference. First operand 199 states and 215 transitions. Second operand 5 states. [2018-02-04 02:21:38,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:38,530 INFO L93 Difference]: Finished difference Result 274 states and 296 transitions. [2018-02-04 02:21:38,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:21:38,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 02:21:38,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:38,531 INFO L225 Difference]: With dead ends: 274 [2018-02-04 02:21:38,531 INFO L226 Difference]: Without dead ends: 274 [2018-02-04 02:21:38,532 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-04 02:21:38,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-02-04 02:21:38,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 198. [2018-02-04 02:21:38,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-04 02:21:38,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 214 transitions. [2018-02-04 02:21:38,536 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 214 transitions. Word has length 14 [2018-02-04 02:21:38,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:38,536 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 214 transitions. [2018-02-04 02:21:38,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:21:38,536 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 214 transitions. [2018-02-04 02:21:38,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 02:21:38,536 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:38,536 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:21:38,536 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:38,536 INFO L82 PathProgramCache]: Analyzing trace with hash -476893284, now seen corresponding path program 1 times [2018-02-04 02:21:38,537 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:38,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:38,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:38,589 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:38,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:21:38,589 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:38,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:38,589 INFO L182 omatonBuilderFactory]: Interpolants [2226#true, 2227#false, 2228#(and (= 0 |main_#t~malloc3.offset|) (= 4 (select |#length| |main_#t~malloc3.base|))), 2229#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 2230#(and (= (select |#length| |main_#t~mem5.base|) 4) (= |main_#t~mem5.offset| 0))] [2018-02-04 02:21:38,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:38,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:21:38,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:21:38,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:21:38,590 INFO L87 Difference]: Start difference. First operand 198 states and 214 transitions. Second operand 5 states. [2018-02-04 02:21:38,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:38,800 INFO L93 Difference]: Finished difference Result 315 states and 345 transitions. [2018-02-04 02:21:38,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:21:38,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 02:21:38,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:38,801 INFO L225 Difference]: With dead ends: 315 [2018-02-04 02:21:38,801 INFO L226 Difference]: Without dead ends: 315 [2018-02-04 02:21:38,801 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:21:38,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-02-04 02:21:38,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 197. [2018-02-04 02:21:38,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-04 02:21:38,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 213 transitions. [2018-02-04 02:21:38,807 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 213 transitions. Word has length 14 [2018-02-04 02:21:38,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:38,807 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 213 transitions. [2018-02-04 02:21:38,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:21:38,807 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 213 transitions. [2018-02-04 02:21:38,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 02:21:38,808 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:38,808 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:21:38,808 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:38,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1521405160, now seen corresponding path program 1 times [2018-02-04 02:21:38,809 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:38,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:38,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:38,892 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:38,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 02:21:38,892 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:38,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:38,892 INFO L182 omatonBuilderFactory]: Interpolants [2752#(and (= 1 (select |#valid| |main_#t~malloc3.base|)) (not (= main_~tree~0.base |main_#t~malloc3.base|))), 2753#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 2754#(and (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 2755#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 2756#(= 1 (select |#valid| |main_#t~mem10.base|)), 2749#true, 2750#false, 2751#(= 1 (select |#valid| main_~tree~0.base))] [2018-02-04 02:21:38,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:38,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:21:38,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:21:38,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:21:38,893 INFO L87 Difference]: Start difference. First operand 197 states and 213 transitions. Second operand 8 states. [2018-02-04 02:21:39,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:39,380 INFO L93 Difference]: Finished difference Result 369 states and 405 transitions. [2018-02-04 02:21:39,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 02:21:39,381 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-02-04 02:21:39,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:39,383 INFO L225 Difference]: With dead ends: 369 [2018-02-04 02:21:39,383 INFO L226 Difference]: Without dead ends: 369 [2018-02-04 02:21:39,383 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:21:39,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-02-04 02:21:39,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 204. [2018-02-04 02:21:39,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-04 02:21:39,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 222 transitions. [2018-02-04 02:21:39,389 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 222 transitions. Word has length 22 [2018-02-04 02:21:39,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:39,389 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 222 transitions. [2018-02-04 02:21:39,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:21:39,389 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 222 transitions. [2018-02-04 02:21:39,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 02:21:39,390 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:39,390 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:21:39,390 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:39,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1521405161, now seen corresponding path program 1 times [2018-02-04 02:21:39,391 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:39,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:39,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:39,533 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:39,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 02:21:39,533 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:39,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:39,534 INFO L182 omatonBuilderFactory]: Interpolants [3344#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 3345#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~mem5.base|))), 3346#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 3347#(and (= |main_#t~mem10.offset| 0) (= (select |#length| |main_#t~mem10.base|) 4)), 3340#true, 3341#false, 3342#(= 1 (select |#valid| main_~tree~0.base)), 3343#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|) (= 4 (select |#length| |main_#t~malloc3.base|)))] [2018-02-04 02:21:39,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:39,535 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:21:39,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:21:39,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:21:39,535 INFO L87 Difference]: Start difference. First operand 204 states and 222 transitions. Second operand 8 states. [2018-02-04 02:21:40,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:40,201 INFO L93 Difference]: Finished difference Result 555 states and 611 transitions. [2018-02-04 02:21:40,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:21:40,201 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-02-04 02:21:40,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:40,205 INFO L225 Difference]: With dead ends: 555 [2018-02-04 02:21:40,205 INFO L226 Difference]: Without dead ends: 555 [2018-02-04 02:21:40,205 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:21:40,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-02-04 02:21:40,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 204. [2018-02-04 02:21:40,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-04 02:21:40,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 221 transitions. [2018-02-04 02:21:40,211 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 221 transitions. Word has length 22 [2018-02-04 02:21:40,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:40,211 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 221 transitions. [2018-02-04 02:21:40,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:21:40,211 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 221 transitions. [2018-02-04 02:21:40,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 02:21:40,212 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:40,212 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-04 02:21:40,212 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:40,212 INFO L82 PathProgramCache]: Analyzing trace with hash -115400475, now seen corresponding path program 1 times [2018-02-04 02:21:40,213 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:40,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:40,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:40,246 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:40,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:21:40,246 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:40,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:40,247 INFO L182 omatonBuilderFactory]: Interpolants [4117#true, 4118#false, 4119#(= (select |#valid| main_~tree~0.base) 1), 4120#(= 1 (select |#valid| main_~tmp~0.base))] [2018-02-04 02:21:40,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:40,247 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:21:40,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:21:40,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:21:40,248 INFO L87 Difference]: Start difference. First operand 204 states and 221 transitions. Second operand 4 states. [2018-02-04 02:21:40,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:40,382 INFO L93 Difference]: Finished difference Result 273 states and 297 transitions. [2018-02-04 02:21:40,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:21:40,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-04 02:21:40,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:40,383 INFO L225 Difference]: With dead ends: 273 [2018-02-04 02:21:40,384 INFO L226 Difference]: Without dead ends: 273 [2018-02-04 02:21:40,384 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:21:40,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-02-04 02:21:40,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 197. [2018-02-04 02:21:40,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-04 02:21:40,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 218 transitions. [2018-02-04 02:21:40,388 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 218 transitions. Word has length 23 [2018-02-04 02:21:40,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:40,388 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 218 transitions. [2018-02-04 02:21:40,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:21:40,388 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2018-02-04 02:21:40,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 02:21:40,389 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:40,389 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-04 02:21:40,389 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:40,389 INFO L82 PathProgramCache]: Analyzing trace with hash -115400474, now seen corresponding path program 1 times [2018-02-04 02:21:40,390 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:40,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:40,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:40,450 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:40,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:21:40,450 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:40,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:40,450 INFO L182 omatonBuilderFactory]: Interpolants [4593#true, 4594#false, 4595#(= 0 |main_#t~malloc0.offset|), 4596#(= 0 main_~tree~0.offset), 4597#(and (= 0 main_~tree~0.offset) (<= (+ main_~tree~0.offset 12) (select |#length| main_~tree~0.base))), 4598#(and (<= 12 (select |#length| main_~tmp~0.base)) (= main_~tmp~0.offset 0))] [2018-02-04 02:21:40,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:40,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:21:40,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:21:40,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:21:40,451 INFO L87 Difference]: Start difference. First operand 197 states and 218 transitions. Second operand 6 states. [2018-02-04 02:21:40,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:40,702 INFO L93 Difference]: Finished difference Result 464 states and 518 transitions. [2018-02-04 02:21:40,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 02:21:40,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 02:21:40,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:40,704 INFO L225 Difference]: With dead ends: 464 [2018-02-04 02:21:40,704 INFO L226 Difference]: Without dead ends: 464 [2018-02-04 02:21:40,704 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:21:40,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-02-04 02:21:40,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 346. [2018-02-04 02:21:40,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-02-04 02:21:40,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 473 transitions. [2018-02-04 02:21:40,715 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 473 transitions. Word has length 23 [2018-02-04 02:21:40,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:40,715 INFO L432 AbstractCegarLoop]: Abstraction has 346 states and 473 transitions. [2018-02-04 02:21:40,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:21:40,716 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 473 transitions. [2018-02-04 02:21:40,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 02:21:40,716 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:40,716 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:21:40,716 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:40,717 INFO L82 PathProgramCache]: Analyzing trace with hash -81080279, now seen corresponding path program 1 times [2018-02-04 02:21:40,717 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:40,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:40,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:40,782 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:40,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:21:40,782 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:40,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:40,783 INFO L182 omatonBuilderFactory]: Interpolants [5417#true, 5418#false, 5419#(and (= 0 |main_#t~malloc9.offset|) (= 4 (select |#length| |main_#t~malloc9.base|))), 5420#(and (= (select |#length| main_~tmpList~0.base) 4) (= main_~tmpList~0.offset 0))] [2018-02-04 02:21:40,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:40,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:21:40,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:21:40,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:21:40,783 INFO L87 Difference]: Start difference. First operand 346 states and 473 transitions. Second operand 4 states. [2018-02-04 02:21:40,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:40,962 INFO L93 Difference]: Finished difference Result 701 states and 998 transitions. [2018-02-04 02:21:40,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 02:21:40,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-04 02:21:40,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:40,965 INFO L225 Difference]: With dead ends: 701 [2018-02-04 02:21:40,965 INFO L226 Difference]: Without dead ends: 701 [2018-02-04 02:21:40,965 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:21:40,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-02-04 02:21:40,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 345. [2018-02-04 02:21:40,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-02-04 02:21:40,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 472 transitions. [2018-02-04 02:21:40,971 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 472 transitions. Word has length 23 [2018-02-04 02:21:40,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:40,971 INFO L432 AbstractCegarLoop]: Abstraction has 345 states and 472 transitions. [2018-02-04 02:21:40,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:21:40,972 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 472 transitions. [2018-02-04 02:21:40,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 02:21:40,972 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:40,972 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-04 02:21:40,972 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:40,973 INFO L82 PathProgramCache]: Analyzing trace with hash -81080280, now seen corresponding path program 1 times [2018-02-04 02:21:40,973 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:40,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:40,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:40,996 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:40,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:21:40,996 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:40,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:40,996 INFO L182 omatonBuilderFactory]: Interpolants [6470#true, 6471#false, 6472#(= 1 (select |#valid| |main_#t~malloc9.base|)), 6473#(= 1 (select |#valid| main_~tmpList~0.base))] [2018-02-04 02:21:40,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:40,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:21:40,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:21:40,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:21:40,997 INFO L87 Difference]: Start difference. First operand 345 states and 472 transitions. Second operand 4 states. [2018-02-04 02:21:41,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:41,218 INFO L93 Difference]: Finished difference Result 861 states and 1188 transitions. [2018-02-04 02:21:41,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:21:41,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-04 02:21:41,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:41,223 INFO L225 Difference]: With dead ends: 861 [2018-02-04 02:21:41,223 INFO L226 Difference]: Without dead ends: 861 [2018-02-04 02:21:41,223 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:21:41,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-02-04 02:21:41,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 343. [2018-02-04 02:21:41,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-02-04 02:21:41,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 467 transitions. [2018-02-04 02:21:41,238 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 467 transitions. Word has length 23 [2018-02-04 02:21:41,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:41,238 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 467 transitions. [2018-02-04 02:21:41,238 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:21:41,238 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 467 transitions. [2018-02-04 02:21:41,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 02:21:41,239 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:41,239 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] [2018-02-04 02:21:41,239 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:41,239 INFO L82 PathProgramCache]: Analyzing trace with hash 771701702, now seen corresponding path program 1 times [2018-02-04 02:21:41,240 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:41,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:41,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:41,276 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:41,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:21:41,276 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:41,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:41,277 INFO L182 omatonBuilderFactory]: Interpolants [7681#true, 7682#false, 7683#(not (= 0 |main_#t~malloc0.base|)), 7684#(not (= 0 main_~tree~0.base))] [2018-02-04 02:21:41,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:41,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:21:41,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:21:41,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:21:41,277 INFO L87 Difference]: Start difference. First operand 343 states and 467 transitions. Second operand 4 states. [2018-02-04 02:21:41,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:41,299 INFO L93 Difference]: Finished difference Result 413 states and 541 transitions. [2018-02-04 02:21:41,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 02:21:41,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-02-04 02:21:41,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:41,301 INFO L225 Difference]: With dead ends: 413 [2018-02-04 02:21:41,301 INFO L226 Difference]: Without dead ends: 413 [2018-02-04 02:21:41,301 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:21:41,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-02-04 02:21:41,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 382. [2018-02-04 02:21:41,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-04 02:21:41,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 541 transitions. [2018-02-04 02:21:41,308 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 541 transitions. Word has length 25 [2018-02-04 02:21:41,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:41,308 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 541 transitions. [2018-02-04 02:21:41,308 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:21:41,308 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 541 transitions. [2018-02-04 02:21:41,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 02:21:41,309 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:41,309 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] [2018-02-04 02:21:41,309 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:41,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1690982226, now seen corresponding path program 1 times [2018-02-04 02:21:41,310 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:41,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:41,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:41,376 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:41,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 02:21:41,376 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:41,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:41,376 INFO L182 omatonBuilderFactory]: Interpolants [8482#true, 8483#false, 8484#(= (select |#valid| main_~tree~0.base) 1), 8485#(not (= main_~tree~0.base |main_#t~malloc9.base|)), 8486#(not (= main_~tree~0.base main_~tmpList~0.base)), 8487#(and (= |main_#t~mem10.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base))), 8488#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 8489#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 8490#(= 1 (select |#valid| |main_#t~mem13.base|))] [2018-02-04 02:21:41,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:41,377 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:21:41,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:21:41,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:21:41,377 INFO L87 Difference]: Start difference. First operand 382 states and 541 transitions. Second operand 9 states. [2018-02-04 02:21:41,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:41,996 INFO L93 Difference]: Finished difference Result 1251 states and 1782 transitions. [2018-02-04 02:21:41,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 02:21:41,996 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-02-04 02:21:41,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:41,999 INFO L225 Difference]: With dead ends: 1251 [2018-02-04 02:21:42,000 INFO L226 Difference]: Without dead ends: 1251 [2018-02-04 02:21:42,000 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:21:42,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2018-02-04 02:21:42,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 381. [2018-02-04 02:21:42,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-02-04 02:21:42,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 540 transitions. [2018-02-04 02:21:42,010 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 540 transitions. Word has length 26 [2018-02-04 02:21:42,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:42,010 INFO L432 AbstractCegarLoop]: Abstraction has 381 states and 540 transitions. [2018-02-04 02:21:42,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:21:42,011 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 540 transitions. [2018-02-04 02:21:42,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 02:21:42,011 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:42,011 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] [2018-02-04 02:21:42,011 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:42,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1690982225, now seen corresponding path program 1 times [2018-02-04 02:21:42,012 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:42,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:42,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:42,103 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:42,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 02:21:42,103 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:42,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:42,104 INFO L182 omatonBuilderFactory]: Interpolants [10144#(not (= main_~tree~0.base |main_#t~malloc9.base|)), 10145#(not (= main_~tree~0.base main_~tmpList~0.base)), 10146#(and (= |main_#t~mem10.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= |main_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 10147#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base))), 10148#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 10149#(and (<= 0 |main_#t~mem13.offset|) (<= (+ |main_#t~mem13.offset| 4) (select |#length| |main_#t~mem13.base|))), 10141#true, 10142#false, 10143#(= (select |#valid| main_~tree~0.base) 1)] [2018-02-04 02:21:42,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:42,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:21:42,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:21:42,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:21:42,105 INFO L87 Difference]: Start difference. First operand 381 states and 540 transitions. Second operand 9 states. [2018-02-04 02:21:42,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:42,658 INFO L93 Difference]: Finished difference Result 1250 states and 1781 transitions. [2018-02-04 02:21:42,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 02:21:42,659 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-02-04 02:21:42,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:42,661 INFO L225 Difference]: With dead ends: 1250 [2018-02-04 02:21:42,661 INFO L226 Difference]: Without dead ends: 1250 [2018-02-04 02:21:42,662 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:21:42,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2018-02-04 02:21:42,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 380. [2018-02-04 02:21:42,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-02-04 02:21:42,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 539 transitions. [2018-02-04 02:21:42,668 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 539 transitions. Word has length 26 [2018-02-04 02:21:42,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:42,668 INFO L432 AbstractCegarLoop]: Abstraction has 380 states and 539 transitions. [2018-02-04 02:21:42,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:21:42,668 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 539 transitions. [2018-02-04 02:21:42,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 02:21:42,669 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:42,669 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:21:42,669 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:42,669 INFO L82 PathProgramCache]: Analyzing trace with hash -679017658, now seen corresponding path program 1 times [2018-02-04 02:21:42,670 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:42,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:42,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:42,687 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:42,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:21:42,687 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:42,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:42,687 INFO L182 omatonBuilderFactory]: Interpolants [11798#true, 11799#false, 11800#|main_#t~short49|] [2018-02-04 02:21:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:42,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:21:42,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:21:42,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:21:42,688 INFO L87 Difference]: Start difference. First operand 380 states and 539 transitions. Second operand 3 states. [2018-02-04 02:21:42,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:42,694 INFO L93 Difference]: Finished difference Result 384 states and 543 transitions. [2018-02-04 02:21:42,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:21:42,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-02-04 02:21:42,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:42,695 INFO L225 Difference]: With dead ends: 384 [2018-02-04 02:21:42,696 INFO L226 Difference]: Without dead ends: 384 [2018-02-04 02:21:42,696 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:21:42,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-02-04 02:21:42,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2018-02-04 02:21:42,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-02-04 02:21:42,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 543 transitions. [2018-02-04 02:21:42,701 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 543 transitions. Word has length 30 [2018-02-04 02:21:42,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:42,701 INFO L432 AbstractCegarLoop]: Abstraction has 384 states and 543 transitions. [2018-02-04 02:21:42,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:21:42,701 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 543 transitions. [2018-02-04 02:21:42,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 02:21:42,701 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:42,701 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] [2018-02-04 02:21:42,701 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:42,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1240786582, now seen corresponding path program 1 times [2018-02-04 02:21:42,702 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:42,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:42,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:42,716 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:42,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:21:42,717 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:42,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:42,717 INFO L182 omatonBuilderFactory]: Interpolants [12569#true, 12570#false, 12571#(not |main_#t~short18|)] [2018-02-04 02:21:42,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:42,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:21:42,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:21:42,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:21:42,718 INFO L87 Difference]: Start difference. First operand 384 states and 543 transitions. Second operand 3 states. [2018-02-04 02:21:42,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:42,723 INFO L93 Difference]: Finished difference Result 387 states and 546 transitions. [2018-02-04 02:21:42,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:21:42,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-02-04 02:21:42,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:42,724 INFO L225 Difference]: With dead ends: 387 [2018-02-04 02:21:42,724 INFO L226 Difference]: Without dead ends: 387 [2018-02-04 02:21:42,724 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:21:42,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-02-04 02:21:42,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2018-02-04 02:21:42,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-02-04 02:21:42,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 546 transitions. [2018-02-04 02:21:42,728 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 546 transitions. Word has length 31 [2018-02-04 02:21:42,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:42,728 INFO L432 AbstractCegarLoop]: Abstraction has 387 states and 546 transitions. [2018-02-04 02:21:42,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:21:42,728 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 546 transitions. [2018-02-04 02:21:42,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 02:21:42,728 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:42,729 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:21:42,729 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:42,729 INFO L82 PathProgramCache]: Analyzing trace with hash 348971873, now seen corresponding path program 1 times [2018-02-04 02:21:42,729 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:42,734 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:42,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:42,745 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:42,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:21:42,745 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:42,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:42,745 INFO L182 omatonBuilderFactory]: Interpolants [13346#true, 13347#false, 13348#(and (= main_~pred~0.base 0) (= main_~pred~0.offset 0))] [2018-02-04 02:21:42,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:42,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:21:42,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:21:42,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:21:42,746 INFO L87 Difference]: Start difference. First operand 387 states and 546 transitions. Second operand 3 states. [2018-02-04 02:21:42,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:42,755 INFO L93 Difference]: Finished difference Result 428 states and 574 transitions. [2018-02-04 02:21:42,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:21:42,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-02-04 02:21:42,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:42,772 INFO L225 Difference]: With dead ends: 428 [2018-02-04 02:21:42,772 INFO L226 Difference]: Without dead ends: 428 [2018-02-04 02:21:42,773 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:21:42,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-02-04 02:21:42,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 379. [2018-02-04 02:21:42,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-02-04 02:21:42,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 526 transitions. [2018-02-04 02:21:42,779 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 526 transitions. Word has length 32 [2018-02-04 02:21:42,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:42,779 INFO L432 AbstractCegarLoop]: Abstraction has 379 states and 526 transitions. [2018-02-04 02:21:42,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:21:42,779 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 526 transitions. [2018-02-04 02:21:42,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 02:21:42,780 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:42,780 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] [2018-02-04 02:21:42,780 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:42,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1663635795, now seen corresponding path program 1 times [2018-02-04 02:21:42,781 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:42,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:42,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:42,954 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:42,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 02:21:42,954 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:42,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:42,955 INFO L182 omatonBuilderFactory]: Interpolants [14160#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 14161#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 14162#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 14163#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))), 14164#(and (= |main_#t~mem16.base| 0) (= |main_#t~mem16.offset| 0)), 14165#(not |main_#t~short18|), 14156#true, 14157#false, 14158#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4) 0) main_~tree~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4) 0) main_~tree~0.offset))), 14159#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.base|) main_~tree~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.offset|) main_~tree~0.offset)))] [2018-02-04 02:21:42,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:42,955 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 02:21:42,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 02:21:42,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:21:42,956 INFO L87 Difference]: Start difference. First operand 379 states and 526 transitions. Second operand 10 states. [2018-02-04 02:21:43,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:43,380 INFO L93 Difference]: Finished difference Result 605 states and 777 transitions. [2018-02-04 02:21:43,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 02:21:43,380 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-02-04 02:21:43,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:43,382 INFO L225 Difference]: With dead ends: 605 [2018-02-04 02:21:43,382 INFO L226 Difference]: Without dead ends: 605 [2018-02-04 02:21:43,382 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:21:43,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-02-04 02:21:43,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 396. [2018-02-04 02:21:43,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-02-04 02:21:43,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 548 transitions. [2018-02-04 02:21:43,386 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 548 transitions. Word has length 33 [2018-02-04 02:21:43,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:43,386 INFO L432 AbstractCegarLoop]: Abstraction has 396 states and 548 transitions. [2018-02-04 02:21:43,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 02:21:43,386 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 548 transitions. [2018-02-04 02:21:43,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 02:21:43,386 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:43,386 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] [2018-02-04 02:21:43,386 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:43,387 INFO L82 PathProgramCache]: Analyzing trace with hash 768774257, now seen corresponding path program 1 times [2018-02-04 02:21:43,387 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:43,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:43,551 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-04 02:21:43,551 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:21:43,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 02:21:43,552 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:43,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-04 02:21:43,552 INFO L182 omatonBuilderFactory]: Interpolants [15181#true, 15182#false, 15183#(= (select |#valid| 0) 0), 15184#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4) 0) main_~tree~0.offset)) (= (select |#valid| 0) 0) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4) 0) main_~tree~0.offset))), 15185#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.base|) main_~tree~0.offset)) (or (= 1 (select |#valid| 0)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.offset|) main_~tree~0.offset)))), 15186#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (or (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 1 (select |#valid| 0))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 15187#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (or (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 1 (select |#valid| 0))) (not (= main_~tree~0.base |main_#t~mem5.base|))), 15188#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (or (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 1 (select |#valid| 0)))), 15189#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (or (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 1 (select |#valid| 0)))), 15190#(and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) |main_#t~mem47.base|) (= |main_#t~mem47.base| 0) (or (= 0 |main_#t~mem47.offset|) (= 1 (select |#valid| 0)))), 15191#(or (and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= 1 (select |#valid| 0))) (not |main_#t~short49|)), 15192#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= 1 (select |#valid| 0))), 15193#(and (= 0 |main_#t~mem51.base|) (= 1 (select |#valid| 0))), 15194#(= 1 (select |#valid| main_~tmp~0.base))] [2018-02-04 02:21:43,552 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-04 02:21:43,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 02:21:43,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 02:21:43,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:21:43,553 INFO L87 Difference]: Start difference. First operand 396 states and 548 transitions. Second operand 14 states. [2018-02-04 02:21:44,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:44,563 INFO L93 Difference]: Finished difference Result 609 states and 779 transitions. [2018-02-04 02:21:44,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 02:21:44,564 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-02-04 02:21:44,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:44,565 INFO L225 Difference]: With dead ends: 609 [2018-02-04 02:21:44,565 INFO L226 Difference]: Without dead ends: 609 [2018-02-04 02:21:44,565 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=264, Invalid=792, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 02:21:44,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2018-02-04 02:21:44,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 441. [2018-02-04 02:21:44,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-02-04 02:21:44,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 623 transitions. [2018-02-04 02:21:44,569 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 623 transitions. Word has length 34 [2018-02-04 02:21:44,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:44,569 INFO L432 AbstractCegarLoop]: Abstraction has 441 states and 623 transitions. [2018-02-04 02:21:44,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 02:21:44,569 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 623 transitions. [2018-02-04 02:21:44,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 02:21:44,570 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:44,570 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:21:44,570 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:44,570 INFO L82 PathProgramCache]: Analyzing trace with hash -700463843, now seen corresponding path program 1 times [2018-02-04 02:21:44,571 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:44,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:44,696 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-04 02:21:44,696 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:21:44,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 02:21:44,696 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:44,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:44,696 INFO L182 omatonBuilderFactory]: Interpolants [16288#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= (select |#valid| main_~tree~0.base) 1)), 16289#(and (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 16290#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 16291#(and (= |main_#t~mem10.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 16292#(and (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~tmpList~0.base (store (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem12.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 16293#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 16294#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 16295#(= 1 (select |#valid| |main_#t~mem10.base|)), 16283#true, 16284#false, 16285#(= 1 (select |#valid| main_~tree~0.base)), 16286#(not (= main_~tree~0.base |main_#t~malloc3.base|)), 16287#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1))] [2018-02-04 02:21:44,697 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-04 02:21:44,697 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 02:21:44,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 02:21:44,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:21:44,697 INFO L87 Difference]: Start difference. First operand 441 states and 623 transitions. Second operand 13 states. [2018-02-04 02:21:45,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:45,151 INFO L93 Difference]: Finished difference Result 751 states and 986 transitions. [2018-02-04 02:21:45,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 02:21:45,152 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-02-04 02:21:45,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:45,153 INFO L225 Difference]: With dead ends: 751 [2018-02-04 02:21:45,153 INFO L226 Difference]: Without dead ends: 751 [2018-02-04 02:21:45,153 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:21:45,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2018-02-04 02:21:45,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 440. [2018-02-04 02:21:45,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-02-04 02:21:45,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 622 transitions. [2018-02-04 02:21:45,167 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 622 transitions. Word has length 34 [2018-02-04 02:21:45,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:45,168 INFO L432 AbstractCegarLoop]: Abstraction has 440 states and 622 transitions. [2018-02-04 02:21:45,168 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 02:21:45,168 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 622 transitions. [2018-02-04 02:21:45,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 02:21:45,168 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:45,168 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:21:45,168 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:45,168 INFO L82 PathProgramCache]: Analyzing trace with hash -700463842, now seen corresponding path program 1 times [2018-02-04 02:21:45,169 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:45,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:45,329 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-04 02:21:45,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:21:45,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 02:21:45,329 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:45,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:45,330 INFO L182 omatonBuilderFactory]: Interpolants [17505#true, 17506#false, 17507#(= 1 (select |#valid| main_~tree~0.base)), 17508#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 17509#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 17510#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= (select |#valid| main_~tree~0.base) 1)), 17511#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 17512#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 17513#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem10.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 17514#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~tmpList~0.base (store (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem12.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 17515#(and (= |main_#t~mem13.offset| 0) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 17516#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 17517#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 17518#(and (<= 0 |main_#t~mem10.offset|) (<= (+ |main_#t~mem10.offset| 4) (select |#length| |main_#t~mem10.base|)))] [2018-02-04 02:21:45,330 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-04 02:21:45,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 02:21:45,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 02:21:45,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:21:45,330 INFO L87 Difference]: Start difference. First operand 440 states and 622 transitions. Second operand 14 states. [2018-02-04 02:21:46,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:46,006 INFO L93 Difference]: Finished difference Result 750 states and 985 transitions. [2018-02-04 02:21:46,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 02:21:46,006 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-02-04 02:21:46,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:46,008 INFO L225 Difference]: With dead ends: 750 [2018-02-04 02:21:46,008 INFO L226 Difference]: Without dead ends: 750 [2018-02-04 02:21:46,009 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2018-02-04 02:21:46,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-02-04 02:21:46,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 435. [2018-02-04 02:21:46,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-02-04 02:21:46,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 617 transitions. [2018-02-04 02:21:46,015 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 617 transitions. Word has length 34 [2018-02-04 02:21:46,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:46,016 INFO L432 AbstractCegarLoop]: Abstraction has 435 states and 617 transitions. [2018-02-04 02:21:46,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 02:21:46,016 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 617 transitions. [2018-02-04 02:21:46,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 02:21:46,016 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:46,016 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:21:46,016 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:46,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1878204096, now seen corresponding path program 1 times [2018-02-04 02:21:46,017 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:46,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:46,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:46,143 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:46,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 02:21:46,143 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:46,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:46,144 INFO L182 omatonBuilderFactory]: Interpolants [18722#true, 18723#false, 18724#(= 0 |main_#t~malloc0.offset|), 18725#(= 0 main_~tree~0.offset), 18726#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 18727#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 main_~tree~0.offset)), 18728#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 18729#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset)), 18730#(and (= 0 main_~tree~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 18731#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 18732#(= 1 (select |#valid| |main_#t~mem56.base|))] [2018-02-04 02:21:46,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:46,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 02:21:46,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 02:21:46,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:21:46,144 INFO L87 Difference]: Start difference. First operand 435 states and 617 transitions. Second operand 11 states. [2018-02-04 02:21:46,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:46,671 INFO L93 Difference]: Finished difference Result 670 states and 884 transitions. [2018-02-04 02:21:46,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 02:21:46,673 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-02-04 02:21:46,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:46,674 INFO L225 Difference]: With dead ends: 670 [2018-02-04 02:21:46,674 INFO L226 Difference]: Without dead ends: 670 [2018-02-04 02:21:46,674 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2018-02-04 02:21:46,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-02-04 02:21:46,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 445. [2018-02-04 02:21:46,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-02-04 02:21:46,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 629 transitions. [2018-02-04 02:21:46,681 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 629 transitions. Word has length 35 [2018-02-04 02:21:46,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:46,681 INFO L432 AbstractCegarLoop]: Abstraction has 445 states and 629 transitions. [2018-02-04 02:21:46,681 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 02:21:46,681 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 629 transitions. [2018-02-04 02:21:46,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 02:21:46,681 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:46,682 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:21:46,682 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:46,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1878204095, now seen corresponding path program 1 times [2018-02-04 02:21:46,683 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:46,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:46,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:46,786 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:46,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 02:21:46,787 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:46,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:46,787 INFO L182 omatonBuilderFactory]: Interpolants [19878#true, 19879#false, 19880#(= 1 (select |#valid| main_~tree~0.base)), 19881#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|) (= 4 (select |#length| |main_#t~malloc3.base|))), 19882#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 19883#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~mem5.base|))), 19884#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 19885#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 19886#(and (= (select |#length| |main_#t~mem56.base|) 4) (= |main_#t~mem56.offset| 0))] [2018-02-04 02:21:46,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:46,788 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:21:46,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:21:46,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:21:46,788 INFO L87 Difference]: Start difference. First operand 445 states and 629 transitions. Second operand 9 states. [2018-02-04 02:21:47,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:47,326 INFO L93 Difference]: Finished difference Result 855 states and 1135 transitions. [2018-02-04 02:21:47,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 02:21:47,326 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-02-04 02:21:47,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:47,328 INFO L225 Difference]: With dead ends: 855 [2018-02-04 02:21:47,328 INFO L226 Difference]: Without dead ends: 855 [2018-02-04 02:21:47,328 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:21:47,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2018-02-04 02:21:47,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 445. [2018-02-04 02:21:47,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-02-04 02:21:47,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 628 transitions. [2018-02-04 02:21:47,335 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 628 transitions. Word has length 35 [2018-02-04 02:21:47,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:47,335 INFO L432 AbstractCegarLoop]: Abstraction has 445 states and 628 transitions. [2018-02-04 02:21:47,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:21:47,335 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 628 transitions. [2018-02-04 02:21:47,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 02:21:47,336 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:47,336 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:21:47,336 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:47,336 INFO L82 PathProgramCache]: Analyzing trace with hash 672897990, now seen corresponding path program 1 times [2018-02-04 02:21:47,337 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:47,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:47,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-04 02:21:47,370 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:47,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:21:47,371 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:47,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:47,371 INFO L182 omatonBuilderFactory]: Interpolants [21200#(= 1 (select |#valid| main_~newNode~0.base)), 21197#true, 21198#false, 21199#(= 1 (select |#valid| |main_#t~malloc25.base|))] [2018-02-04 02:21:47,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:47,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:21:47,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:21:47,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:21:47,372 INFO L87 Difference]: Start difference. First operand 445 states and 628 transitions. Second operand 4 states. [2018-02-04 02:21:47,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:47,584 INFO L93 Difference]: Finished difference Result 1124 states and 1602 transitions. [2018-02-04 02:21:47,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:21:47,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-02-04 02:21:47,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:47,587 INFO L225 Difference]: With dead ends: 1124 [2018-02-04 02:21:47,587 INFO L226 Difference]: Without dead ends: 1124 [2018-02-04 02:21:47,587 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:21:47,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2018-02-04 02:21:47,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 442. [2018-02-04 02:21:47,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-02-04 02:21:47,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 626 transitions. [2018-02-04 02:21:47,592 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 626 transitions. Word has length 35 [2018-02-04 02:21:47,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:47,592 INFO L432 AbstractCegarLoop]: Abstraction has 442 states and 626 transitions. [2018-02-04 02:21:47,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:21:47,593 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 626 transitions. [2018-02-04 02:21:47,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 02:21:47,593 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:47,593 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:21:47,593 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:47,593 INFO L82 PathProgramCache]: Analyzing trace with hash 672897991, now seen corresponding path program 1 times [2018-02-04 02:21:47,594 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:47,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:47,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:47,633 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:47,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:21:47,633 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:47,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:47,633 INFO L182 omatonBuilderFactory]: Interpolants [22770#true, 22771#false, 22772#(and (= 0 |main_#t~malloc25.offset|) (= 12 (select |#length| |main_#t~malloc25.base|))), 22773#(and (= main_~newNode~0.offset 0) (= (select |#length| main_~newNode~0.base) 12))] [2018-02-04 02:21:47,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:47,634 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:21:47,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:21:47,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:21:47,634 INFO L87 Difference]: Start difference. First operand 442 states and 626 transitions. Second operand 4 states. [2018-02-04 02:21:47,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:47,769 INFO L93 Difference]: Finished difference Result 444 states and 627 transitions. [2018-02-04 02:21:47,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 02:21:47,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-02-04 02:21:47,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:47,771 INFO L225 Difference]: With dead ends: 444 [2018-02-04 02:21:47,772 INFO L226 Difference]: Without dead ends: 444 [2018-02-04 02:21:47,772 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:21:47,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-02-04 02:21:47,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 443. [2018-02-04 02:21:47,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-02-04 02:21:47,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 626 transitions. [2018-02-04 02:21:47,777 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 626 transitions. Word has length 35 [2018-02-04 02:21:47,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:47,778 INFO L432 AbstractCegarLoop]: Abstraction has 443 states and 626 transitions. [2018-02-04 02:21:47,778 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:21:47,778 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 626 transitions. [2018-02-04 02:21:47,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 02:21:47,778 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:47,778 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] [2018-02-04 02:21:47,778 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:47,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1767576820, now seen corresponding path program 1 times [2018-02-04 02:21:47,779 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:47,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:47,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:47,823 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:47,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 02:21:47,823 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:47,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:47,824 INFO L182 omatonBuilderFactory]: Interpolants [23664#false, 23665#(and (= |main_#t~mem47.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) |main_#t~mem47.offset|)), 23666#(or |main_#t~short49| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))), 23667#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))), 23668#(and (= |main_#t~mem50.base| 0) (= 0 |main_#t~mem50.offset|)), 23663#true] [2018-02-04 02:21:47,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:47,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:21:47,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:21:47,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:21:47,825 INFO L87 Difference]: Start difference. First operand 443 states and 626 transitions. Second operand 6 states. [2018-02-04 02:21:47,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:47,967 INFO L93 Difference]: Finished difference Result 541 states and 775 transitions. [2018-02-04 02:21:47,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 02:21:47,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-04 02:21:47,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:47,968 INFO L225 Difference]: With dead ends: 541 [2018-02-04 02:21:47,968 INFO L226 Difference]: Without dead ends: 541 [2018-02-04 02:21:47,969 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:21:47,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-02-04 02:21:47,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 452. [2018-02-04 02:21:47,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-02-04 02:21:47,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 638 transitions. [2018-02-04 02:21:47,972 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 638 transitions. Word has length 36 [2018-02-04 02:21:47,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:47,972 INFO L432 AbstractCegarLoop]: Abstraction has 452 states and 638 transitions. [2018-02-04 02:21:47,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:21:47,972 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 638 transitions. [2018-02-04 02:21:47,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 02:21:47,973 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:47,973 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] [2018-02-04 02:21:47,973 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:47,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1761851182, now seen corresponding path program 1 times [2018-02-04 02:21:47,974 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:47,982 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:48,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:48,192 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:48,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 02:21:48,192 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:48,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:48,192 INFO L182 omatonBuilderFactory]: Interpolants [24672#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 24673#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 24674#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.base|) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.offset|) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset)), 24675#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 24676#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset)), 24677#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset)), 24678#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= main_~tmp~0.offset 0)), 24679#(and (= main_~tmp~0.offset 0) (= 0 |main_#t~mem48.base|) (= 0 |main_#t~mem48.offset|)), 24680#(and (= main_~tmp~0.offset 0) (not |main_#t~short49|)), 24668#true, 24669#false, 24670#(= 0 |main_#t~malloc0.offset|), 24671#(= 0 main_~tree~0.offset)] [2018-02-04 02:21:48,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:48,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 02:21:48,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 02:21:48,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:21:48,193 INFO L87 Difference]: Start difference. First operand 452 states and 638 transitions. Second operand 13 states. [2018-02-04 02:21:48,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:48,865 INFO L93 Difference]: Finished difference Result 574 states and 779 transitions. [2018-02-04 02:21:48,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 02:21:48,865 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-02-04 02:21:48,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:48,866 INFO L225 Difference]: With dead ends: 574 [2018-02-04 02:21:48,867 INFO L226 Difference]: Without dead ends: 574 [2018-02-04 02:21:48,867 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2018-02-04 02:21:48,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-02-04 02:21:48,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 410. [2018-02-04 02:21:48,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 02:21:48,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 565 transitions. [2018-02-04 02:21:48,870 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 565 transitions. Word has length 36 [2018-02-04 02:21:48,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:48,870 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 565 transitions. [2018-02-04 02:21:48,870 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 02:21:48,870 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 565 transitions. [2018-02-04 02:21:48,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 02:21:48,871 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:48,871 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-04 02:21:48,871 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:48,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1255975311, now seen corresponding path program 1 times [2018-02-04 02:21:48,871 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:48,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:48,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:48,986 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:48,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 02:21:48,986 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:48,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:48,986 INFO L182 omatonBuilderFactory]: Interpolants [25696#(= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))), 25697#(= |main_#t~mem64.offset| 0), 25687#true, 25688#false, 25689#(= 0 |main_#t~malloc0.offset|), 25690#(= 0 main_~tree~0.offset), 25691#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 25692#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|) (= 0 main_~tree~0.offset)), 25693#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 25694#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset)), 25695#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset))] [2018-02-04 02:21:48,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:48,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 02:21:48,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 02:21:48,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:21:48,987 INFO L87 Difference]: Start difference. First operand 410 states and 565 transitions. Second operand 11 states. [2018-02-04 02:21:49,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:49,358 INFO L93 Difference]: Finished difference Result 610 states and 784 transitions. [2018-02-04 02:21:49,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 02:21:49,358 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-02-04 02:21:49,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:49,360 INFO L225 Difference]: With dead ends: 610 [2018-02-04 02:21:49,360 INFO L226 Difference]: Without dead ends: 610 [2018-02-04 02:21:49,360 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2018-02-04 02:21:49,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-02-04 02:21:49,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 413. [2018-02-04 02:21:49,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-02-04 02:21:49,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 570 transitions. [2018-02-04 02:21:49,363 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 570 transitions. Word has length 38 [2018-02-04 02:21:49,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:49,363 INFO L432 AbstractCegarLoop]: Abstraction has 413 states and 570 transitions. [2018-02-04 02:21:49,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 02:21:49,363 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 570 transitions. [2018-02-04 02:21:49,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 02:21:49,364 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:49,364 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:21:49,364 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:49,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1255975312, now seen corresponding path program 1 times [2018-02-04 02:21:49,364 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:49,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:49,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:49,392 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:49,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:21:49,392 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:49,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:49,392 INFO L182 omatonBuilderFactory]: Interpolants [26745#true, 26746#false, 26747#(= |main_#t~mem56.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))), 26748#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 26749#(= 1 (select |#valid| |main_#t~mem64.base|))] [2018-02-04 02:21:49,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:49,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:21:49,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:21:49,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:21:49,393 INFO L87 Difference]: Start difference. First operand 413 states and 570 transitions. Second operand 5 states. [2018-02-04 02:21:49,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:49,509 INFO L93 Difference]: Finished difference Result 412 states and 565 transitions. [2018-02-04 02:21:49,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:21:49,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-04 02:21:49,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:49,510 INFO L225 Difference]: With dead ends: 412 [2018-02-04 02:21:49,510 INFO L226 Difference]: Without dead ends: 412 [2018-02-04 02:21:49,511 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:21:49,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-02-04 02:21:49,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2018-02-04 02:21:49,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-02-04 02:21:49,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 565 transitions. [2018-02-04 02:21:49,513 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 565 transitions. Word has length 38 [2018-02-04 02:21:49,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:49,513 INFO L432 AbstractCegarLoop]: Abstraction has 412 states and 565 transitions. [2018-02-04 02:21:49,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:21:49,513 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 565 transitions. [2018-02-04 02:21:49,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 02:21:49,514 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:49,514 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-04 02:21:49,514 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:49,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1255976497, now seen corresponding path program 1 times [2018-02-04 02:21:49,514 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:49,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:49,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:49,556 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:49,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:21:49,556 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:49,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:49,557 INFO L182 omatonBuilderFactory]: Interpolants [27578#true, 27579#false, 27580#(= |main_#t~mem56.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))), 27581#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 27582#(= 1 (select |#valid| |main_#t~mem59.base|))] [2018-02-04 02:21:49,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:49,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:21:49,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:21:49,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:21:49,558 INFO L87 Difference]: Start difference. First operand 412 states and 565 transitions. Second operand 5 states. [2018-02-04 02:21:49,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:49,663 INFO L93 Difference]: Finished difference Result 411 states and 561 transitions. [2018-02-04 02:21:49,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:21:49,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-04 02:21:49,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:49,664 INFO L225 Difference]: With dead ends: 411 [2018-02-04 02:21:49,664 INFO L226 Difference]: Without dead ends: 411 [2018-02-04 02:21:49,664 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:21:49,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-02-04 02:21:49,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2018-02-04 02:21:49,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-02-04 02:21:49,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 561 transitions. [2018-02-04 02:21:49,669 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 561 transitions. Word has length 38 [2018-02-04 02:21:49,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:49,669 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 561 transitions. [2018-02-04 02:21:49,669 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:21:49,669 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 561 transitions. [2018-02-04 02:21:49,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 02:21:49,670 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:49,670 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-04 02:21:49,670 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:49,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1255976498, now seen corresponding path program 1 times [2018-02-04 02:21:49,671 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:49,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:49,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:49,721 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:49,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:21:49,721 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:49,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:49,722 INFO L182 omatonBuilderFactory]: Interpolants [28409#true, 28410#false, 28411#(and (= |main_#t~mem56.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem56.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 28412#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 28413#(and (<= (+ |main_#t~mem59.offset| 4) (select |#length| |main_#t~mem59.base|)) (<= 0 |main_#t~mem59.offset|))] [2018-02-04 02:21:49,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:49,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:21:49,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:21:49,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:21:49,722 INFO L87 Difference]: Start difference. First operand 411 states and 561 transitions. Second operand 5 states. [2018-02-04 02:21:49,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:49,871 INFO L93 Difference]: Finished difference Result 410 states and 557 transitions. [2018-02-04 02:21:49,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:21:49,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-04 02:21:49,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:49,872 INFO L225 Difference]: With dead ends: 410 [2018-02-04 02:21:49,872 INFO L226 Difference]: Without dead ends: 410 [2018-02-04 02:21:49,872 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:21:49,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-02-04 02:21:49,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2018-02-04 02:21:49,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 02:21:49,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 557 transitions. [2018-02-04 02:21:49,874 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 557 transitions. Word has length 38 [2018-02-04 02:21:49,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:49,874 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 557 transitions. [2018-02-04 02:21:49,874 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:21:49,874 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 557 transitions. [2018-02-04 02:21:49,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 02:21:49,875 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:49,875 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-04 02:21:49,875 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:49,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1691774874, now seen corresponding path program 1 times [2018-02-04 02:21:49,875 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:49,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:49,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:49,931 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:49,931 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:21:49,931 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:49,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:49,931 INFO L182 omatonBuilderFactory]: Interpolants [29238#true, 29239#false, 29240#(and (= 0 |main_#t~malloc25.offset|) (= 12 (select |#length| |main_#t~malloc25.base|))), 29241#(and (= main_~newNode~0.offset 0) (= (select |#length| main_~newNode~0.base) 12)), 29242#(and (= main_~newNode~0.offset 0) (= (select |#valid| main_~newNode~0.base) 1) (= (select |#length| main_~newNode~0.base) 12)), 29243#(and (<= 12 (select |#length| main_~newNode~0.base)) (= main_~newNode~0.offset 0))] [2018-02-04 02:21:49,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:49,932 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:21:49,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:21:49,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:21:49,932 INFO L87 Difference]: Start difference. First operand 410 states and 557 transitions. Second operand 6 states. [2018-02-04 02:21:50,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:50,174 INFO L93 Difference]: Finished difference Result 852 states and 1192 transitions. [2018-02-04 02:21:50,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 02:21:50,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-02-04 02:21:50,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:50,176 INFO L225 Difference]: With dead ends: 852 [2018-02-04 02:21:50,176 INFO L226 Difference]: Without dead ends: 852 [2018-02-04 02:21:50,176 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:21:50,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2018-02-04 02:21:50,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 414. [2018-02-04 02:21:50,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-02-04 02:21:50,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 561 transitions. [2018-02-04 02:21:50,180 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 561 transitions. Word has length 38 [2018-02-04 02:21:50,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:50,180 INFO L432 AbstractCegarLoop]: Abstraction has 414 states and 561 transitions. [2018-02-04 02:21:50,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:21:50,180 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 561 transitions. [2018-02-04 02:21:50,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 02:21:50,181 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:50,181 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:21:50,181 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:50,181 INFO L82 PathProgramCache]: Analyzing trace with hash 156771650, now seen corresponding path program 1 times [2018-02-04 02:21:50,182 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:50,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:50,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:50,202 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:50,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:21:50,202 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:50,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:50,202 INFO L182 omatonBuilderFactory]: Interpolants [30514#true, 30515#false, 30516#(= 1 (select |#valid| |main_#t~malloc30.base|)), 30517#(= 1 (select |#valid| main_~newNode~0.base))] [2018-02-04 02:21:50,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:50,203 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:21:50,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:21:50,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:21:50,203 INFO L87 Difference]: Start difference. First operand 414 states and 561 transitions. Second operand 4 states. [2018-02-04 02:21:50,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:50,381 INFO L93 Difference]: Finished difference Result 1097 states and 1518 transitions. [2018-02-04 02:21:50,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:21:50,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-02-04 02:21:50,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:50,384 INFO L225 Difference]: With dead ends: 1097 [2018-02-04 02:21:50,384 INFO L226 Difference]: Without dead ends: 1097 [2018-02-04 02:21:50,384 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:21:50,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-02-04 02:21:50,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 413. [2018-02-04 02:21:50,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-02-04 02:21:50,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 560 transitions. [2018-02-04 02:21:50,389 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 560 transitions. Word has length 39 [2018-02-04 02:21:50,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:50,389 INFO L432 AbstractCegarLoop]: Abstraction has 413 states and 560 transitions. [2018-02-04 02:21:50,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:21:50,389 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 560 transitions. [2018-02-04 02:21:50,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 02:21:50,390 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:50,390 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:21:50,390 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:50,390 INFO L82 PathProgramCache]: Analyzing trace with hash 156771651, now seen corresponding path program 1 times [2018-02-04 02:21:50,390 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:50,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:50,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:50,419 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:50,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:21:50,419 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:50,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:50,419 INFO L182 omatonBuilderFactory]: Interpolants [32032#false, 32033#(and (= 0 |main_#t~malloc30.offset|) (= 12 (select |#length| |main_#t~malloc30.base|))), 32034#(and (= main_~newNode~0.offset 0) (= (select |#length| main_~newNode~0.base) 12)), 32031#true] [2018-02-04 02:21:50,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:50,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:21:50,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:21:50,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:21:50,420 INFO L87 Difference]: Start difference. First operand 413 states and 560 transitions. Second operand 4 states. [2018-02-04 02:21:50,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:50,494 INFO L93 Difference]: Finished difference Result 411 states and 558 transitions. [2018-02-04 02:21:50,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 02:21:50,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-02-04 02:21:50,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:50,495 INFO L225 Difference]: With dead ends: 411 [2018-02-04 02:21:50,495 INFO L226 Difference]: Without dead ends: 411 [2018-02-04 02:21:50,495 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:21:50,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-02-04 02:21:50,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2018-02-04 02:21:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-02-04 02:21:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 558 transitions. [2018-02-04 02:21:50,498 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 558 transitions. Word has length 39 [2018-02-04 02:21:50,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:50,498 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 558 transitions. [2018-02-04 02:21:50,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:21:50,498 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 558 transitions. [2018-02-04 02:21:50,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 02:21:50,498 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:50,498 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:21:50,499 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:50,499 INFO L82 PathProgramCache]: Analyzing trace with hash 106473297, now seen corresponding path program 1 times [2018-02-04 02:21:50,500 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:50,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:50,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:50,651 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:50,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-04 02:21:50,651 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:50,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:50,651 INFO L182 omatonBuilderFactory]: Interpolants [32864#(and (= main_~tmp~0.offset 0) (= 1 (select |#valid| main_~tmp~0.base)) (not (= 0 main_~tmp~0.base))), 32865#(and (= 1 (select |#valid| main_~tmp~0.base)) (not (= 0 main_~tmp~0.base)) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 0) |main_#t~mem47.base|)), 32866#(and (or |main_#t~short49| (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 0) main_~tmp~0.base))) (= 1 (select |#valid| main_~tmp~0.base))), 32867#(and (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 0) main_~tmp~0.base)) (= 1 (select |#valid| main_~tmp~0.base))), 32868#(and (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 0) main_~tmp~0.base)) (= 1 (select |#valid| main_~tmp~0.base)) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem57.base|)), 32869#(and (= |main_#t~mem56.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 0) main_~tmp~0.base)) (= 1 (select |#valid| main_~tmp~0.base)) (= |main_#t~mem56.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem57.base|)), 32870#(and (or (not (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= |main_#t~mem58.base| main_~tmp~0.base)) (not (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select |#memory_$Pointer$.base| main_~tmp~0.base)))) (= 1 (select |#valid| main_~tmp~0.base)) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem57.base|)), 32871#(and (= 1 (select |#valid| main_~tmp~0.base)) (or (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) main_~tmp~0.base)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))), 32872#(and (or (not (= 0 |main_#t~mem64.offset|)) (= 1 (select (store |#valid| |main_#t~mem64.base| 0) main_~tmp~0.base))) (= 1 (select |#valid| main_~tmp~0.base))), 32873#(= 1 (select |#valid| main_~tmp~0.base)), 32859#true, 32860#false, 32861#(and (not (= 0 |main_#t~malloc0.base|)) (= |main_#t~malloc0.offset| 0)), 32862#(and (= main_~tree~0.offset 0) (not (= 0 main_~tree~0.base))), 32863#(and (= main_~tree~0.offset 0) (not (= 0 main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1))] [2018-02-04 02:21:50,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:50,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 02:21:50,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 02:21:50,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:21:50,652 INFO L87 Difference]: Start difference. First operand 411 states and 558 transitions. Second operand 15 states. [2018-02-04 02:21:51,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:51,420 INFO L93 Difference]: Finished difference Result 722 states and 905 transitions. [2018-02-04 02:21:51,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 02:21:51,420 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-02-04 02:21:51,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:51,421 INFO L225 Difference]: With dead ends: 722 [2018-02-04 02:21:51,421 INFO L226 Difference]: Without dead ends: 722 [2018-02-04 02:21:51,422 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=328, Invalid=1154, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 02:21:51,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2018-02-04 02:21:51,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 438. [2018-02-04 02:21:51,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-02-04 02:21:51,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 600 transitions. [2018-02-04 02:21:51,425 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 600 transitions. Word has length 40 [2018-02-04 02:21:51,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:51,425 INFO L432 AbstractCegarLoop]: Abstraction has 438 states and 600 transitions. [2018-02-04 02:21:51,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 02:21:51,425 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 600 transitions. [2018-02-04 02:21:51,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 02:21:51,426 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:51,426 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:21:51,426 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:51,426 INFO L82 PathProgramCache]: Analyzing trace with hash -958985529, now seen corresponding path program 1 times [2018-02-04 02:21:51,426 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:51,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:51,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:51,572 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:51,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-04 02:21:51,572 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:51,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:51,573 INFO L182 omatonBuilderFactory]: Interpolants [34082#true, 34083#false, 34084#(= 1 (select |#valid| main_~tree~0.base)), 34085#(not (= main_~tree~0.base |main_#t~malloc3.base|)), 34086#(not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 34087#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 34088#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~mem7.base|)), 34089#(= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 34090#(= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 34091#(and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem57.base|)), 34092#(and (= |main_#t~mem56.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| |main_#t~mem56.base|) |main_#t~mem56.offset|)) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem56.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 34093#(and (= 1 (select |#valid| |main_#t~mem57.base|)) (= |main_#t~mem58.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem58.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 34094#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 34095#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem59.base|) |main_#t~mem59.offset|))), 34096#(= 1 (select |#valid| |main_#t~mem60.base|)), 34097#(= 1 (select |#valid| main_~tmpList~0.base))] [2018-02-04 02:21:51,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:51,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 02:21:51,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 02:21:51,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-02-04 02:21:51,573 INFO L87 Difference]: Start difference. First operand 438 states and 600 transitions. Second operand 16 states. [2018-02-04 02:21:52,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:52,124 INFO L93 Difference]: Finished difference Result 755 states and 959 transitions. [2018-02-04 02:21:52,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 02:21:52,124 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-02-04 02:21:52,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:52,125 INFO L225 Difference]: With dead ends: 755 [2018-02-04 02:21:52,126 INFO L226 Difference]: Without dead ends: 755 [2018-02-04 02:21:52,126 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2018-02-04 02:21:52,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-02-04 02:21:52,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 443. [2018-02-04 02:21:52,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-02-04 02:21:52,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 606 transitions. [2018-02-04 02:21:52,129 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 606 transitions. Word has length 41 [2018-02-04 02:21:52,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:52,129 INFO L432 AbstractCegarLoop]: Abstraction has 443 states and 606 transitions. [2018-02-04 02:21:52,129 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 02:21:52,129 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 606 transitions. [2018-02-04 02:21:52,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 02:21:52,130 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:52,130 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:21:52,130 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:52,130 INFO L82 PathProgramCache]: Analyzing trace with hash -958985528, now seen corresponding path program 1 times [2018-02-04 02:21:52,130 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:52,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:52,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:52,232 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:52,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 02:21:52,232 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:52,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-04 02:21:52,232 INFO L182 omatonBuilderFactory]: Interpolants [35328#(not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 35329#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 35330#(and (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~mem7.offset|) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~mem7.base|)), 35331#(and (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 35332#(and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 35333#(and (= |main_#t~mem57.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 35334#(and (= |main_#t~mem57.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| |main_#t~mem56.base|) |main_#t~mem56.offset|)) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.offset| |main_#t~mem56.base|) |main_#t~mem56.offset|)) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 35335#(and (= |main_#t~mem58.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem57.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem58.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 35324#true, 35325#false, 35326#(= 1 (select |#valid| main_~tree~0.base)), 35327#(not (= main_~tree~0.base |main_#t~malloc3.base|))] [2018-02-04 02:21:52,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-04 02:21:52,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 02:21:52,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 02:21:52,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 02:21:52,233 INFO L87 Difference]: Start difference. First operand 443 states and 606 transitions. Second operand 12 states. [2018-02-04 02:21:52,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:52,645 INFO L93 Difference]: Finished difference Result 593 states and 767 transitions. [2018-02-04 02:21:52,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 02:21:52,645 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-02-04 02:21:52,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:52,647 INFO L225 Difference]: With dead ends: 593 [2018-02-04 02:21:52,647 INFO L226 Difference]: Without dead ends: 593 [2018-02-04 02:21:52,647 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2018-02-04 02:21:52,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2018-02-04 02:21:52,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 438. [2018-02-04 02:21:52,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-02-04 02:21:52,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 599 transitions. [2018-02-04 02:21:52,650 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 599 transitions. Word has length 41 [2018-02-04 02:21:52,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:52,650 INFO L432 AbstractCegarLoop]: Abstraction has 438 states and 599 transitions. [2018-02-04 02:21:52,650 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 02:21:52,650 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 599 transitions. [2018-02-04 02:21:52,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 02:21:52,650 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:52,650 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:21:52,651 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:52,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1775844849, now seen corresponding path program 1 times [2018-02-04 02:21:52,651 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:52,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:52,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:52,684 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:52,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:21:52,684 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:52,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:52,684 INFO L182 omatonBuilderFactory]: Interpolants [36385#true, 36386#false, 36387#(= 1 (select |#valid| |main_#t~malloc35.base|)), 36388#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))), 36389#(= 1 (select |#valid| |main_#t~mem37.base|))] [2018-02-04 02:21:52,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:52,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:21:52,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:21:52,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:21:52,685 INFO L87 Difference]: Start difference. First operand 438 states and 599 transitions. Second operand 5 states. [2018-02-04 02:21:52,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:52,866 INFO L93 Difference]: Finished difference Result 653 states and 894 transitions. [2018-02-04 02:21:52,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:21:52,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-02-04 02:21:52,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:52,868 INFO L225 Difference]: With dead ends: 653 [2018-02-04 02:21:52,868 INFO L226 Difference]: Without dead ends: 653 [2018-02-04 02:21:52,869 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-04 02:21:52,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-02-04 02:21:52,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 437. [2018-02-04 02:21:52,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-02-04 02:21:52,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 598 transitions. [2018-02-04 02:21:52,873 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 598 transitions. Word has length 41 [2018-02-04 02:21:52,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:52,874 INFO L432 AbstractCegarLoop]: Abstraction has 437 states and 598 transitions. [2018-02-04 02:21:52,874 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:21:52,874 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 598 transitions. [2018-02-04 02:21:52,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 02:21:52,874 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:52,874 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:21:52,875 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:52,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1775844848, now seen corresponding path program 1 times [2018-02-04 02:21:52,875 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:52,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:52,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:52,946 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:52,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:21:52,946 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:52,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:52,946 INFO L182 omatonBuilderFactory]: Interpolants [37488#(and (= 0 |main_#t~malloc35.offset|) (= 4 (select |#length| |main_#t~malloc35.base|))), 37489#(and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))), 37490#(and (= (select |#length| |main_#t~mem37.base|) 4) (= |main_#t~mem37.offset| 0)), 37486#true, 37487#false] [2018-02-04 02:21:52,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:52,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:21:52,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:21:52,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:21:52,947 INFO L87 Difference]: Start difference. First operand 437 states and 598 transitions. Second operand 5 states. [2018-02-04 02:21:53,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:53,138 INFO L93 Difference]: Finished difference Result 668 states and 914 transitions. [2018-02-04 02:21:53,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:21:53,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-02-04 02:21:53,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:53,140 INFO L225 Difference]: With dead ends: 668 [2018-02-04 02:21:53,140 INFO L226 Difference]: Without dead ends: 668 [2018-02-04 02:21:53,140 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:21:53,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-02-04 02:21:53,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 436. [2018-02-04 02:21:53,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-02-04 02:21:53,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 597 transitions. [2018-02-04 02:21:53,145 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 597 transitions. Word has length 41 [2018-02-04 02:21:53,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:53,145 INFO L432 AbstractCegarLoop]: Abstraction has 436 states and 597 transitions. [2018-02-04 02:21:53,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:21:53,145 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 597 transitions. [2018-02-04 02:21:53,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 02:21:53,146 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:53,146 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:21:53,146 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:53,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1754899614, now seen corresponding path program 1 times [2018-02-04 02:21:53,146 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:53,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:53,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:53,178 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:53,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:21:53,178 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:53,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:53,179 INFO L182 omatonBuilderFactory]: Interpolants [38601#true, 38602#false, 38603#(and (= 0 |main_#t~malloc30.offset|) (= 12 (select |#length| |main_#t~malloc30.base|))), 38604#(and (= main_~newNode~0.offset 0) (= 12 (select |#length| main_~newNode~0.base))), 38605#(and (= main_~newNode~0.offset 0) (= (select |#valid| main_~newNode~0.base) 1) (= 12 (select |#length| main_~newNode~0.base)))] [2018-02-04 02:21:53,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:53,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:21:53,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:21:53,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:21:53,179 INFO L87 Difference]: Start difference. First operand 436 states and 597 transitions. Second operand 5 states. [2018-02-04 02:21:53,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:53,347 INFO L93 Difference]: Finished difference Result 877 states and 1237 transitions. [2018-02-04 02:21:53,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 02:21:53,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-02-04 02:21:53,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:53,349 INFO L225 Difference]: With dead ends: 877 [2018-02-04 02:21:53,349 INFO L226 Difference]: Without dead ends: 877 [2018-02-04 02:21:53,350 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:21:53,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2018-02-04 02:21:53,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 427. [2018-02-04 02:21:53,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-02-04 02:21:53,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 588 transitions. [2018-02-04 02:21:53,353 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 588 transitions. Word has length 42 [2018-02-04 02:21:53,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:53,353 INFO L432 AbstractCegarLoop]: Abstraction has 427 states and 588 transitions. [2018-02-04 02:21:53,353 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:21:53,353 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 588 transitions. [2018-02-04 02:21:53,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 02:21:53,354 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:53,354 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, 1] [2018-02-04 02:21:53,354 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:53,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1349100373, now seen corresponding path program 1 times [2018-02-04 02:21:53,354 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:53,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:53,681 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-04 02:21:53,681 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:21:53,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 02:21:53,681 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:53,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:53,681 INFO L182 omatonBuilderFactory]: Interpolants [39914#true, 39915#false, 39916#(= 0 (select |#valid| 0)), 39917#(and (= |#valid| |old(#valid)|) (= 0 (select |#valid| 0))), 39918#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|) (= 0 (select |#valid| 0))), 39919#(and (not (= 0 main_~tree~0.base)) (= (store |#valid| main_~tree~0.base 0) |old(#valid)|) (= 0 (select |#valid| 0)) (= 0 main_~tree~0.offset)), 39920#(and (= 1 (select |#valid| main_~tree~0.base)) (= (store |#valid| main_~tree~0.base 0) |old(#valid)|) (= 0 (select |#valid| 0)) (= 0 main_~tree~0.offset)), 39921#(and (= |old(#valid)| (store (store |#valid| main_~tree~0.base 0) |main_#t~malloc3.base| 0)) (not (= 0 main_~tree~0.base)) (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 (select |#valid| 0)) (= 0 main_~tree~0.offset)), 39922#(and (not (= 0 main_~tree~0.base)) (= 0 (select |#valid| 0)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) |old(#valid)|)), 39923#(and (not (= 0 main_~tree~0.base)) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 (select |#valid| 0)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) |old(#valid)|)), 39924#(and (= |old(#valid)| (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= 0 (select |#valid| 0)) (not (= 0 main_~tmp~0.base))), 39925#(and (or (and (not (= 0 |main_#t~mem56.base|)) (= |main_#t~mem56.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= 0 (select |#valid| |main_#t~mem56.base|))) (= |old(#valid)| (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= 0 main_~tmp~0.base))), 39926#(and (= |old(#valid)| (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= 0 main_~tmp~0.base))), 39927#(and (= (store (store |#valid| main_~tmp~0.base 0) |main_#t~mem64.base| (select (store |#valid| |main_#t~mem64.base| 0) |main_#t~mem64.base|)) |old(#valid)|) (not (= 0 |main_#t~mem64.base|)) (not (= 0 main_~tmp~0.base)) (not (= |main_#t~mem64.base| main_~tmp~0.base))), 39928#(and (= (store |#valid| main_~tmp~0.base 0) |old(#valid)|) (not (= 0 main_~tmp~0.base))), 39929#(= |#valid| |old(#valid)|)] [2018-02-04 02:21:53,682 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-04 02:21:53,682 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 02:21:53,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 02:21:53,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-02-04 02:21:53,682 INFO L87 Difference]: Start difference. First operand 427 states and 588 transitions. Second operand 16 states. [2018-02-04 02:21:54,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:54,563 INFO L93 Difference]: Finished difference Result 509 states and 683 transitions. [2018-02-04 02:21:54,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 02:21:54,563 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-02-04 02:21:54,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:54,564 INFO L225 Difference]: With dead ends: 509 [2018-02-04 02:21:54,565 INFO L226 Difference]: Without dead ends: 507 [2018-02-04 02:21:54,565 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2018-02-04 02:21:54,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-02-04 02:21:54,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 431. [2018-02-04 02:21:54,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-02-04 02:21:54,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 592 transitions. [2018-02-04 02:21:54,569 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 592 transitions. Word has length 44 [2018-02-04 02:21:54,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:54,569 INFO L432 AbstractCegarLoop]: Abstraction has 431 states and 592 transitions. [2018-02-04 02:21:54,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 02:21:54,569 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 592 transitions. [2018-02-04 02:21:54,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 02:21:54,569 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:54,569 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] [2018-02-04 02:21:54,569 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:54,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1349098584, now seen corresponding path program 1 times [2018-02-04 02:21:54,570 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:54,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:54,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:54,597 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:54,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:21:54,597 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:54,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:54,598 INFO L182 omatonBuilderFactory]: Interpolants [40896#(and (= main_~tree~0.base 0) (= main_~tree~0.offset 0)), 40894#true, 40895#false] [2018-02-04 02:21:54,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:54,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:21:54,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:21:54,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:21:54,598 INFO L87 Difference]: Start difference. First operand 431 states and 592 transitions. Second operand 3 states. [2018-02-04 02:21:54,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:54,608 INFO L93 Difference]: Finished difference Result 419 states and 539 transitions. [2018-02-04 02:21:54,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:21:54,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-02-04 02:21:54,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:54,611 INFO L225 Difference]: With dead ends: 419 [2018-02-04 02:21:54,611 INFO L226 Difference]: Without dead ends: 398 [2018-02-04 02:21:54,611 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:21:54,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-02-04 02:21:54,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 382. [2018-02-04 02:21:54,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-04 02:21:54,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 518 transitions. [2018-02-04 02:21:54,613 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 518 transitions. Word has length 44 [2018-02-04 02:21:54,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:54,614 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 518 transitions. [2018-02-04 02:21:54,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:21:54,614 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 518 transitions. [2018-02-04 02:21:54,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 02:21:54,614 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:54,614 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] [2018-02-04 02:21:54,614 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:54,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1114352130, now seen corresponding path program 1 times [2018-02-04 02:21:54,615 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:54,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:54,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:54,771 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:21:54,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 02:21:54,771 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:54,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:54,772 INFO L182 omatonBuilderFactory]: Interpolants [41698#true, 41699#false, 41700#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4) 0) main_~tree~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4) 0) main_~tree~0.offset))), 41701#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.base|) main_~tree~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.offset|) main_~tree~0.offset))), 41702#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 41703#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= (select |#valid| main_~tree~0.base) 1)), 41704#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~malloc9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 41705#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 41706#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem13.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) |main_#t~mem13.offset| main_~tmpList~0.offset)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base |main_#t~mem13.base|))), 41707#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 41708#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))), 41709#(and (= |main_#t~mem16.base| 0) (= |main_#t~mem16.offset| 0)), 41710#(not |main_#t~short18|)] [2018-02-04 02:21:54,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:54,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 02:21:54,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 02:21:54,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:21:54,772 INFO L87 Difference]: Start difference. First operand 382 states and 518 transitions. Second operand 13 states. [2018-02-04 02:21:55,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:55,509 INFO L93 Difference]: Finished difference Result 619 states and 785 transitions. [2018-02-04 02:21:55,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 02:21:55,509 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2018-02-04 02:21:55,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:55,510 INFO L225 Difference]: With dead ends: 619 [2018-02-04 02:21:55,510 INFO L226 Difference]: Without dead ends: 619 [2018-02-04 02:21:55,511 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2018-02-04 02:21:55,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-02-04 02:21:55,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 399. [2018-02-04 02:21:55,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-02-04 02:21:55,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 540 transitions. [2018-02-04 02:21:55,514 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 540 transitions. Word has length 45 [2018-02-04 02:21:55,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:55,515 INFO L432 AbstractCegarLoop]: Abstraction has 399 states and 540 transitions. [2018-02-04 02:21:55,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 02:21:55,515 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 540 transitions. [2018-02-04 02:21:55,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 02:21:55,515 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:55,515 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-04 02:21:55,515 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:55,515 INFO L82 PathProgramCache]: Analyzing trace with hash 550494502, now seen corresponding path program 1 times [2018-02-04 02:21:55,516 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:55,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:55,715 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:55,716 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:21:55,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 02:21:55,716 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:55,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:55,716 INFO L182 omatonBuilderFactory]: Interpolants [42755#true, 42756#false, 42757#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4) 0) main_~tree~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4) 0) main_~tree~0.offset))), 42758#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.base|) main_~tree~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.offset|) main_~tree~0.offset))), 42759#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 42760#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= (select |#valid| main_~tree~0.base) 1)), 42761#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~malloc9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 42762#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 42763#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem13.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) |main_#t~mem13.offset| main_~tmpList~0.offset)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base |main_#t~mem13.base|))), 42764#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 42765#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))), 42766#(and (= |main_#t~mem47.base| 0) (= 0 |main_#t~mem47.offset|)), 42767#(not |main_#t~short49|)] [2018-02-04 02:21:55,716 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:55,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 02:21:55,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 02:21:55,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:21:55,717 INFO L87 Difference]: Start difference. First operand 399 states and 540 transitions. Second operand 13 states. [2018-02-04 02:21:56,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:56,396 INFO L93 Difference]: Finished difference Result 609 states and 771 transitions. [2018-02-04 02:21:56,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 02:21:56,396 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-02-04 02:21:56,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:56,397 INFO L225 Difference]: With dead ends: 609 [2018-02-04 02:21:56,397 INFO L226 Difference]: Without dead ends: 609 [2018-02-04 02:21:56,397 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2018-02-04 02:21:56,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2018-02-04 02:21:56,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 450. [2018-02-04 02:21:56,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-02-04 02:21:56,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 621 transitions. [2018-02-04 02:21:56,400 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 621 transitions. Word has length 46 [2018-02-04 02:21:56,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:56,400 INFO L432 AbstractCegarLoop]: Abstraction has 450 states and 621 transitions. [2018-02-04 02:21:56,400 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 02:21:56,401 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 621 transitions. [2018-02-04 02:21:56,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 02:21:56,401 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:56,401 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] [2018-02-04 02:21:56,401 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:56,401 INFO L82 PathProgramCache]: Analyzing trace with hash -54941909, now seen corresponding path program 1 times [2018-02-04 02:21:56,402 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:56,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:56,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:56,501 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:21:56,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 02:21:56,501 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:56,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:56,502 INFO L182 omatonBuilderFactory]: Interpolants [43857#true, 43858#false, 43859#(= 1 (select |#valid| main_~tree~0.base)), 43860#(not (= main_~tree~0.base |main_#t~malloc3.base|)), 43861#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 43862#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= (select |#valid| main_~tree~0.base) 1)), 43863#(and (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 43864#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 43865#(and (= |main_#t~mem10.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 43866#(and (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~tmpList~0.base (store (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem12.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 43867#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 43868#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 43869#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 43870#(= 1 (select |#valid| |main_#t~mem56.base|))] [2018-02-04 02:21:56,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:56,502 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 02:21:56,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 02:21:56,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:21:56,502 INFO L87 Difference]: Start difference. First operand 450 states and 621 transitions. Second operand 14 states. [2018-02-04 02:21:56,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:56,992 INFO L93 Difference]: Finished difference Result 655 states and 865 transitions. [2018-02-04 02:21:56,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 02:21:56,992 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2018-02-04 02:21:56,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:56,993 INFO L225 Difference]: With dead ends: 655 [2018-02-04 02:21:56,994 INFO L226 Difference]: Without dead ends: 655 [2018-02-04 02:21:56,994 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2018-02-04 02:21:56,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2018-02-04 02:21:56,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 455. [2018-02-04 02:21:56,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-02-04 02:21:56,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 627 transitions. [2018-02-04 02:21:56,997 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 627 transitions. Word has length 47 [2018-02-04 02:21:56,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:56,997 INFO L432 AbstractCegarLoop]: Abstraction has 455 states and 627 transitions. [2018-02-04 02:21:56,997 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 02:21:56,997 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 627 transitions. [2018-02-04 02:21:56,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 02:21:56,998 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:56,998 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] [2018-02-04 02:21:56,998 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:56,998 INFO L82 PathProgramCache]: Analyzing trace with hash -54941908, now seen corresponding path program 1 times [2018-02-04 02:21:56,998 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:57,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:57,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:57,201 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:21:57,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 02:21:57,201 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:57,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:57,201 INFO L182 omatonBuilderFactory]: Interpolants [45024#(and (= (select |#length| |main_#t~mem56.base|) 4) (= |main_#t~mem56.offset| 0)), 45011#true, 45012#false, 45013#(= 1 (select |#valid| main_~tree~0.base)), 45014#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|) (= 4 (select |#length| |main_#t~malloc3.base|))), 45015#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 45016#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= (select |#valid| main_~tree~0.base) 1)), 45017#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 45018#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 45019#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 45020#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem10.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| |main_#t~mem10.base|)) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 45021#(and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem13.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) |main_#t~mem13.offset| main_~tmpList~0.offset)) main_~tree~0.base) (+ main_~tree~0.offset 8)))), 45022#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 45023#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))] [2018-02-04 02:21:57,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:57,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 02:21:57,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 02:21:57,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:21:57,202 INFO L87 Difference]: Start difference. First operand 455 states and 627 transitions. Second operand 14 states. [2018-02-04 02:21:57,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:57,970 INFO L93 Difference]: Finished difference Result 750 states and 981 transitions. [2018-02-04 02:21:57,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 02:21:57,971 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2018-02-04 02:21:57,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:57,972 INFO L225 Difference]: With dead ends: 750 [2018-02-04 02:21:57,972 INFO L226 Difference]: Without dead ends: 750 [2018-02-04 02:21:57,973 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2018-02-04 02:21:57,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-02-04 02:21:57,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 455. [2018-02-04 02:21:57,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-02-04 02:21:57,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 626 transitions. [2018-02-04 02:21:57,978 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 626 transitions. Word has length 47 [2018-02-04 02:21:57,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:57,978 INFO L432 AbstractCegarLoop]: Abstraction has 455 states and 626 transitions. [2018-02-04 02:21:57,978 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 02:21:57,978 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 626 transitions. [2018-02-04 02:21:57,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 02:21:57,978 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:57,978 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, 1, 1] [2018-02-04 02:21:57,978 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:57,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1075298233, now seen corresponding path program 1 times [2018-02-04 02:21:57,979 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:57,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:58,151 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:58,152 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:21:58,152 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 02:21:58,152 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:58,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:58,152 INFO L182 omatonBuilderFactory]: Interpolants [46256#true, 46257#false, 46258#(= 1 (select |#valid| main_~tree~0.base)), 46259#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= (select |#valid| main_~tree~0.base) 1)), 46260#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.base|) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.offset|) (+ main_~tree~0.offset 4)))), 46261#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 46262#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= (select |#valid| main_~tree~0.base) 1)), 46263#(and (not (= main_~tree~0.base |main_#t~malloc9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 46264#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 46265#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem13.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) |main_#t~mem13.offset| main_~tmpList~0.offset)) main_~tree~0.base) (+ main_~tree~0.offset 4)))), 46266#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))), 46267#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))), 46268#(and (= 0 |main_#t~mem48.base|) (= 0 |main_#t~mem48.offset|)), 46269#(not |main_#t~short49|)] [2018-02-04 02:21:58,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:58,152 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 02:21:58,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 02:21:58,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:21:58,153 INFO L87 Difference]: Start difference. First operand 455 states and 626 transitions. Second operand 14 states. [2018-02-04 02:21:58,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:21:58,754 INFO L93 Difference]: Finished difference Result 562 states and 744 transitions. [2018-02-04 02:21:58,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 02:21:58,755 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2018-02-04 02:21:58,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:21:58,756 INFO L225 Difference]: With dead ends: 562 [2018-02-04 02:21:58,756 INFO L226 Difference]: Without dead ends: 562 [2018-02-04 02:21:58,756 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=477, Unknown=0, NotChecked=0, Total=650 [2018-02-04 02:21:58,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2018-02-04 02:21:58,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 413. [2018-02-04 02:21:58,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-02-04 02:21:58,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 554 transitions. [2018-02-04 02:21:58,759 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 554 transitions. Word has length 48 [2018-02-04 02:21:58,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:21:58,759 INFO L432 AbstractCegarLoop]: Abstraction has 413 states and 554 transitions. [2018-02-04 02:21:58,759 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 02:21:58,759 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 554 transitions. [2018-02-04 02:21:58,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 02:21:58,760 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:21:58,760 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:21:58,760 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:21:58,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1807586396, now seen corresponding path program 1 times [2018-02-04 02:21:58,760 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:21:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:21:58,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:21:59,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:59,149 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:21:59,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-04 02:21:59,150 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:21:59,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:59,150 INFO L182 omatonBuilderFactory]: Interpolants [47269#true, 47270#false, 47271#(= 0 |main_#t~malloc0.offset|), 47272#(= 0 main_~tree~0.offset), 47273#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 47274#(and (= 1 (select |#valid| |main_#t~malloc3.base|)) (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 main_~tree~0.offset)), 47275#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 47276#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 47277#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 47278#(and (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))) 1) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 47279#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tmp~0.base |main_#t~malloc25.base|)) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= main_~tree~0.base main_~tmp~0.base)), 47280#(and (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base)), 47281#(and (not (= main_~newNode~0.base main_~tree~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 47282#(and (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~malloc35.base| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 47283#(and (or (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 47284#(and (or (and (= (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem37.base| (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (not (= |main_#t~mem37.base| main_~tree~0.base))), 47285#(or (= |main_#t~mem37.base| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))))), 47286#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 47287#(= 1 (select |#valid| |main_#t~mem42.base|))] [2018-02-04 02:21:59,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:21:59,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 02:21:59,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 02:21:59,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-02-04 02:21:59,151 INFO L87 Difference]: Start difference. First operand 413 states and 554 transitions. Second operand 19 states. [2018-02-04 02:22:00,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:00,434 INFO L93 Difference]: Finished difference Result 844 states and 1081 transitions. [2018-02-04 02:22:00,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 02:22:00,434 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-02-04 02:22:00,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:00,436 INFO L225 Difference]: With dead ends: 844 [2018-02-04 02:22:00,436 INFO L226 Difference]: Without dead ends: 844 [2018-02-04 02:22:00,436 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=363, Invalid=969, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 02:22:00,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2018-02-04 02:22:00,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 472. [2018-02-04 02:22:00,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-02-04 02:22:00,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 638 transitions. [2018-02-04 02:22:00,440 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 638 transitions. Word has length 49 [2018-02-04 02:22:00,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:00,440 INFO L432 AbstractCegarLoop]: Abstraction has 472 states and 638 transitions. [2018-02-04 02:22:00,440 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 02:22:00,440 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 638 transitions. [2018-02-04 02:22:00,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 02:22:00,440 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:00,440 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:00,441 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:00,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1807586397, now seen corresponding path program 1 times [2018-02-04 02:22:00,441 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:00,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:00,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-04 02:22:00,879 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:22:00,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-04 02:22:00,879 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:00,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-04 02:22:00,879 INFO L182 omatonBuilderFactory]: Interpolants [48640#true, 48641#false, 48642#(= 0 |main_#t~malloc0.offset|), 48643#(= 0 main_~tree~0.offset), 48644#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 48645#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= (select |#valid| |main_#t~malloc3.base|) 1) (= 0 |main_#t~malloc3.offset|) (= 0 main_~tree~0.offset) (= 4 (select |#length| |main_#t~malloc3.base|))), 48646#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 48647#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 48648#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 48649#(and (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| main_~tree~0.base) 1) (= main_~tree~0.base main_~tmp~0.base) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))))), 48650#(and (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~malloc25.base|)) (= main_~tree~0.base main_~tmp~0.base) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))))), 48651#(and (= 4 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.base) (+ main_~tree~0.offset 8)))) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.offset) (+ main_~tree~0.offset 8))) (= (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.base) (+ main_~tree~0.offset 8))) 1) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base)), 48652#(and (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8))) 1) (not (= main_~newNode~0.base main_~tree~0.base)) (= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)))), 48653#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 48654#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 48655#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= |main_#t~mem37.base| main_~tree~0.base))), 48656#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))))), 48657#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 48658#(and (= (select |#length| |main_#t~mem42.base|) 4) (= |main_#t~mem42.offset| 0))] [2018-02-04 02:22:00,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-04 02:22:00,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 02:22:00,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 02:22:00,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-02-04 02:22:00,880 INFO L87 Difference]: Start difference. First operand 472 states and 638 transitions. Second operand 19 states. [2018-02-04 02:22:01,596 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 103 DAG size of output 64 [2018-02-04 02:22:02,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:02,782 INFO L93 Difference]: Finished difference Result 841 states and 1078 transitions. [2018-02-04 02:22:02,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 02:22:02,782 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-02-04 02:22:02,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:02,783 INFO L225 Difference]: With dead ends: 841 [2018-02-04 02:22:02,783 INFO L226 Difference]: Without dead ends: 841 [2018-02-04 02:22:02,783 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=298, Invalid=824, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 02:22:02,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2018-02-04 02:22:02,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 472. [2018-02-04 02:22:02,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-02-04 02:22:02,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 637 transitions. [2018-02-04 02:22:02,787 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 637 transitions. Word has length 49 [2018-02-04 02:22:02,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:02,787 INFO L432 AbstractCegarLoop]: Abstraction has 472 states and 637 transitions. [2018-02-04 02:22:02,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 02:22:02,787 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 637 transitions. [2018-02-04 02:22:02,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 02:22:02,787 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:02,787 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] [2018-02-04 02:22:02,788 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:02,788 INFO L82 PathProgramCache]: Analyzing trace with hash 26954866, now seen corresponding path program 1 times [2018-02-04 02:22:02,788 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:02,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:02,873 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:02,873 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:22:02,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 02:22:02,874 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:02,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:02,874 INFO L182 omatonBuilderFactory]: Interpolants [50002#true, 50003#false, 50004#(= 0 |main_#t~malloc0.offset|), 50005#(= 0 main_~tree~0.offset), 50006#(and (= main_~tmp~0.offset 0) (= 0 main_~tree~0.offset) (= main_~tmp~0.base main_~tree~0.base)), 50007#(and (<= 4 (select |#length| main_~tree~0.base)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 50008#(and (<= 4 (select |#length| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 50009#(and (= main_~tmp~0.offset 0) (<= 4 (select |#length| main_~tmp~0.base)))] [2018-02-04 02:22:02,874 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:02,875 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:22:02,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:22:02,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:22:02,875 INFO L87 Difference]: Start difference. First operand 472 states and 637 transitions. Second operand 8 states. [2018-02-04 02:22:03,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:03,183 INFO L93 Difference]: Finished difference Result 668 states and 842 transitions. [2018-02-04 02:22:03,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:22:03,183 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-02-04 02:22:03,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:03,184 INFO L225 Difference]: With dead ends: 668 [2018-02-04 02:22:03,184 INFO L226 Difference]: Without dead ends: 668 [2018-02-04 02:22:03,184 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:22:03,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-02-04 02:22:03,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 505. [2018-02-04 02:22:03,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-02-04 02:22:03,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 687 transitions. [2018-02-04 02:22:03,188 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 687 transitions. Word has length 50 [2018-02-04 02:22:03,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:03,188 INFO L432 AbstractCegarLoop]: Abstraction has 505 states and 687 transitions. [2018-02-04 02:22:03,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:22:03,188 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 687 transitions. [2018-02-04 02:22:03,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 02:22:03,189 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:03,189 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:03,189 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:03,189 INFO L82 PathProgramCache]: Analyzing trace with hash 200603590, now seen corresponding path program 1 times [2018-02-04 02:22:03,190 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:03,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:03,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:03,211 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:22:03,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:22:03,212 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:03,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:03,212 INFO L182 omatonBuilderFactory]: Interpolants [51195#true, 51196#false, 51197#(= 1 (select |#valid| |main_#t~malloc41.base|)), 51198#(= 1 (select |#valid| main_~tmpList~0.base))] [2018-02-04 02:22:03,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:03,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:22:03,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:22:03,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:22:03,213 INFO L87 Difference]: Start difference. First operand 505 states and 687 transitions. Second operand 4 states. [2018-02-04 02:22:03,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:03,356 INFO L93 Difference]: Finished difference Result 900 states and 1217 transitions. [2018-02-04 02:22:03,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:22:03,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-02-04 02:22:03,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:03,357 INFO L225 Difference]: With dead ends: 900 [2018-02-04 02:22:03,357 INFO L226 Difference]: Without dead ends: 900 [2018-02-04 02:22:03,357 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:22:03,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2018-02-04 02:22:03,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 504. [2018-02-04 02:22:03,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-02-04 02:22:03,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 686 transitions. [2018-02-04 02:22:03,361 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 686 transitions. Word has length 50 [2018-02-04 02:22:03,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:03,361 INFO L432 AbstractCegarLoop]: Abstraction has 504 states and 686 transitions. [2018-02-04 02:22:03,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:22:03,361 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 686 transitions. [2018-02-04 02:22:03,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 02:22:03,361 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:03,361 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:03,361 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:03,362 INFO L82 PathProgramCache]: Analyzing trace with hash 200603591, now seen corresponding path program 1 times [2018-02-04 02:22:03,362 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:03,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:03,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:03,407 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:22:03,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:22:03,408 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:03,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:03,408 INFO L182 omatonBuilderFactory]: Interpolants [52608#(and (= 0 |main_#t~malloc41.offset|) (= 4 (select |#length| |main_#t~malloc41.base|))), 52609#(and (= (select |#length| main_~tmpList~0.base) 4) (= main_~tmpList~0.offset 0)), 52606#true, 52607#false] [2018-02-04 02:22:03,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:03,408 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:22:03,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:22:03,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:22:03,409 INFO L87 Difference]: Start difference. First operand 504 states and 686 transitions. Second operand 4 states. [2018-02-04 02:22:03,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:03,615 INFO L93 Difference]: Finished difference Result 690 states and 892 transitions. [2018-02-04 02:22:03,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 02:22:03,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-02-04 02:22:03,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:03,618 INFO L225 Difference]: With dead ends: 690 [2018-02-04 02:22:03,618 INFO L226 Difference]: Without dead ends: 690 [2018-02-04 02:22:03,618 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:22:03,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-02-04 02:22:03,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 503. [2018-02-04 02:22:03,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-02-04 02:22:03,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 685 transitions. [2018-02-04 02:22:03,624 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 685 transitions. Word has length 50 [2018-02-04 02:22:03,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:03,624 INFO L432 AbstractCegarLoop]: Abstraction has 503 states and 685 transitions. [2018-02-04 02:22:03,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:22:03,625 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 685 transitions. [2018-02-04 02:22:03,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 02:22:03,625 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:03,625 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:03,625 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:03,626 INFO L82 PathProgramCache]: Analyzing trace with hash -391604284, now seen corresponding path program 1 times [2018-02-04 02:22:03,626 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:03,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:03,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:03,773 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:22:03,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 02:22:03,773 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:03,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:03,773 INFO L182 omatonBuilderFactory]: Interpolants [53808#(= 1 (select |#valid| main_~tree~0.base)), 53809#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 53810#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 53811#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= (select |#valid| main_~tree~0.base) 1)), 53812#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 53813#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 53814#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem13.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) |main_#t~mem13.offset| main_~tmpList~0.offset)) main_~tree~0.base) (+ main_~tree~0.offset 8)))), 53815#(= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))), 53816#(= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))), 53817#(= |main_#t~mem64.offset| 0), 53806#true, 53807#false] [2018-02-04 02:22:03,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:03,774 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 02:22:03,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 02:22:03,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-02-04 02:22:03,774 INFO L87 Difference]: Start difference. First operand 503 states and 685 transitions. Second operand 12 states. [2018-02-04 02:22:04,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:04,342 INFO L93 Difference]: Finished difference Result 676 states and 884 transitions. [2018-02-04 02:22:04,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 02:22:04,342 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2018-02-04 02:22:04,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:04,343 INFO L225 Difference]: With dead ends: 676 [2018-02-04 02:22:04,343 INFO L226 Difference]: Without dead ends: 676 [2018-02-04 02:22:04,343 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2018-02-04 02:22:04,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-02-04 02:22:04,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 506. [2018-02-04 02:22:04,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-02-04 02:22:04,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 689 transitions. [2018-02-04 02:22:04,347 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 689 transitions. Word has length 50 [2018-02-04 02:22:04,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:04,347 INFO L432 AbstractCegarLoop]: Abstraction has 506 states and 689 transitions. [2018-02-04 02:22:04,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 02:22:04,347 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 689 transitions. [2018-02-04 02:22:04,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 02:22:04,347 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:04,347 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:04,348 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:04,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1713231064, now seen corresponding path program 1 times [2018-02-04 02:22:04,348 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:04,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:04,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:04,758 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:22:04,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-04 02:22:04,758 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:04,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:04,758 INFO L182 omatonBuilderFactory]: Interpolants [55040#(= 1 (select |#valid| |main_#t~mem42.base|)), 55022#true, 55023#false, 55024#(= 0 |main_#t~malloc0.offset|), 55025#(= 0 main_~tree~0.offset), 55026#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 55027#(and (= 1 (select |#valid| |main_#t~malloc3.base|)) (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 main_~tree~0.offset)), 55028#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 55029#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 55030#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 55031#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))) 1) (= (select |#valid| main_~tree~0.base) 1) (= main_~tree~0.base main_~tmp~0.base)), 55032#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (not (= main_~tree~0.base |main_#t~malloc30.base|)) (= main_~tree~0.base main_~tmp~0.base)), 55033#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4) main_~newNode~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base)), 55034#(and (not (= main_~newNode~0.base main_~tree~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 55035#(and (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~malloc35.base| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 55036#(and (or (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 55037#(and (or (and (= (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem37.base| (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (not (= |main_#t~mem37.base| main_~tree~0.base))), 55038#(or (= |main_#t~mem37.base| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))))), 55039#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))] [2018-02-04 02:22:04,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:04,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 02:22:04,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 02:22:04,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-02-04 02:22:04,759 INFO L87 Difference]: Start difference. First operand 506 states and 689 transitions. Second operand 19 states. [2018-02-04 02:22:06,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:06,131 INFO L93 Difference]: Finished difference Result 921 states and 1198 transitions. [2018-02-04 02:22:06,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 02:22:06,131 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2018-02-04 02:22:06,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:06,132 INFO L225 Difference]: With dead ends: 921 [2018-02-04 02:22:06,132 INFO L226 Difference]: Without dead ends: 921 [2018-02-04 02:22:06,132 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=363, Invalid=969, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 02:22:06,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2018-02-04 02:22:06,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 571. [2018-02-04 02:22:06,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2018-02-04 02:22:06,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 781 transitions. [2018-02-04 02:22:06,138 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 781 transitions. Word has length 53 [2018-02-04 02:22:06,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:06,138 INFO L432 AbstractCegarLoop]: Abstraction has 571 states and 781 transitions. [2018-02-04 02:22:06,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 02:22:06,138 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 781 transitions. [2018-02-04 02:22:06,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 02:22:06,138 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:06,138 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:06,138 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:06,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1713231065, now seen corresponding path program 1 times [2018-02-04 02:22:06,139 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:06,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:06,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:06,575 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:22:06,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-04 02:22:06,575 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:06,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:06,576 INFO L182 omatonBuilderFactory]: Interpolants [56576#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 56577#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 56578#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| main_~tree~0.base) 1) (= main_~tree~0.base main_~tmp~0.base) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))))), 56579#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~malloc30.base|)) (= main_~tmp~0.base main_~tree~0.base) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))))), 56580#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 4 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4) main_~newNode~0.base) (+ main_~tree~0.offset 8)))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4) main_~newNode~0.offset) (+ main_~tree~0.offset 8))) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base)), 56581#(and (not (= main_~newNode~0.base main_~tree~0.base)) (= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)))), 56582#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 56583#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 56584#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= |main_#t~mem37.base| main_~tree~0.base))), 56585#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))))), 56586#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 56587#(and (= (select |#length| |main_#t~mem42.base|) 4) (= |main_#t~mem42.offset| 0)), 56569#true, 56570#false, 56571#(= 0 |main_#t~malloc0.offset|), 56572#(= 0 main_~tree~0.offset), 56573#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 56574#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|) (= 0 main_~tree~0.offset) (= 4 (select |#length| |main_#t~malloc3.base|))), 56575#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1))] [2018-02-04 02:22:06,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:06,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 02:22:06,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 02:22:06,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-02-04 02:22:06,576 INFO L87 Difference]: Start difference. First operand 571 states and 781 transitions. Second operand 19 states. [2018-02-04 02:22:08,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:08,138 INFO L93 Difference]: Finished difference Result 920 states and 1197 transitions. [2018-02-04 02:22:08,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 02:22:08,138 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2018-02-04 02:22:08,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:08,139 INFO L225 Difference]: With dead ends: 920 [2018-02-04 02:22:08,139 INFO L226 Difference]: Without dead ends: 920 [2018-02-04 02:22:08,139 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=332, Invalid=1074, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 02:22:08,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2018-02-04 02:22:08,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 567. [2018-02-04 02:22:08,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-02-04 02:22:08,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 776 transitions. [2018-02-04 02:22:08,144 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 776 transitions. Word has length 53 [2018-02-04 02:22:08,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:08,144 INFO L432 AbstractCegarLoop]: Abstraction has 567 states and 776 transitions. [2018-02-04 02:22:08,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 02:22:08,144 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 776 transitions. [2018-02-04 02:22:08,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 02:22:08,144 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:08,145 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:08,145 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:08,145 INFO L82 PathProgramCache]: Analyzing trace with hash -146453375, now seen corresponding path program 1 times [2018-02-04 02:22:08,145 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:08,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:08,215 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-04 02:22:08,215 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:22:08,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:22:08,215 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:08,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:08,216 INFO L182 omatonBuilderFactory]: Interpolants [58113#true, 58114#false, 58115#(= 0 |main_#t~malloc0.offset|), 58116#(= 0 main_~tree~0.offset), 58117#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (<= (+ main_~tree~0.offset 12) (select |#length| main_~tree~0.base))), 58118#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= main_~tmp~0.base main_~tree~0.base) (<= (+ main_~tree~0.offset 12) (select |#length| main_~tree~0.base))), 58119#(and (<= (+ main_~tree~0.offset 12) (select |#length| main_~tmp~0.base)) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~malloc25.base|)) (= main_~tmp~0.base main_~tree~0.base)), 58120#(and (<= (+ main_~tree~0.offset 12) (select |#length| main_~tmp~0.base)) (= 0 main_~tree~0.offset) (= main_~tmp~0.base main_~tree~0.base)), 58121#(and (= 0 main_~tree~0.offset) (<= (+ main_~tree~0.offset 12) (select |#length| main_~tree~0.base))), 58122#(and (<= 12 (select |#length| main_~tmp~0.base)) (= main_~tmp~0.offset 0))] [2018-02-04 02:22:08,216 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-04 02:22:08,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 02:22:08,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 02:22:08,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:22:08,216 INFO L87 Difference]: Start difference. First operand 567 states and 776 transitions. Second operand 10 states. [2018-02-04 02:22:08,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:08,583 INFO L93 Difference]: Finished difference Result 864 states and 1085 transitions. [2018-02-04 02:22:08,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 02:22:08,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-02-04 02:22:08,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:08,584 INFO L225 Difference]: With dead ends: 864 [2018-02-04 02:22:08,584 INFO L226 Difference]: Without dead ends: 864 [2018-02-04 02:22:08,584 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:22:08,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2018-02-04 02:22:08,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 440. [2018-02-04 02:22:08,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-02-04 02:22:08,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 560 transitions. [2018-02-04 02:22:08,588 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 560 transitions. Word has length 53 [2018-02-04 02:22:08,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:08,588 INFO L432 AbstractCegarLoop]: Abstraction has 440 states and 560 transitions. [2018-02-04 02:22:08,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 02:22:08,589 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 560 transitions. [2018-02-04 02:22:08,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 02:22:08,589 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:08,589 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:08,589 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:08,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1882204834, now seen corresponding path program 1 times [2018-02-04 02:22:08,589 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:08,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:08,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:08,735 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:22:08,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 02:22:08,736 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:08,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-04 02:22:08,736 INFO L182 omatonBuilderFactory]: Interpolants [59441#true, 59442#false, 59443#(= 0 |main_#t~malloc0.offset|), 59444#(= main_~tree~0.offset 0), 59445#(and (= main_~tree~0.offset 0) (or (= 4 (select |#length| |main_#t~malloc41.base|)) (= (select |#length| main_~tree~0.base) 4))), 59446#(and (= main_~tree~0.offset 0) (or (not (= main_~tree~0.base main_~tmpList~0.base)) (= (select |#length| main_~tree~0.base) 4))), 59447#(and (= main_~tree~0.offset 0) (= |main_#t~mem42.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= (select |#length| main_~tree~0.base) 4)) (not (= main_~tree~0.base main_~tmpList~0.base))), 59448#(and (= main_~tree~0.offset 0) (not (= (select |#length| main_~tree~0.base) 4)) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 59449#(and (= main_~tree~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 59450#(= 1 (select |#valid| |main_#t~mem45.base|))] [2018-02-04 02:22:08,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-04 02:22:08,736 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 02:22:08,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 02:22:08,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:22:08,737 INFO L87 Difference]: Start difference. First operand 440 states and 560 transitions. Second operand 10 states. [2018-02-04 02:22:09,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:09,183 INFO L93 Difference]: Finished difference Result 666 states and 827 transitions. [2018-02-04 02:22:09,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 02:22:09,183 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-02-04 02:22:09,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:09,184 INFO L225 Difference]: With dead ends: 666 [2018-02-04 02:22:09,184 INFO L226 Difference]: Without dead ends: 666 [2018-02-04 02:22:09,184 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:22:09,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-02-04 02:22:09,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 439. [2018-02-04 02:22:09,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-02-04 02:22:09,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 559 transitions. [2018-02-04 02:22:09,189 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 559 transitions. Word has length 53 [2018-02-04 02:22:09,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:09,190 INFO L432 AbstractCegarLoop]: Abstraction has 439 states and 559 transitions. [2018-02-04 02:22:09,190 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 02:22:09,190 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 559 transitions. [2018-02-04 02:22:09,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 02:22:09,190 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:09,191 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:09,191 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:09,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1882204835, now seen corresponding path program 1 times [2018-02-04 02:22:09,191 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:09,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:09,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:09,353 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:22:09,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 02:22:09,353 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:09,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:09,354 INFO L182 omatonBuilderFactory]: Interpolants [60576#(and (or (= 4 (select |#length| |main_#t~malloc41.base|)) (= (select |#length| main_~tree~0.base) 4)) (or (= main_~tree~0.offset 0) (not (= (select |#length| main_~tree~0.base) 4)))), 60577#(or (and (= main_~tree~0.offset 0) (= (select |#length| main_~tree~0.base) 4)) (not (= main_~tree~0.base main_~tmpList~0.base))), 60578#(and (= |main_#t~mem42.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem42.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base))), 60579#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base))), 60580#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 60581#(and (<= 0 |main_#t~mem45.offset|) (<= (+ |main_#t~mem45.offset| 4) (select |#length| |main_#t~mem45.base|))), 60572#true, 60573#false, 60574#(= 0 |main_#t~malloc0.offset|), 60575#(= main_~tree~0.offset 0)] [2018-02-04 02:22:09,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:09,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 02:22:09,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 02:22:09,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:22:09,354 INFO L87 Difference]: Start difference. First operand 439 states and 559 transitions. Second operand 10 states. [2018-02-04 02:22:09,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:09,820 INFO L93 Difference]: Finished difference Result 665 states and 826 transitions. [2018-02-04 02:22:09,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 02:22:09,820 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-02-04 02:22:09,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:09,822 INFO L225 Difference]: With dead ends: 665 [2018-02-04 02:22:09,822 INFO L226 Difference]: Without dead ends: 665 [2018-02-04 02:22:09,822 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:22:09,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-02-04 02:22:09,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 438. [2018-02-04 02:22:09,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-02-04 02:22:09,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 558 transitions. [2018-02-04 02:22:09,825 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 558 transitions. Word has length 53 [2018-02-04 02:22:09,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:09,825 INFO L432 AbstractCegarLoop]: Abstraction has 438 states and 558 transitions. [2018-02-04 02:22:09,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 02:22:09,825 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 558 transitions. [2018-02-04 02:22:09,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 02:22:09,826 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:09,826 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:09,826 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:09,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1116441486, now seen corresponding path program 1 times [2018-02-04 02:22:09,826 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:09,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:10,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:10,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:22:10,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 02:22:10,012 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:10,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:10,012 INFO L182 omatonBuilderFactory]: Interpolants [61701#true, 61702#false, 61703#(= 1 (select |#valid| main_~tree~0.base)), 61704#(not (= main_~tree~0.base |main_#t~malloc3.base|)), 61705#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 61706#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= (select |#valid| main_~tree~0.base) 1)), 61707#(and (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 61708#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 61709#(and (= 1 (select |#valid| main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 61710#(and (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| main_~tmpList~0.base)) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem13.base|))), 61711#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 61712#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 61713#(and (= |main_#t~mem59.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem59.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))), 61714#(= 1 (select |#valid| |main_#t~mem60.base|)), 61715#(= 1 (select |#valid| main_~tmpList~0.base))] [2018-02-04 02:22:10,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:10,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 02:22:10,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 02:22:10,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:22:10,013 INFO L87 Difference]: Start difference. First operand 438 states and 558 transitions. Second operand 15 states. [2018-02-04 02:22:10,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:10,728 INFO L93 Difference]: Finished difference Result 725 states and 869 transitions. [2018-02-04 02:22:10,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 02:22:10,728 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 53 [2018-02-04 02:22:10,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:10,729 INFO L225 Difference]: With dead ends: 725 [2018-02-04 02:22:10,729 INFO L226 Difference]: Without dead ends: 725 [2018-02-04 02:22:10,729 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=727, Unknown=0, NotChecked=0, Total=930 [2018-02-04 02:22:10,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-02-04 02:22:10,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 443. [2018-02-04 02:22:10,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-02-04 02:22:10,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 564 transitions. [2018-02-04 02:22:10,733 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 564 transitions. Word has length 53 [2018-02-04 02:22:10,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:10,733 INFO L432 AbstractCegarLoop]: Abstraction has 443 states and 564 transitions. [2018-02-04 02:22:10,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 02:22:10,733 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 564 transitions. [2018-02-04 02:22:10,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 02:22:10,734 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:10,734 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:10,734 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:10,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1116441485, now seen corresponding path program 1 times [2018-02-04 02:22:10,735 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:10,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:10,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:10,920 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:22:10,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 02:22:10,920 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:10,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:10,921 INFO L182 omatonBuilderFactory]: Interpolants [62916#true, 62917#false, 62918#(= 1 (select |#valid| main_~tree~0.base)), 62919#(not (= main_~tree~0.base |main_#t~malloc3.base|)), 62920#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 62921#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= (select |#valid| main_~tree~0.base) 1)), 62922#(and (= 0 |main_#t~malloc9.offset|) (= 4 (select |#length| |main_#t~malloc9.base|)) (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 62923#(and (= 0 main_~tmpList~0.offset) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 4 (select |#length| main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 62924#(and (= 0 main_~tmpList~0.offset) (= 4 (select |#length| main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 62925#(and (= 0 main_~tmpList~0.offset) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| main_~tmpList~0.base)) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem13.base|))), 62926#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))))), 62927#(and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 62928#(and (= |main_#t~mem59.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem59.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem59.base|) |main_#t~mem59.offset|))), 62929#(and (= 4 (select |#length| |main_#t~mem60.base|)) (= 0 |main_#t~mem60.offset|)), 62930#(and (= (select |#length| main_~tmpList~0.base) 4) (= main_~tmpList~0.offset 0))] [2018-02-04 02:22:10,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:10,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 02:22:10,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 02:22:10,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:22:10,921 INFO L87 Difference]: Start difference. First operand 443 states and 564 transitions. Second operand 15 states. [2018-02-04 02:22:11,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:11,539 INFO L93 Difference]: Finished difference Result 582 states and 694 transitions. [2018-02-04 02:22:11,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 02:22:11,539 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 53 [2018-02-04 02:22:11,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:11,540 INFO L225 Difference]: With dead ends: 582 [2018-02-04 02:22:11,540 INFO L226 Difference]: Without dead ends: 582 [2018-02-04 02:22:11,540 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2018-02-04 02:22:11,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-02-04 02:22:11,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 446. [2018-02-04 02:22:11,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-02-04 02:22:11,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 568 transitions. [2018-02-04 02:22:11,543 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 568 transitions. Word has length 53 [2018-02-04 02:22:11,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:11,543 INFO L432 AbstractCegarLoop]: Abstraction has 446 states and 568 transitions. [2018-02-04 02:22:11,543 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 02:22:11,543 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 568 transitions. [2018-02-04 02:22:11,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 02:22:11,543 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:11,543 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:11,543 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:11,544 INFO L82 PathProgramCache]: Analyzing trace with hash -249947414, now seen corresponding path program 1 times [2018-02-04 02:22:11,544 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:11,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:11,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:22:11,579 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:22:11,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:22:11,580 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:11,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:11,580 INFO L182 omatonBuilderFactory]: Interpolants [63984#false, 63985#(= |main_#t~mem56.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))), 63986#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 63987#(= 1 (select |#valid| |main_#t~mem61.base|)), 63983#true] [2018-02-04 02:22:11,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:22:11,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:22:11,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:22:11,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:22:11,580 INFO L87 Difference]: Start difference. First operand 446 states and 568 transitions. Second operand 5 states. [2018-02-04 02:22:11,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:11,709 INFO L93 Difference]: Finished difference Result 445 states and 564 transitions. [2018-02-04 02:22:11,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 02:22:11,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-02-04 02:22:11,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:11,710 INFO L225 Difference]: With dead ends: 445 [2018-02-04 02:22:11,710 INFO L226 Difference]: Without dead ends: 445 [2018-02-04 02:22:11,710 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:22:11,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-02-04 02:22:11,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2018-02-04 02:22:11,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-02-04 02:22:11,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 564 transitions. [2018-02-04 02:22:11,713 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 564 transitions. Word has length 54 [2018-02-04 02:22:11,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:11,713 INFO L432 AbstractCegarLoop]: Abstraction has 445 states and 564 transitions. [2018-02-04 02:22:11,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:22:11,713 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 564 transitions. [2018-02-04 02:22:11,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 02:22:11,713 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:11,713 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:11,713 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:11,714 INFO L82 PathProgramCache]: Analyzing trace with hash -249947413, now seen corresponding path program 1 times [2018-02-04 02:22:11,714 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:11,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:11,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:22:11,762 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:22:11,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:22:11,762 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:11,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:11,763 INFO L182 omatonBuilderFactory]: Interpolants [64882#true, 64883#false, 64884#(= |main_#t~mem56.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))), 64885#(and (<= |main_#t~mem59.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem59.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (<= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem59.offset|)), 64886#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 64887#(and (<= 0 |main_#t~mem61.offset|) (<= (+ |main_#t~mem61.offset| 4) (select |#length| |main_#t~mem61.base|)))] [2018-02-04 02:22:11,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:22:11,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:22:11,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:22:11,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:22:11,763 INFO L87 Difference]: Start difference. First operand 445 states and 564 transitions. Second operand 6 states. [2018-02-04 02:22:11,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:11,975 INFO L93 Difference]: Finished difference Result 444 states and 560 transitions. [2018-02-04 02:22:11,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 02:22:11,975 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-02-04 02:22:11,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:11,976 INFO L225 Difference]: With dead ends: 444 [2018-02-04 02:22:11,976 INFO L226 Difference]: Without dead ends: 444 [2018-02-04 02:22:11,976 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:22:11,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-02-04 02:22:11,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2018-02-04 02:22:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-02-04 02:22:11,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 560 transitions. [2018-02-04 02:22:11,980 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 560 transitions. Word has length 54 [2018-02-04 02:22:11,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:11,980 INFO L432 AbstractCegarLoop]: Abstraction has 444 states and 560 transitions. [2018-02-04 02:22:11,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:22:11,980 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 560 transitions. [2018-02-04 02:22:11,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 02:22:11,981 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:11,981 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:11,981 INFO L371 AbstractCegarLoop]: === Iteration 63 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:11,981 INFO L82 PathProgramCache]: Analyzing trace with hash 682972618, now seen corresponding path program 1 times [2018-02-04 02:22:11,982 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:11,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:12,206 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:12,206 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:22:12,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 02:22:12,207 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:12,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:12,207 INFO L182 omatonBuilderFactory]: Interpolants [65793#(and (= |main_#t~mem56.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem56.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 65792#(and (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 65795#(not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)), 65794#(and (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (or (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem58.base|)))), 65796#(not (= |main_#t~mem64.offset| 0)), 65781#false, 65780#true, 65783#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 65782#(= 1 (select |#valid| main_~tree~0.base)), 65785#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= (select |#valid| main_~tree~0.base) 1)), 65784#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 65787#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~malloc9.base|)) (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 65786#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 65789#(and (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base |main_#t~mem13.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tmpList~0.base))), 65788#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tmpList~0.base))), 65791#(not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))), 65790#(not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0)))] [2018-02-04 02:22:12,207 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:12,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 02:22:12,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 02:22:12,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:22:12,208 INFO L87 Difference]: Start difference. First operand 444 states and 560 transitions. Second operand 17 states. [2018-02-04 02:22:13,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:13,007 INFO L93 Difference]: Finished difference Result 548 states and 658 transitions. [2018-02-04 02:22:13,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 02:22:13,008 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-02-04 02:22:13,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:13,008 INFO L225 Difference]: With dead ends: 548 [2018-02-04 02:22:13,008 INFO L226 Difference]: Without dead ends: 546 [2018-02-04 02:22:13,008 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=870, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 02:22:13,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-02-04 02:22:13,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 442. [2018-02-04 02:22:13,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-02-04 02:22:13,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 557 transitions. [2018-02-04 02:22:13,011 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 557 transitions. Word has length 56 [2018-02-04 02:22:13,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:13,011 INFO L432 AbstractCegarLoop]: Abstraction has 442 states and 557 transitions. [2018-02-04 02:22:13,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 02:22:13,011 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 557 transitions. [2018-02-04 02:22:13,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 02:22:13,011 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:13,012 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:13,012 INFO L371 AbstractCegarLoop]: === Iteration 64 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:13,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1340433773, now seen corresponding path program 1 times [2018-02-04 02:22:13,012 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:13,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:13,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:13,487 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:22:13,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 02:22:13,488 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:13,488 INFO L182 omatonBuilderFactory]: Interpolants [66819#true, 66821#(= 0 |main_#t~malloc0.offset|), 66820#false, 66823#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 66822#(= 0 main_~tree~0.offset), 66825#(and (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 66824#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|) (= 0 main_~tree~0.offset)), 66827#(and (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 66826#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 66829#(and (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 66828#(and (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 66831#(and (= 1 (select |#valid| main_~tree~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0)))), 66830#(and (= 1 (select |#valid| main_~tree~0.base)) (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem13.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) |main_#t~mem13.offset| main_~tmpList~0.offset)) main_~tree~0.base) (+ main_~tree~0.offset 8)) 0)), 66833#(and (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= |main_#t~mem57.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= main_~tmp~0.offset 0) (= 1 (select |#valid| main_~tmp~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)), 66832#(and (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= main_~tmp~0.offset 0) (= 1 (select |#valid| main_~tmp~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)), 66835#(and (= main_~tmp~0.offset 0) (= 1 (select |#valid| main_~tmp~0.base)) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))), 66834#(and (= 0 |main_#t~mem56.offset|) (= main_~tmp~0.offset 0) (= 1 (select |#valid| main_~tmp~0.base)) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))), 66837#(and (or (and (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) (not (= (select (select |#memory_$Pointer$.offset| |main_#t~mem59.base|) |main_#t~mem59.offset|) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (<= 1 (select (select |#memory_$Pointer$.offset| |main_#t~mem59.base|) |main_#t~mem59.offset|)) (and (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) |main_#t~mem59.offset|))) (= |main_#t~mem59.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (= main_~tmp~0.offset 0) (= 1 (select |#valid| main_~tmp~0.base))), 66836#(and (or (and (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (<= 1 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))) (= main_~tmp~0.offset 0) (= 1 (select |#valid| main_~tmp~0.base))), 66839#(and (or (not (= 0 main_~tmpList~0.offset)) (= 1 (select (store |#valid| main_~tmpList~0.base 0) main_~tmp~0.base))) (= main_~tmp~0.offset 0)), 66838#(and (= main_~tmp~0.offset 0) (= 1 (select |#valid| main_~tmp~0.base)) (or (not (= main_~tmp~0.base |main_#t~mem60.base|)) (and (not (= |main_#t~mem60.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (<= 1 |main_#t~mem60.offset|))), 66841#(= (select |#valid| main_~tmp~0.base) 1), 66840#(or (not (= 0 main_~tmpList~0.offset)) (= 1 (select (store |#valid| main_~tmpList~0.base 0) main_~tmp~0.base)))] [2018-02-04 02:22:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:13,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 02:22:13,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 02:22:13,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-02-04 02:22:13,488 INFO L87 Difference]: Start difference. First operand 442 states and 557 transitions. Second operand 23 states. [2018-02-04 02:22:14,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:14,804 INFO L93 Difference]: Finished difference Result 579 states and 690 transitions. [2018-02-04 02:22:14,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 02:22:14,804 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 58 [2018-02-04 02:22:14,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:14,805 INFO L225 Difference]: With dead ends: 579 [2018-02-04 02:22:14,805 INFO L226 Difference]: Without dead ends: 579 [2018-02-04 02:22:14,805 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=472, Invalid=1978, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 02:22:14,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-02-04 02:22:14,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 442. [2018-02-04 02:22:14,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-02-04 02:22:14,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 557 transitions. [2018-02-04 02:22:14,808 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 557 transitions. Word has length 58 [2018-02-04 02:22:14,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:14,808 INFO L432 AbstractCegarLoop]: Abstraction has 442 states and 557 transitions. [2018-02-04 02:22:14,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 02:22:14,808 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 557 transitions. [2018-02-04 02:22:14,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 02:22:14,809 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:14,809 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 02:22:14,809 INFO L371 AbstractCegarLoop]: === Iteration 65 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:14,809 INFO L82 PathProgramCache]: Analyzing trace with hash -675463713, now seen corresponding path program 1 times [2018-02-04 02:22:14,810 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:14,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:14,954 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:14,955 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:22:14,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 02:22:14,955 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:14,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:14,955 INFO L182 omatonBuilderFactory]: Interpolants [67917#true, 67919#(= (select |#valid| main_~tree~0.base) 1), 67918#false, 67921#(and (not (= main_~tmp~0.base |main_#t~malloc25.base|)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 67920#(and (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 67923#(and (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset))), 67922#(and (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 67925#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= (select |#valid| main_~newNode~0.base) 1) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 67924#(and (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 67927#(= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset))), 67926#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 1 (select |#valid| main_~newNode~0.base)) (not (= |main_#t~mem37.base| main_~tree~0.base))), 67929#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))), 67928#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))), 67931#(= 1 (select |#valid| main_~tmp~0.base)), 67930#(= 1 (select |#valid| |main_#t~mem20.base|))] [2018-02-04 02:22:14,955 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:14,956 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 02:22:14,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 02:22:14,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:22:14,956 INFO L87 Difference]: Start difference. First operand 442 states and 557 transitions. Second operand 15 states. [2018-02-04 02:22:15,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:15,927 INFO L93 Difference]: Finished difference Result 1044 states and 1267 transitions. [2018-02-04 02:22:15,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 02:22:15,927 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2018-02-04 02:22:15,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:15,928 INFO L225 Difference]: With dead ends: 1044 [2018-02-04 02:22:15,928 INFO L226 Difference]: Without dead ends: 1044 [2018-02-04 02:22:15,928 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=865, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 02:22:15,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2018-02-04 02:22:15,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 504. [2018-02-04 02:22:15,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-02-04 02:22:15,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 644 transitions. [2018-02-04 02:22:15,932 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 644 transitions. Word has length 60 [2018-02-04 02:22:15,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:15,932 INFO L432 AbstractCegarLoop]: Abstraction has 504 states and 644 transitions. [2018-02-04 02:22:15,933 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 02:22:15,933 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 644 transitions. [2018-02-04 02:22:15,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 02:22:15,933 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:15,933 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 02:22:15,933 INFO L371 AbstractCegarLoop]: === Iteration 66 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:15,933 INFO L82 PathProgramCache]: Analyzing trace with hash -675463712, now seen corresponding path program 1 times [2018-02-04 02:22:15,934 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:15,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:16,107 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:16,107 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:22:16,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 02:22:16,107 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:16,108 INFO L182 omatonBuilderFactory]: Interpolants [69521#false, 69520#true, 69523#(and (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 69522#(= (select |#valid| main_~tree~0.base) 1), 69525#(and (= 0 main_~newNode~0.offset) (not (= main_~tmp~0.base main_~newNode~0.base)) (= 12 (select |#length| main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 69524#(and (= 0 |main_#t~malloc25.offset|) (not (= main_~tmp~0.base |main_#t~malloc25.base|)) (= 12 (select |#length| |main_#t~malloc25.base|)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 69527#(and (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~newNode~0.base) 1) (= 12 (select |#length| main_~newNode~0.base)) (= (select |#valid| main_~tree~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0)) main_~tree~0.base) main_~tree~0.offset))), 69526#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= 12 (select |#length| main_~newNode~0.base)) (= (select |#valid| main_~tree~0.base) 1) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset))), 69529#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 12 (select |#length| main_~newNode~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 69528#(and (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) main_~tree~0.offset)) (= 12 (select |#length| main_~newNode~0.base)) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 69531#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) main_~tree~0.offset))), 69530#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= |main_#t~mem37.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 12 (select |#length| main_~newNode~0.base))), 69533#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))), 69532#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 69535#(and (= (select |#length| main_~tmp~0.base) 12) (= main_~tmp~0.offset 0)), 69534#(and (= 0 |main_#t~mem20.offset|) (= 12 (select |#length| |main_#t~mem20.base|)))] [2018-02-04 02:22:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:16,108 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 02:22:16,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 02:22:16,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-02-04 02:22:16,108 INFO L87 Difference]: Start difference. First operand 504 states and 644 transitions. Second operand 16 states. [2018-02-04 02:22:17,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:17,454 INFO L93 Difference]: Finished difference Result 976 states and 1188 transitions. [2018-02-04 02:22:17,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 02:22:17,454 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2018-02-04 02:22:17,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:17,455 INFO L225 Difference]: With dead ends: 976 [2018-02-04 02:22:17,455 INFO L226 Difference]: Without dead ends: 976 [2018-02-04 02:22:17,455 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=252, Invalid=938, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 02:22:17,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2018-02-04 02:22:17,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 533. [2018-02-04 02:22:17,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-02-04 02:22:17,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 681 transitions. [2018-02-04 02:22:17,458 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 681 transitions. Word has length 60 [2018-02-04 02:22:17,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:17,459 INFO L432 AbstractCegarLoop]: Abstraction has 533 states and 681 transitions. [2018-02-04 02:22:17,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 02:22:17,459 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 681 transitions. [2018-02-04 02:22:17,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 02:22:17,459 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:17,459 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 02:22:17,459 INFO L371 AbstractCegarLoop]: === Iteration 67 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:17,459 INFO L82 PathProgramCache]: Analyzing trace with hash -669738075, now seen corresponding path program 1 times [2018-02-04 02:22:17,460 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:17,465 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:17,995 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:17,995 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:22:17,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 02:22:17,996 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:17,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:17,996 INFO L182 omatonBuilderFactory]: Interpolants [71105#(and (= 0 |main_#t~mem17.base|) (= |main_#t~mem17.offset| 0)), 71104#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))), 71106#(not |main_#t~short18|), 71083#true, 71085#(= 0 |main_#t~malloc0.offset|), 71084#false, 71087#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 71086#(= 0 main_~tree~0.offset), 71089#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.base|) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.offset|) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset)), 71088#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 71091#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 71090#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 71093#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tmp~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) |main_#t~mem16.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tmp~0.base main_~tree~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 71092#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tmp~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tmp~0.base main_~tree~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 71095#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) 0) (= main_~tmp~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tmp~0.base main_~tree~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 71094#(and (or |main_#t~short18| (and (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))))) (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tmp~0.offset 0) (= main_~tmp~0.base main_~tree~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 71097#(and (= main_~tree~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~tmp~0.base (store (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.offset)) main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tmp~0.offset 0) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= 0 (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.base) (+ main_~tree~0.offset 4)))), 71096#(and (= main_~tree~0.offset 0) (not (= main_~tmp~0.base |main_#t~malloc25.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= main_~tmp~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) |main_#t~malloc25.offset|) (= main_~tmp~0.base main_~tree~0.base)), 71099#(and (= main_~tree~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 71098#(and (= main_~tree~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~newNode~0.base main_~tree~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= (select |#valid| main_~tree~0.base) 1)), 71101#(and (= main_~tree~0.offset 0) (not (= |main_#t~mem37.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))), 71100#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 71103#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))), 71102#(and (= main_~tree~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 4))))] [2018-02-04 02:22:17,996 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:17,996 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 02:22:17,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 02:22:17,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2018-02-04 02:22:17,997 INFO L87 Difference]: Start difference. First operand 533 states and 681 transitions. Second operand 24 states. [2018-02-04 02:22:20,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:20,108 INFO L93 Difference]: Finished difference Result 1059 states and 1277 transitions. [2018-02-04 02:22:20,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 02:22:20,108 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 60 [2018-02-04 02:22:20,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:20,109 INFO L225 Difference]: With dead ends: 1059 [2018-02-04 02:22:20,109 INFO L226 Difference]: Without dead ends: 1059 [2018-02-04 02:22:20,109 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=948, Invalid=2834, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 02:22:20,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2018-02-04 02:22:20,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 584. [2018-02-04 02:22:20,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-02-04 02:22:20,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 745 transitions. [2018-02-04 02:22:20,114 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 745 transitions. Word has length 60 [2018-02-04 02:22:20,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:20,114 INFO L432 AbstractCegarLoop]: Abstraction has 584 states and 745 transitions. [2018-02-04 02:22:20,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 02:22:20,114 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 745 transitions. [2018-02-04 02:22:20,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 02:22:20,114 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:20,115 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] [2018-02-04 02:22:20,115 INFO L371 AbstractCegarLoop]: === Iteration 68 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:20,115 INFO L82 PathProgramCache]: Analyzing trace with hash -333324624, now seen corresponding path program 1 times [2018-02-04 02:22:20,115 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:20,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:20,555 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-04 02:22:20,555 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:22:20,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 02:22:20,556 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:20,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:20,556 INFO L182 omatonBuilderFactory]: Interpolants [72833#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 72832#(and (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 72835#(and (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 72834#(and (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 72837#(and (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (= 0 main_~tree~0.offset)), 72836#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem13.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) |main_#t~mem13.offset| main_~tmpList~0.offset)) main_~tree~0.base) (+ main_~tree~0.offset 8)) 0)), 72839#(and (= |main_#t~mem57.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= main_~tmp~0.offset 0) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)), 72838#(and (= main_~tmp~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)), 72841#(and (= |main_#t~mem57.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= main_~tmp~0.offset 0) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem58.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) (= |main_#t~mem58.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 72840#(and (= |main_#t~mem56.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem57.offset| |main_#t~mem56.offset|) (= main_~tmp~0.offset 0) (= |main_#t~mem56.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem57.base| |main_#t~mem56.base|) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)), 72843#(and (= |main_#t~mem59.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem59.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= main_~tmp~0.offset 0) (or (and (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) (not (= (select (select |#memory_$Pointer$.offset| |main_#t~mem59.base|) |main_#t~mem59.offset|) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem59.base|) |main_#t~mem59.offset|) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 72842#(and (= main_~tmp~0.offset 0) (or (and (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 72845#(and (or (not (= 0 main_~tmpList~0.offset)) (= 1 (select (store |#valid| main_~tmpList~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (= main_~tmpList~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmp~0.offset 0)), 72844#(and (or (and (not (= |main_#t~mem60.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (not (= |main_#t~mem60.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (= main_~tmp~0.offset 0) (= |main_#t~mem60.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= |main_#t~mem60.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 72847#(and (or (not (= 0 main_~tmpList~0.offset)) (= 1 (select (store |#valid| main_~tmpList~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (= main_~tmp~0.offset 0) (or (and (= |main_#t~mem63.base| (select (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset)) (= main_~tmpList~0.offset (+ main_~tmp~0.offset 8)) (= main_~tmpList~0.base main_~tmp~0.base)) (not (= main_~tmp~0.base |main_#t~mem61.base|)) (not (= (+ main_~tmp~0.offset 8) |main_#t~mem61.offset|))) (= |main_#t~mem61.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 72846#(and (or (not (= 0 main_~tmpList~0.offset)) (= 1 (select (store |#valid| main_~tmpList~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (or (not (= main_~tmp~0.base |main_#t~mem61.base|)) (and (= main_~tmpList~0.offset (+ main_~tmp~0.offset 8)) (= main_~tmpList~0.base main_~tmp~0.base)) (not (= (+ main_~tmp~0.offset 8) |main_#t~mem61.offset|))) (= main_~tmp~0.offset 0) (= |main_#t~mem61.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 72849#(and (= main_~tmp~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 72848#(and (or (not (= 0 main_~tmpList~0.offset)) (= 1 (select (store |#valid| main_~tmpList~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (= main_~tmp~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 72850#(= 1 (select |#valid| |main_#t~mem56.base|)), 72827#false, 72826#true, 72829#(= 0 main_~tree~0.offset), 72828#(= 0 |main_#t~malloc0.offset|), 72831#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= |main_#t~malloc3.offset| 0) (= 0 main_~tree~0.offset)), 72830#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset))] [2018-02-04 02:22:20,556 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-04 02:22:20,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 02:22:20,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 02:22:20,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2018-02-04 02:22:20,557 INFO L87 Difference]: Start difference. First operand 584 states and 745 transitions. Second operand 25 states. [2018-02-04 02:22:21,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:21,850 INFO L93 Difference]: Finished difference Result 717 states and 874 transitions. [2018-02-04 02:22:21,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 02:22:21,850 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 60 [2018-02-04 02:22:21,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:21,850 INFO L225 Difference]: With dead ends: 717 [2018-02-04 02:22:21,851 INFO L226 Difference]: Without dead ends: 717 [2018-02-04 02:22:21,851 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=397, Invalid=2359, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 02:22:21,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-02-04 02:22:21,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 588. [2018-02-04 02:22:21,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-02-04 02:22:21,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 750 transitions. [2018-02-04 02:22:21,854 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 750 transitions. Word has length 60 [2018-02-04 02:22:21,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:21,854 INFO L432 AbstractCegarLoop]: Abstraction has 588 states and 750 transitions. [2018-02-04 02:22:21,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 02:22:21,854 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 750 transitions. [2018-02-04 02:22:21,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 02:22:21,855 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:21,855 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] [2018-02-04 02:22:21,855 INFO L371 AbstractCegarLoop]: === Iteration 69 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:21,855 INFO L82 PathProgramCache]: Analyzing trace with hash -333324623, now seen corresponding path program 1 times [2018-02-04 02:22:21,855 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:21,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:22:22,253 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:22:22,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 02:22:22,253 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:22,253 INFO L182 omatonBuilderFactory]: Interpolants [74213#false, 74212#true, 74215#(= 0 main_~tree~0.offset), 74214#(= 0 |main_#t~malloc0.offset|), 74217#(and (= |main_#t~mem56.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= main_~tmp~0.offset 0) (= |main_#t~mem56.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 74216#(= main_~tmp~0.offset 0), 74219#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| |main_#t~mem59.base|)) (= |main_#t~mem59.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem59.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= main_~tmp~0.offset 0) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 74218#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmp~0.offset 0) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 74221#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmpList~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmp~0.offset 0) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 74220#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) |main_#t~mem60.offset|) (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmp~0.offset 0) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) |main_#t~mem60.base|)), 74223#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (or (not (= main_~tmp~0.base |main_#t~mem61.base|)) (and (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= main_~tmp~0.offset 0) (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (<= (+ main_~tmp~0.offset 8) main_~tmpList~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~tmpList~0.base) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) |main_#t~mem63.offset|) (= (+ main_~tmp~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= (+ main_~tmp~0.offset 8) |main_#t~mem61.offset|)))), 74222#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (or (not (= main_~tmp~0.base |main_#t~mem61.base|)) (and (or (= main_~tmp~0.offset 0) (not (= (+ main_~tmp~0.offset 8) |main_#t~mem61.offset|))) (or (and (= main_~tmpList~0.offset (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (+ main_~tmp~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= (+ main_~tmp~0.offset 8) |main_#t~mem61.offset|)))))), 74225#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 74224#(or (and (= main_~tmp~0.offset 0) (<= (+ main_~tmp~0.offset 8) main_~tmpList~0.offset)) (and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 74226#(and (<= 0 |main_#t~mem56.offset|) (<= (+ |main_#t~mem56.offset| 4) (select |#length| |main_#t~mem56.base|)))] [2018-02-04 02:22:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:22:22,254 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 02:22:22,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 02:22:22,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:22:22,254 INFO L87 Difference]: Start difference. First operand 588 states and 750 transitions. Second operand 15 states. [2018-02-04 02:22:22,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:22,825 INFO L93 Difference]: Finished difference Result 665 states and 826 transitions. [2018-02-04 02:22:22,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 02:22:22,825 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2018-02-04 02:22:22,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:22,826 INFO L225 Difference]: With dead ends: 665 [2018-02-04 02:22:22,826 INFO L226 Difference]: Without dead ends: 665 [2018-02-04 02:22:22,826 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=522, Unknown=0, NotChecked=0, Total=702 [2018-02-04 02:22:22,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-02-04 02:22:22,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 590. [2018-02-04 02:22:22,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-02-04 02:22:22,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 752 transitions. [2018-02-04 02:22:22,829 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 752 transitions. Word has length 60 [2018-02-04 02:22:22,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:22,829 INFO L432 AbstractCegarLoop]: Abstraction has 590 states and 752 transitions. [2018-02-04 02:22:22,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 02:22:22,830 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 752 transitions. [2018-02-04 02:22:22,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 02:22:22,830 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:22,830 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:22,830 INFO L371 AbstractCegarLoop]: === Iteration 70 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:22,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1271133541, now seen corresponding path program 1 times [2018-02-04 02:22:22,831 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:22,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:22,970 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:22,970 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:22:22,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 02:22:22,970 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:22,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:22,970 INFO L182 omatonBuilderFactory]: Interpolants [75520#(= 1 (select |#valid| main_~tmp~0.base)), 75507#false, 75506#true, 75509#(and (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 75508#(= (select |#valid| main_~tree~0.base) 1), 75511#(and (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 75510#(and (not (= main_~tmp~0.base |main_#t~malloc25.base|)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 75513#(and (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 75512#(and (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset))), 75515#(and (not (= |main_#t~mem37.base| main_~tree~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)))), 75514#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= (select |#valid| main_~newNode~0.base) 1) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 75517#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))), 75516#(= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset))), 75519#(= 1 (select |#valid| |main_#t~mem51.base|)), 75518#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))] [2018-02-04 02:22:22,971 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:22,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 02:22:22,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 02:22:22,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:22:22,971 INFO L87 Difference]: Start difference. First operand 590 states and 752 transitions. Second operand 15 states. [2018-02-04 02:22:24,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:24,074 INFO L93 Difference]: Finished difference Result 1177 states and 1434 transitions. [2018-02-04 02:22:24,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 02:22:24,075 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 61 [2018-02-04 02:22:24,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:24,076 INFO L225 Difference]: With dead ends: 1177 [2018-02-04 02:22:24,076 INFO L226 Difference]: Without dead ends: 1177 [2018-02-04 02:22:24,076 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=865, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 02:22:24,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2018-02-04 02:22:24,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 603. [2018-02-04 02:22:24,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-02-04 02:22:24,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 768 transitions. [2018-02-04 02:22:24,080 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 768 transitions. Word has length 61 [2018-02-04 02:22:24,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:24,080 INFO L432 AbstractCegarLoop]: Abstraction has 603 states and 768 transitions. [2018-02-04 02:22:24,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 02:22:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 768 transitions. [2018-02-04 02:22:24,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 02:22:24,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:24,081 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:24,081 INFO L371 AbstractCegarLoop]: === Iteration 71 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:24,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1271133542, now seen corresponding path program 1 times [2018-02-04 02:22:24,081 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:24,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:24,260 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:24,261 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:22:24,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 02:22:24,261 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:24,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-04 02:22:24,261 INFO L182 omatonBuilderFactory]: Interpolants [77345#(and (= 0 |main_#t~malloc25.offset|) (not (= main_~tmp~0.base |main_#t~malloc25.base|)) (= 12 (select |#length| |main_#t~malloc25.base|)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 77344#(and (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 77347#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= 12 (select |#length| main_~newNode~0.base)) (= (select |#valid| main_~tree~0.base) 1) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset))), 77346#(and (= 0 main_~newNode~0.offset) (not (= main_~tmp~0.base main_~newNode~0.base)) (= 12 (select |#length| main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 77349#(and (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) main_~tree~0.offset)) (= 12 (select |#length| main_~newNode~0.base)) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 77348#(and (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~newNode~0.base) 1) (= 12 (select |#length| main_~newNode~0.base)) (= (select |#valid| main_~tree~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0)) main_~tree~0.base) main_~tree~0.offset))), 77351#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= |main_#t~mem37.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 12 (select |#length| main_~newNode~0.base))), 77350#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 12 (select |#length| main_~newNode~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 77353#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 77352#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) main_~tree~0.offset))), 77355#(and (= 12 (select |#length| |main_#t~mem51.base|)) (= 0 |main_#t~mem51.offset|)), 77354#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))), 77356#(and (= 12 (select |#length| main_~tmp~0.base)) (= main_~tmp~0.offset 0)), 77341#true, 77343#(= (select |#valid| main_~tree~0.base) 1), 77342#false] [2018-02-04 02:22:24,262 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:24,262 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 02:22:24,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 02:22:24,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-02-04 02:22:24,262 INFO L87 Difference]: Start difference. First operand 603 states and 768 transitions. Second operand 16 states. [2018-02-04 02:22:25,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:25,682 INFO L93 Difference]: Finished difference Result 1154 states and 1400 transitions. [2018-02-04 02:22:25,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 02:22:25,682 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 61 [2018-02-04 02:22:25,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:25,683 INFO L225 Difference]: With dead ends: 1154 [2018-02-04 02:22:25,683 INFO L226 Difference]: Without dead ends: 1154 [2018-02-04 02:22:25,683 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=252, Invalid=938, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 02:22:25,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2018-02-04 02:22:25,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 647. [2018-02-04 02:22:25,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2018-02-04 02:22:25,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 837 transitions. [2018-02-04 02:22:25,687 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 837 transitions. Word has length 61 [2018-02-04 02:22:25,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:25,687 INFO L432 AbstractCegarLoop]: Abstraction has 647 states and 837 transitions. [2018-02-04 02:22:25,687 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 02:22:25,687 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 837 transitions. [2018-02-04 02:22:25,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 02:22:25,688 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:25,688 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:25,688 INFO L371 AbstractCegarLoop]: === Iteration 72 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:25,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1276859179, now seen corresponding path program 1 times [2018-02-04 02:22:25,688 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:25,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:25,723 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:22:25,723 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:22:25,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 02:22:25,724 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:25,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:25,724 INFO L182 omatonBuilderFactory]: Interpolants [79201#(or (not (= 0 |main_#t~mem50.offset|)) (not (= |main_#t~mem50.base| 0))), 79200#(or (not (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) 0))), 79197#false, 79196#true, 79199#(or (not (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset))) (not |main_#t~short49|) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) 0))), 79198#(and (= |main_#t~mem47.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= |main_#t~mem47.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))] [2018-02-04 02:22:25,724 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:22:25,724 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:22:25,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:22:25,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:22:25,724 INFO L87 Difference]: Start difference. First operand 647 states and 837 transitions. Second operand 6 states. [2018-02-04 02:22:25,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:25,850 INFO L93 Difference]: Finished difference Result 648 states and 834 transitions. [2018-02-04 02:22:25,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 02:22:25,851 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-02-04 02:22:25,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:25,851 INFO L225 Difference]: With dead ends: 648 [2018-02-04 02:22:25,851 INFO L226 Difference]: Without dead ends: 648 [2018-02-04 02:22:25,851 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:22:25,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2018-02-04 02:22:25,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 647. [2018-02-04 02:22:25,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2018-02-04 02:22:25,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 834 transitions. [2018-02-04 02:22:25,854 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 834 transitions. Word has length 61 [2018-02-04 02:22:25,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:25,855 INFO L432 AbstractCegarLoop]: Abstraction has 647 states and 834 transitions. [2018-02-04 02:22:25,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:22:25,855 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 834 transitions. [2018-02-04 02:22:25,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 02:22:25,855 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:25,855 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:25,855 INFO L371 AbstractCegarLoop]: === Iteration 73 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:25,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1234041873, now seen corresponding path program 1 times [2018-02-04 02:22:25,856 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:25,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:25,920 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:25,920 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:22:25,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:22:25,920 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:25,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:25,921 INFO L182 omatonBuilderFactory]: Interpolants [80503#true, 80505#(= 1 (select |#valid| main_~tmpList~0.base)), 80504#false, 80507#(or (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 80506#(and (= |main_#t~mem45.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (or (= 1 (select |#valid| main_~tmpList~0.base)) (not (= main_~tree~0.base |main_#t~mem45.base|)) (not (= (+ main_~tree~0.offset 8) |main_#t~mem45.offset|)))), 80508#(= 1 (select |#valid| |main_#t~mem42.base|))] [2018-02-04 02:22:25,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:25,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:22:25,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:22:25,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:22:25,921 INFO L87 Difference]: Start difference. First operand 647 states and 834 transitions. Second operand 6 states. [2018-02-04 02:22:26,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:26,146 INFO L93 Difference]: Finished difference Result 1058 states and 1351 transitions. [2018-02-04 02:22:26,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:22:26,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-02-04 02:22:26,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:26,147 INFO L225 Difference]: With dead ends: 1058 [2018-02-04 02:22:26,147 INFO L226 Difference]: Without dead ends: 1058 [2018-02-04 02:22:26,147 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:22:26,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2018-02-04 02:22:26,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 654. [2018-02-04 02:22:26,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-02-04 02:22:26,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 843 transitions. [2018-02-04 02:22:26,151 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 843 transitions. Word has length 61 [2018-02-04 02:22:26,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:26,152 INFO L432 AbstractCegarLoop]: Abstraction has 654 states and 843 transitions. [2018-02-04 02:22:26,152 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:22:26,152 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 843 transitions. [2018-02-04 02:22:26,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 02:22:26,152 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:26,152 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:26,152 INFO L371 AbstractCegarLoop]: === Iteration 74 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:26,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1234041874, now seen corresponding path program 1 times [2018-02-04 02:22:26,153 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:26,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:26,870 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:26,870 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:22:26,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 02:22:26,870 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:26,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:26,870 INFO L182 omatonBuilderFactory]: Interpolants [82241#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (= main_~tmp~0.offset (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~malloc25.base|)) (= main_~tree~0.base main_~tmp~0.base)), 82240#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (= main_~tmp~0.offset (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| main_~tree~0.base) 1) (= main_~tree~0.base main_~tmp~0.base)), 82243#(and (= main_~tree~0.offset 0) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)))), 82242#(and (= main_~tree~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.offset) (+ main_~tree~0.offset 8))) (= main_~tmp~0.offset (select (store (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.offset) (+ main_~tree~0.offset 8))) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base)), 82245#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 82244#(and (= main_~tree~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 82247#(and (= main_~tree~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))), 82246#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= |main_#t~mem37.base| main_~tree~0.base))), 82249#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.offset 0) (or (= 4 (select |#length| |main_#t~malloc41.base|)) (= (select |#length| main_~tree~0.base) 4))), 82248#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.offset 0)), 82251#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.offset 0) (= |main_#t~mem42.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base))), 82250#(and (= main_~tree~0.offset 0) (or (not (= main_~tree~0.base main_~tmpList~0.base)) (= (select |#length| main_~tree~0.base) 4)) (or (= main_~tree~0.base main_~tmpList~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 82253#(and (= main_~tree~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= (+ main_~tree~0.offset 8) |main_#t~mem45.offset|))) (not (= main_~tree~0.base |main_#t~mem45.base|))) (not (= main_~tree~0.base main_~tmpList~0.base)) (or (and (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem45.base| (store (select |#memory_$Pointer$.base| |main_#t~mem45.base|) |main_#t~mem45.offset| main_~tmpList~0.base)) main_~tree~0.base) (+ main_~tree~0.offset 8))) 1) (= |main_#t~mem45.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem45.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem45.base|) |main_#t~mem45.offset| main_~tmpList~0.offset)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem45.base| (store (select |#memory_$Pointer$.base| |main_#t~mem45.base|) |main_#t~mem45.offset| main_~tmpList~0.base)) main_~tree~0.base) (+ main_~tree~0.offset 8))))) (= main_~tree~0.base |main_#t~mem45.base|))), 82252#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.offset 0) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 82255#(and (= main_~tree~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))), 82254#(and (= main_~tree~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))), 82256#(and (= |main_#t~mem42.offset| 0) (<= 4 (select |#length| |main_#t~mem42.base|))), 82231#true, 82233#(= |main_#t~malloc0.offset| 0), 82232#false, 82235#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 82234#(= 0 main_~tree~0.offset), 82237#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 82236#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= main_~tree~0.offset |main_#t~malloc3.offset|) (= 0 main_~tree~0.offset)), 82239#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 82238#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1))] [2018-02-04 02:22:26,871 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:26,871 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 02:22:26,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 02:22:26,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2018-02-04 02:22:26,871 INFO L87 Difference]: Start difference. First operand 654 states and 843 transitions. Second operand 26 states. [2018-02-04 02:22:34,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:34,380 INFO L93 Difference]: Finished difference Result 4346 states and 5226 transitions. [2018-02-04 02:22:34,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-02-04 02:22:34,380 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 61 [2018-02-04 02:22:34,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:34,383 INFO L225 Difference]: With dead ends: 4346 [2018-02-04 02:22:34,383 INFO L226 Difference]: Without dead ends: 4346 [2018-02-04 02:22:34,385 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8196 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=4881, Invalid=17769, Unknown=0, NotChecked=0, Total=22650 [2018-02-04 02:22:34,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4346 states. [2018-02-04 02:22:34,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4346 to 853. [2018-02-04 02:22:34,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2018-02-04 02:22:34,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1122 transitions. [2018-02-04 02:22:34,398 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1122 transitions. Word has length 61 [2018-02-04 02:22:34,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:34,398 INFO L432 AbstractCegarLoop]: Abstraction has 853 states and 1122 transitions. [2018-02-04 02:22:34,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 02:22:34,398 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1122 transitions. [2018-02-04 02:22:34,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 02:22:34,398 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:34,398 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:34,398 INFO L371 AbstractCegarLoop]: === Iteration 75 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:34,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1869077753, now seen corresponding path program 1 times [2018-02-04 02:22:34,399 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:34,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:34,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:34,875 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:22:34,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 02:22:34,875 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:34,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-04 02:22:34,876 INFO L182 omatonBuilderFactory]: Interpolants [87713#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 87712#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 87715#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 87714#(and (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 87717#(and (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~tmpList~0.base (store (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem12.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~tmpList~0.base (store (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem12.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 87716#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~mem10.base|) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 87719#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 87718#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 87721#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tmp~0.base |main_#t~malloc25.base|)) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= main_~tree~0.base main_~tmp~0.base)), 87720#(and (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))) 1) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 87723#(and (not (= main_~newNode~0.base main_~tree~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 87722#(and (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base)), 87725#(and (or (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 87724#(and (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~malloc35.base| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 87727#(or (= |main_#t~mem37.base| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))))), 87726#(and (or (and (= (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem37.base| (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (not (= |main_#t~mem37.base| main_~tree~0.base))), 87729#(= 1 (select |#valid| |main_#t~mem42.base|)), 87728#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 87707#false, 87706#true, 87709#(= 0 main_~tree~0.offset), 87708#(= 0 |main_#t~malloc0.offset|), 87711#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 main_~tree~0.offset)), 87710#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset))] [2018-02-04 02:22:34,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:34,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 02:22:34,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 02:22:34,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2018-02-04 02:22:34,876 INFO L87 Difference]: Start difference. First operand 853 states and 1122 transitions. Second operand 24 states. [2018-02-04 02:22:37,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:37,039 INFO L93 Difference]: Finished difference Result 1685 states and 2112 transitions. [2018-02-04 02:22:37,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 02:22:37,039 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 61 [2018-02-04 02:22:37,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:37,040 INFO L225 Difference]: With dead ends: 1685 [2018-02-04 02:22:37,041 INFO L226 Difference]: Without dead ends: 1685 [2018-02-04 02:22:37,041 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=949, Invalid=2833, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 02:22:37,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2018-02-04 02:22:37,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 928. [2018-02-04 02:22:37,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2018-02-04 02:22:37,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1225 transitions. [2018-02-04 02:22:37,047 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1225 transitions. Word has length 61 [2018-02-04 02:22:37,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:37,047 INFO L432 AbstractCegarLoop]: Abstraction has 928 states and 1225 transitions. [2018-02-04 02:22:37,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 02:22:37,047 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1225 transitions. [2018-02-04 02:22:37,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 02:22:37,048 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:37,048 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:37,048 INFO L371 AbstractCegarLoop]: === Iteration 76 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:37,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1869077752, now seen corresponding path program 1 times [2018-02-04 02:22:37,048 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:37,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:37,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:37,751 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:22:37,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 02:22:37,752 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:37,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:37,752 INFO L182 omatonBuilderFactory]: Interpolants [90433#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 90432#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 90435#(and (<= 4 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.base) (+ main_~tree~0.offset 8)))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.offset) (+ main_~tree~0.offset 8))) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base)), 90434#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tmp~0.base |main_#t~malloc25.base|)) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.base main_~tmp~0.base)), 90437#(and (<= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 90436#(and (not (= main_~newNode~0.base main_~tree~0.base)) (<= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)))), 90439#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= |main_#t~mem37.base| main_~tree~0.base)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 90438#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 90441#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 90440#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))))), 90442#(and (= |main_#t~mem42.offset| 0) (<= 4 (select |#length| |main_#t~mem42.base|))), 90419#true, 90421#(= 0 |main_#t~malloc0.offset|), 90420#false, 90423#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 90422#(= 0 main_~tree~0.offset), 90425#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 90424#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|) (= 0 main_~tree~0.offset)), 90427#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 90426#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 90429#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~mem10.base|) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 90428#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 90431#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 90430#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~tmpList~0.base (store (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem12.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) 1) (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~tmpList~0.base (store (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem12.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (<= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~tmpList~0.base (store (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem12.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1))] [2018-02-04 02:22:37,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:37,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 02:22:37,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 02:22:37,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2018-02-04 02:22:37,752 INFO L87 Difference]: Start difference. First operand 928 states and 1225 transitions. Second operand 24 states. [2018-02-04 02:22:40,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:40,491 INFO L93 Difference]: Finished difference Result 1672 states and 2099 transitions. [2018-02-04 02:22:40,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 02:22:40,491 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 61 [2018-02-04 02:22:40,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:40,492 INFO L225 Difference]: With dead ends: 1672 [2018-02-04 02:22:40,492 INFO L226 Difference]: Without dead ends: 1672 [2018-02-04 02:22:40,492 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=765, Invalid=2315, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 02:22:40,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2018-02-04 02:22:40,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 932. [2018-02-04 02:22:40,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 932 states. [2018-02-04 02:22:40,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1229 transitions. [2018-02-04 02:22:40,498 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1229 transitions. Word has length 61 [2018-02-04 02:22:40,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:40,498 INFO L432 AbstractCegarLoop]: Abstraction has 932 states and 1229 transitions. [2018-02-04 02:22:40,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 02:22:40,498 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1229 transitions. [2018-02-04 02:22:40,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 02:22:40,499 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:40,499 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:40,499 INFO L371 AbstractCegarLoop]: === Iteration 77 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:40,499 INFO L82 PathProgramCache]: Analyzing trace with hash 810031820, now seen corresponding path program 1 times [2018-02-04 02:22:40,499 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:40,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:40,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:40,623 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:22:40,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 02:22:40,623 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:40,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:40,623 INFO L182 omatonBuilderFactory]: Interpolants [93121#(not (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset) 0)), 93120#(and (not (= |main_#t~mem37.base| main_~tree~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset) 0))), 93123#(not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) 0)), 93122#(not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset) 0)), 93125#|main_#t~short49|, 93124#(and (= |main_#t~mem47.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) 0))), 93111#true, 93113#(= (select |#valid| main_~tree~0.base) 1), 93112#false, 93115#(and (not (= |main_#t~malloc25.base| 0)) (not (= main_~tree~0.base |main_#t~malloc25.base|)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 93114#(and (= (select |#valid| main_~tree~0.base) 1) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 93117#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset) 0)) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1)), 93116#(and (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (not (= main_~newNode~0.base 0)) (= main_~tmp~0.offset main_~tree~0.offset)), 93119#(and (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset) 0)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 93118#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) main_~tree~0.offset) 0)) (not (= main_~tree~0.base |main_#t~malloc35.base|)))] [2018-02-04 02:22:40,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:40,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 02:22:40,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 02:22:40,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:22:40,624 INFO L87 Difference]: Start difference. First operand 932 states and 1229 transitions. Second operand 15 states. [2018-02-04 02:22:41,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:41,532 INFO L93 Difference]: Finished difference Result 1794 states and 2268 transitions. [2018-02-04 02:22:41,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 02:22:41,532 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-02-04 02:22:41,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:41,534 INFO L225 Difference]: With dead ends: 1794 [2018-02-04 02:22:41,534 INFO L226 Difference]: Without dead ends: 1794 [2018-02-04 02:22:41,534 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=1081, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 02:22:41,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2018-02-04 02:22:41,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 932. [2018-02-04 02:22:41,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 932 states. [2018-02-04 02:22:41,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1228 transitions. [2018-02-04 02:22:41,540 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1228 transitions. Word has length 62 [2018-02-04 02:22:41,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:41,541 INFO L432 AbstractCegarLoop]: Abstraction has 932 states and 1228 transitions. [2018-02-04 02:22:41,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 02:22:41,541 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1228 transitions. [2018-02-04 02:22:41,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 02:22:41,541 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:41,541 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:41,541 INFO L371 AbstractCegarLoop]: === Iteration 78 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:41,541 INFO L82 PathProgramCache]: Analyzing trace with hash -109218273, now seen corresponding path program 1 times [2018-02-04 02:22:41,542 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:41,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:41,740 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:41,740 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:22:41,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 02:22:41,740 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:41,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:41,741 INFO L182 omatonBuilderFactory]: Interpolants [95905#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 95904#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 95907#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 95906#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem13.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) |main_#t~mem13.offset| main_~tmpList~0.offset)) main_~tree~0.base) (+ main_~tree~0.offset 8)))), 95909#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (not (= |main_#t~mem61.base| main_~tmp~0.base))), 95908#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 95911#(= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))), 95910#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (select |#memory_$Pointer$.offset| main_~tmp~0.base) (select (store |#memory_$Pointer$.offset| |main_#t~mem61.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem61.base|) |main_#t~mem61.offset| |main_#t~mem63.offset|)) main_~tmp~0.base))), 95912#(= |main_#t~mem64.offset| 0), 95899#false, 95898#true, 95901#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 95900#(= 1 (select |#valid| main_~tree~0.base)), 95903#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= (select |#valid| main_~tree~0.base) 1)), 95902#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1))] [2018-02-04 02:22:41,741 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:41,741 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 02:22:41,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 02:22:41,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:22:41,741 INFO L87 Difference]: Start difference. First operand 932 states and 1228 transitions. Second operand 15 states. [2018-02-04 02:22:42,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:42,262 INFO L93 Difference]: Finished difference Result 1089 states and 1385 transitions. [2018-02-04 02:22:42,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 02:22:42,263 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-02-04 02:22:42,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:42,263 INFO L225 Difference]: With dead ends: 1089 [2018-02-04 02:22:42,263 INFO L226 Difference]: Without dead ends: 1089 [2018-02-04 02:22:42,263 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2018-02-04 02:22:42,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2018-02-04 02:22:42,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 947. [2018-02-04 02:22:42,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2018-02-04 02:22:42,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1249 transitions. [2018-02-04 02:22:42,267 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1249 transitions. Word has length 63 [2018-02-04 02:22:42,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:42,268 INFO L432 AbstractCegarLoop]: Abstraction has 947 states and 1249 transitions. [2018-02-04 02:22:42,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 02:22:42,268 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1249 transitions. [2018-02-04 02:22:42,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 02:22:42,268 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:42,268 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 02:22:42,268 INFO L371 AbstractCegarLoop]: === Iteration 79 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:42,268 INFO L82 PathProgramCache]: Analyzing trace with hash -993978397, now seen corresponding path program 1 times [2018-02-04 02:22:42,269 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:42,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:42,507 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:42,507 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:22:42,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 02:22:42,508 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:42,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:42,508 INFO L182 omatonBuilderFactory]: Interpolants [97985#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 97984#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset))), 97987#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= |main_#t~mem37.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 97986#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 97989#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 97988#(and (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) main_~tree~0.offset))), 97991#(and (= |main_#t~mem16.base| 0) (= |main_#t~mem16.offset| 0)), 97990#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))), 97992#(not |main_#t~short18|), 97975#true, 97977#(= (select |#valid| main_~tree~0.base) 1), 97976#false, 97979#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 97978#(and (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 97981#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 97980#(or |main_#t~short18| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1))), 97983#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 97982#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~tmp~0.base |main_#t~malloc30.base|)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base))] [2018-02-04 02:22:42,508 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:42,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 02:22:42,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 02:22:42,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:22:42,509 INFO L87 Difference]: Start difference. First operand 947 states and 1249 transitions. Second operand 18 states. [2018-02-04 02:22:43,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:43,805 INFO L93 Difference]: Finished difference Result 1748 states and 2167 transitions. [2018-02-04 02:22:43,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 02:22:43,805 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 64 [2018-02-04 02:22:43,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:43,807 INFO L225 Difference]: With dead ends: 1748 [2018-02-04 02:22:43,807 INFO L226 Difference]: Without dead ends: 1748 [2018-02-04 02:22:43,807 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=342, Invalid=1064, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 02:22:43,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2018-02-04 02:22:43,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1052. [2018-02-04 02:22:43,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2018-02-04 02:22:43,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1373 transitions. [2018-02-04 02:22:43,814 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1373 transitions. Word has length 64 [2018-02-04 02:22:43,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:43,814 INFO L432 AbstractCegarLoop]: Abstraction has 1052 states and 1373 transitions. [2018-02-04 02:22:43,814 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 02:22:43,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1373 transitions. [2018-02-04 02:22:43,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 02:22:43,814 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:43,815 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:43,815 INFO L371 AbstractCegarLoop]: === Iteration 80 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:43,815 INFO L82 PathProgramCache]: Analyzing trace with hash -12887071, now seen corresponding path program 1 times [2018-02-04 02:22:43,815 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:43,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:44,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:44,005 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:22:44,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 02:22:44,006 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:44,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:44,006 INFO L182 omatonBuilderFactory]: Interpolants [100835#false, 100834#true, 100837#(and (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 100836#(= (select |#valid| main_~tree~0.base) 1), 100839#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)) |main_#t~short18|), 100838#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) |main_#t~mem16.offset|) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 100841#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~tmp~0.base |main_#t~malloc30.base|)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 100840#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 100843#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset))), 100842#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 100845#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 100844#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 100847#(and (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) main_~tree~0.offset))), 100846#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= |main_#t~mem37.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 100849#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))), 100848#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 100851#(not |main_#t~short49|), 100850#(and (= |main_#t~mem47.base| 0) (= 0 |main_#t~mem47.offset|))] [2018-02-04 02:22:44,006 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:44,006 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 02:22:44,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 02:22:44,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:22:44,006 INFO L87 Difference]: Start difference. First operand 1052 states and 1373 transitions. Second operand 18 states. [2018-02-04 02:22:45,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:45,425 INFO L93 Difference]: Finished difference Result 1684 states and 2080 transitions. [2018-02-04 02:22:45,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 02:22:45,425 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 65 [2018-02-04 02:22:45,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:45,426 INFO L225 Difference]: With dead ends: 1684 [2018-02-04 02:22:45,427 INFO L226 Difference]: Without dead ends: 1678 [2018-02-04 02:22:45,427 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=486, Invalid=1964, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 02:22:45,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2018-02-04 02:22:45,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1103. [2018-02-04 02:22:45,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2018-02-04 02:22:45,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1448 transitions. [2018-02-04 02:22:45,433 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1448 transitions. Word has length 65 [2018-02-04 02:22:45,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:45,433 INFO L432 AbstractCegarLoop]: Abstraction has 1103 states and 1448 transitions. [2018-02-04 02:22:45,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 02:22:45,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1448 transitions. [2018-02-04 02:22:45,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 02:22:45,434 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:45,434 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:45,434 INFO L371 AbstractCegarLoop]: === Iteration 81 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:45,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1879535647, now seen corresponding path program 1 times [2018-02-04 02:22:45,434 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:45,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:45,814 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:22:45,814 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:22:45,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 02:22:45,814 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:45,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:45,814 INFO L182 omatonBuilderFactory]: Interpolants [103713#(and (or (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem59.base|) (= |main_#t~mem59.base| main_~tmp~0.base)) (or (not (= |main_#t~mem59.base| main_~tmp~0.base)) (and (or (= 0 (select |#valid| 0)) (not (= main_~tmp~0.offset |main_#t~mem59.offset|))) (or (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem59.offset|) (= main_~tmp~0.offset |main_#t~mem59.offset|)))) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= main_~tmp~0.offset 0)), 103712#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select |#valid| 0)) (= main_~tmp~0.offset 0)), 103715#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (or (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) main_~tmp~0.base)) (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) main_~tmp~0.offset)) (= 0 (select |#valid| main_~tmpList~0.base))) (= main_~tmp~0.offset 0)), 103714#(and (or (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) main_~tmp~0.base)) (and (= 0 |main_#t~mem60.base|) (= 0 (select |#valid| 0))) (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) main_~tmp~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= main_~tmp~0.offset 0)), 103717#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= 1 (select |#valid| main_~tmpList~0.base)) (= main_~tmp~0.offset 0) (or (not (= main_~tmp~0.offset |main_#t~mem61.offset|)) (not (= main_~tmp~0.base |main_#t~mem61.base|)))), 103716#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (or (not (= main_~tmp~0.offset |main_#t~mem61.offset|)) (not (= main_~tmp~0.base |main_#t~mem61.base|)) (= 0 (select |#valid| main_~tmpList~0.base))) (= main_~tmp~0.offset 0)), 103719#(= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 0)), 103718#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 0)) (= 1 (select |#valid| main_~tmpList~0.base))), 103721#(and (= 1 (select |#valid| main_~tmp~0.base)) (or (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) main_~tmp~0.base)) (and (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem56.base|) |main_#t~mem56.offset|))) (and (= |main_#t~mem56.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 0)) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem56.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (and (not (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmp~0.offset |main_#t~mem56.offset|))))), 103720#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 0)) (= 1 (select |#valid| main_~tmp~0.base)) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 103723#(and (or (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) main_~tmp~0.base)) (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= 1 (select |#valid| main_~tmp~0.base))), 103722#(and (or (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) main_~tmp~0.base)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (and (= 0 |main_#t~mem58.base|) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (= 1 (select |#valid| main_~tmp~0.base))), 103725#(= 1 (select |#valid| main_~tmp~0.base)), 103724#(and (or (not (= main_~tmp~0.base |main_#t~mem64.base|)) (= |main_#t~mem64.base| 0) (not (= |main_#t~mem64.offset| 0))) (= 1 (select |#valid| main_~tmp~0.base))), 103705#false, 103704#true, 103707#(and (= 0 (select |#valid| 0)) (= |main_#t~malloc0.offset| 0)), 103706#(= 0 (select |#valid| 0)), 103709#(and (= 0 (select |#valid| 0)) (= main_~tmp~0.offset 0)), 103708#(and (= 0 (select |#valid| 0)) (= 0 main_~tree~0.offset)), 103711#(or |main_#t~short49| (and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select |#valid| 0)) (= main_~tmp~0.offset 0))), 103710#(and (= 0 (select |#valid| 0)) (= main_~tmp~0.offset 0) (= |main_#t~mem47.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))] [2018-02-04 02:22:45,814 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:22:45,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 02:22:45,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 02:22:45,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:22:45,815 INFO L87 Difference]: Start difference. First operand 1103 states and 1448 transitions. Second operand 22 states. [2018-02-04 02:22:47,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:47,411 INFO L93 Difference]: Finished difference Result 1225 states and 1575 transitions. [2018-02-04 02:22:47,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 02:22:47,411 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 65 [2018-02-04 02:22:47,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:47,412 INFO L225 Difference]: With dead ends: 1225 [2018-02-04 02:22:47,412 INFO L226 Difference]: Without dead ends: 1225 [2018-02-04 02:22:47,412 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=647, Invalid=2215, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 02:22:47,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2018-02-04 02:22:47,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1087. [2018-02-04 02:22:47,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1087 states. [2018-02-04 02:22:47,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1426 transitions. [2018-02-04 02:22:47,417 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1426 transitions. Word has length 65 [2018-02-04 02:22:47,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:47,417 INFO L432 AbstractCegarLoop]: Abstraction has 1087 states and 1426 transitions. [2018-02-04 02:22:47,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 02:22:47,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1426 transitions. [2018-02-04 02:22:47,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 02:22:47,418 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:47,418 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:47,418 INFO L371 AbstractCegarLoop]: === Iteration 82 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:47,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1751848451, now seen corresponding path program 1 times [2018-02-04 02:22:47,419 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:47,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:47,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:47,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:22:47,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 02:22:47,887 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:47,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:47,887 INFO L182 omatonBuilderFactory]: Interpolants [106113#(and (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~tmpList~0.base (store (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem12.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~tmpList~0.base (store (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem12.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 106112#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~mem10.base|) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 106115#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 106114#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= (select |#valid| main_~tree~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 106117#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (not (= main_~tmp~0.base |main_#t~malloc30.base|)) (= main_~tree~0.base main_~tmp~0.base)), 106116#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= (select |#valid| main_~tree~0.base) (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 106119#(and (not (= main_~newNode~0.base main_~tree~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 106118#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4) main_~newNode~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base)), 106121#(and (or (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 106120#(and (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~malloc35.base| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 106123#(or (= |main_#t~mem37.base| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))))), 106122#(and (or (and (= (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem37.base| (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (not (= |main_#t~mem37.base| main_~tree~0.base))), 106125#(= 1 (select |#valid| |main_#t~mem42.base|)), 106124#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 106103#false, 106102#true, 106105#(= 0 main_~tree~0.offset), 106104#(= 0 |main_#t~malloc0.offset|), 106107#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 main_~tree~0.offset)), 106106#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 106109#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 106108#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 106111#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 106110#(and (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset))] [2018-02-04 02:22:47,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:47,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 02:22:47,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 02:22:47,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2018-02-04 02:22:47,887 INFO L87 Difference]: Start difference. First operand 1087 states and 1426 transitions. Second operand 24 states. [2018-02-04 02:22:50,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:50,064 INFO L93 Difference]: Finished difference Result 1500 states and 1898 transitions. [2018-02-04 02:22:50,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 02:22:50,064 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 65 [2018-02-04 02:22:50,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:50,065 INFO L225 Difference]: With dead ends: 1500 [2018-02-04 02:22:50,065 INFO L226 Difference]: Without dead ends: 1500 [2018-02-04 02:22:50,065 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=885, Invalid=2655, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 02:22:50,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2018-02-04 02:22:50,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1118. [2018-02-04 02:22:50,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2018-02-04 02:22:50,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1463 transitions. [2018-02-04 02:22:50,071 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1463 transitions. Word has length 65 [2018-02-04 02:22:50,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:50,071 INFO L432 AbstractCegarLoop]: Abstraction has 1118 states and 1463 transitions. [2018-02-04 02:22:50,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 02:22:50,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1463 transitions. [2018-02-04 02:22:50,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 02:22:50,071 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:50,071 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:50,072 INFO L371 AbstractCegarLoop]: === Iteration 83 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:50,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1751848452, now seen corresponding path program 1 times [2018-02-04 02:22:50,072 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:50,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:50,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:50,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:50,724 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:22:50,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 02:22:50,724 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:50,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:50,724 INFO L182 omatonBuilderFactory]: Interpolants [108817#false, 108816#true, 108819#(= 0 main_~tree~0.offset), 108818#(= 0 |main_#t~malloc0.offset|), 108821#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|) (= 0 main_~tree~0.offset) (= 4 (select |#length| |main_#t~malloc3.base|))), 108820#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 108823#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 108822#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 108825#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 108824#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 108827#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| |main_#t~mem10.base|)) (not (= main_~tree~0.base main_~tmpList~0.base)) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~mem10.base|) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 108826#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 108829#(and (= (select |#valid| main_~tree~0.base) (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= (select |#valid| main_~tree~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem13.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) |main_#t~mem13.offset| main_~tmpList~0.offset)) main_~tree~0.base) (+ main_~tree~0.offset 8)))), 108828#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| main_~tree~0.base) (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~tmpList~0.base (store (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem12.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~tmpList~0.base (store (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem12.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~tmpList~0.base (store (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem12.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 108831#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= (select |#valid| main_~tree~0.base) (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| main_~tree~0.base) 1) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tree~0.base main_~tmp~0.base)), 108830#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| main_~tree~0.base) (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 108833#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 4 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4) main_~newNode~0.base) (+ main_~tree~0.offset 8)))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4) main_~newNode~0.offset) (+ main_~tree~0.offset 8))) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base)), 108832#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~malloc30.base|)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tree~0.base main_~tmp~0.base)), 108835#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 108834#(and (not (= main_~newNode~0.base main_~tree~0.base)) (= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)))), 108837#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= |main_#t~mem37.base| main_~tree~0.base))), 108836#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 108839#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 108838#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))))), 108840#(and (= (select |#length| |main_#t~mem42.base|) 4) (= |main_#t~mem42.offset| 0))] [2018-02-04 02:22:50,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:50,725 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 02:22:50,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 02:22:50,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2018-02-04 02:22:50,725 INFO L87 Difference]: Start difference. First operand 1118 states and 1463 transitions. Second operand 25 states. [2018-02-04 02:22:53,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:53,275 INFO L93 Difference]: Finished difference Result 1477 states and 1889 transitions. [2018-02-04 02:22:53,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 02:22:53,275 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 65 [2018-02-04 02:22:53,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:53,276 INFO L225 Difference]: With dead ends: 1477 [2018-02-04 02:22:53,276 INFO L226 Difference]: Without dead ends: 1477 [2018-02-04 02:22:53,276 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=780, Invalid=2760, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 02:22:53,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2018-02-04 02:22:53,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1118. [2018-02-04 02:22:53,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2018-02-04 02:22:53,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1463 transitions. [2018-02-04 02:22:53,284 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1463 transitions. Word has length 65 [2018-02-04 02:22:53,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:53,284 INFO L432 AbstractCegarLoop]: Abstraction has 1118 states and 1463 transitions. [2018-02-04 02:22:53,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 02:22:53,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1463 transitions. [2018-02-04 02:22:53,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 02:22:53,285 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:53,285 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:53,285 INFO L371 AbstractCegarLoop]: === Iteration 84 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:53,285 INFO L82 PathProgramCache]: Analyzing trace with hash -339901488, now seen corresponding path program 1 times [2018-02-04 02:22:53,285 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:53,291 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:53,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:53,462 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:22:53,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 02:22:53,462 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:53,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:53,463 INFO L182 omatonBuilderFactory]: Interpolants [111521#(and (not (= 0 |main_#t~mem48.base|)) (= main_~tmp~0.offset 0)), 111520#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))) (= main_~tmp~0.offset 0)), 111522#(and |main_#t~short49| (= main_~tmp~0.offset 0)), 111507#false, 111506#true, 111509#(= 0 main_~tree~0.offset), 111508#(= 0 |main_#t~malloc0.offset|), 111511#(and (= 0 main_~tree~0.offset) (= main_~tmp~0.base main_~tree~0.base) (= main_~tree~0.offset main_~tmp~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 111510#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 111513#(and (not (= 0 main_~newNode~0.base)) (= 0 main_~tree~0.offset) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tree~0.offset main_~tmp~0.offset)), 111512#(and (not (= 0 |main_#t~malloc30.base|)) (= 0 main_~tree~0.offset) (not (= main_~tmp~0.base |main_#t~malloc30.base|)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tree~0.offset main_~tmp~0.offset)), 111515#(and (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 111514#(and (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 4)))) (not (= main_~newNode~0.base main_~tree~0.base)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 111517#(and (not (= |main_#t~mem37.base| main_~tree~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= 0 main_~tree~0.offset)), 111516#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 111519#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= 0 main_~tree~0.offset)), 111518#(and (not (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= 0 main_~tree~0.offset))] [2018-02-04 02:22:53,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:53,463 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 02:22:53,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 02:22:53,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:22:53,463 INFO L87 Difference]: Start difference. First operand 1118 states and 1463 transitions. Second operand 17 states. [2018-02-04 02:22:54,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:54,774 INFO L93 Difference]: Finished difference Result 2244 states and 2848 transitions. [2018-02-04 02:22:54,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 02:22:54,774 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2018-02-04 02:22:54,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:54,775 INFO L225 Difference]: With dead ends: 2244 [2018-02-04 02:22:54,775 INFO L226 Difference]: Without dead ends: 2244 [2018-02-04 02:22:54,775 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=491, Invalid=1315, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 02:22:54,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2244 states. [2018-02-04 02:22:54,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2244 to 1218. [2018-02-04 02:22:54,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2018-02-04 02:22:54,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1596 transitions. [2018-02-04 02:22:54,783 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1596 transitions. Word has length 66 [2018-02-04 02:22:54,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:54,783 INFO L432 AbstractCegarLoop]: Abstraction has 1218 states and 1596 transitions. [2018-02-04 02:22:54,783 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 02:22:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1596 transitions. [2018-02-04 02:22:54,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 02:22:54,784 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:54,784 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:54,784 INFO L371 AbstractCegarLoop]: === Iteration 85 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:54,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1899246647, now seen corresponding path program 1 times [2018-02-04 02:22:54,784 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:54,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:55,480 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:55,481 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:22:55,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-04 02:22:55,481 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:55,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:55,481 INFO L182 omatonBuilderFactory]: Interpolants [115037#true, 115039#(= 1 (select |#valid| main_~tree~0.base)), 115038#false, 115041#(and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 115040#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= |main_#t~malloc3.offset| 0) (= 4 (select |#length| |main_#t~malloc3.base|))), 115043#(and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= (select |#valid| main_~tree~0.base) 1) (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~mem7.base|)), 115042#(and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= (select |#valid| main_~tree~0.base) 1) (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 115045#(and (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~malloc9.base|)) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 115044#(and (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 115047#(and (= |main_#t~mem10.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (= 4 (select |#length| |main_#t~mem10.base|)) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| |main_#t~mem10.base|) |main_#t~mem10.offset|)) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tmpList~0.base))), 115046#(and (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tmpList~0.base))), 115049#(and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tmpList~0.base))), 115048#(and (= (select (select (store |#memory_$Pointer$.base| main_~tmpList~0.base (store (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem12.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~mem12.base|) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~tmpList~0.base (store (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem12.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= (select (select (store |#memory_$Pointer$.base| main_~tmpList~0.base (store (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem12.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tmpList~0.base))), 115051#(and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 115050#(and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tmpList~0.base |main_#t~mem13.base|)) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem13.base| (store (select |#memory_$Pointer$.base| |main_#t~mem13.base|) |main_#t~mem13.offset| main_~tmpList~0.base)) main_~tmpList~0.base) main_~tmpList~0.offset))), 115053#(and (= |main_#t~mem56.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= |main_#t~mem56.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 115052#(and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 115055#(and (or (and (= (select |#length| |main_#t~mem59.base|) 4) (<= |main_#t~mem59.offset| 0)) (= 0 |main_#t~mem59.offset|)) (or (not (= 0 |main_#t~mem59.offset|)) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem59.base|) |main_#t~mem59.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem59.base|) |main_#t~mem59.offset|)))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 115054#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 115057#(and (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset))), 115056#(and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| |main_#t~mem60.base|) |main_#t~mem60.offset|)) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 115059#(and (not (= main_~tmp~0.base |main_#t~mem61.base|)) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem63.base|) (= |main_#t~mem61.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem61.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 115058#(and (not (= main_~tmp~0.base |main_#t~mem61.base|)) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset)) (= |main_#t~mem61.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem61.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 115061#(and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= |main_#t~mem56.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 115060#(= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 115063#(and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| |main_#t~mem59.base|) |main_#t~mem59.offset|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 115062#(and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 115065#(and (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 115064#(and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem60.base|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 115066#(= 1 (select |#valid| main_~tmpList~0.base))] [2018-02-04 02:22:55,481 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:55,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 02:22:55,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 02:22:55,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2018-02-04 02:22:55,482 INFO L87 Difference]: Start difference. First operand 1218 states and 1596 transitions. Second operand 30 states. [2018-02-04 02:22:58,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:22:58,026 INFO L93 Difference]: Finished difference Result 2190 states and 2853 transitions. [2018-02-04 02:22:58,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 02:22:58,026 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 66 [2018-02-04 02:22:58,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:22:58,027 INFO L225 Difference]: With dead ends: 2190 [2018-02-04 02:22:58,027 INFO L226 Difference]: Without dead ends: 2190 [2018-02-04 02:22:58,028 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1036 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=450, Invalid=4106, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 02:22:58,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2018-02-04 02:22:58,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 1280. [2018-02-04 02:22:58,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1280 states. [2018-02-04 02:22:58,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1666 transitions. [2018-02-04 02:22:58,037 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1666 transitions. Word has length 66 [2018-02-04 02:22:58,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:22:58,037 INFO L432 AbstractCegarLoop]: Abstraction has 1280 states and 1666 transitions. [2018-02-04 02:22:58,037 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 02:22:58,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1666 transitions. [2018-02-04 02:22:58,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 02:22:58,038 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:22:58,038 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:22:58,038 INFO L371 AbstractCegarLoop]: === Iteration 86 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:22:58,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1899246648, now seen corresponding path program 1 times [2018-02-04 02:22:58,039 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:22:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:22:58,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:22:58,865 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:58,865 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:22:58,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 02:22:58,865 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:22:58,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:58,866 INFO L182 omatonBuilderFactory]: Interpolants [118613#true, 118615#(= 1 (select |#valid| main_~tree~0.base)), 118614#false, 118617#(and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 118616#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|) (= 4 (select |#length| |main_#t~malloc3.base|))), 118619#(and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 |main_#t~mem7.offset|) (= (select |#valid| main_~tree~0.base) 1) (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~mem7.base|)), 118618#(and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= (select |#valid| main_~tree~0.base) 1) (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 118621#(and (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~malloc9.base|)) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base |main_#t~malloc9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 118620#(and (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 118623#(and (= |main_#t~mem10.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (= 4 (select |#length| |main_#t~mem10.base|)) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| |main_#t~mem10.base|) |main_#t~mem10.offset|)) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem10.base|) |main_#t~mem10.offset|)) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tmpList~0.base))), 118622#(and (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tmpList~0.base))), 118625#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmpList~0.base) main_~tmpList~0.offset)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tmpList~0.base))), 118624#(and (= (select (select (store |#memory_$Pointer$.base| main_~tmpList~0.base (store (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem12.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~mem12.base|) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (= 0 |main_#t~mem12.offset|) (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~tmpList~0.base (store (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem12.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= (select (select (store |#memory_$Pointer$.base| main_~tmpList~0.base (store (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem12.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tmpList~0.base))), 118627#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 118626#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem13.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) |main_#t~mem13.offset| main_~tmpList~0.offset)) main_~tmpList~0.base) main_~tmpList~0.offset)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tmpList~0.base |main_#t~mem13.base|)) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem13.base| (store (select |#memory_$Pointer$.base| |main_#t~mem13.base|) |main_#t~mem13.offset| main_~tmpList~0.base)) main_~tmpList~0.base) main_~tmpList~0.offset))), 118629#(and (= |main_#t~mem56.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= |main_#t~mem56.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 118628#(and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)))), 118631#(and (or (and (= (select |#length| |main_#t~mem59.base|) 4) (<= |main_#t~mem59.offset| 0)) (= 0 |main_#t~mem59.offset|)) (or (and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem59.base|) |main_#t~mem59.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem59.base|) |main_#t~mem59.offset|))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem59.base|) |main_#t~mem59.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem59.base|) |main_#t~mem59.offset|)))) (not (= 0 |main_#t~mem59.offset|))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 118630#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)))), 118633#(and (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.offset| main_~tmpList~0.base) main_~tmpList~0.offset)) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset))), 118632#(and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| |main_#t~mem60.base|) |main_#t~mem60.offset|)) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.offset| |main_#t~mem60.base|) |main_#t~mem60.offset|)) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 118635#(and (not (= main_~tmp~0.base |main_#t~mem61.base|)) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem63.base|) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) |main_#t~mem63.offset|) (= |main_#t~mem61.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem61.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 118634#(and (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.offset| main_~tmpList~0.base) main_~tmpList~0.offset)) (not (= main_~tmp~0.base |main_#t~mem61.base|)) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset)) (= |main_#t~mem61.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem61.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 118637#(and (= |main_#t~mem57.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 118636#(and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 118639#(and (= |main_#t~mem58.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem57.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem58.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 118638#(and (= |main_#t~mem57.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| |main_#t~mem56.base|) |main_#t~mem56.offset|)) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.offset| |main_#t~mem56.base|) |main_#t~mem56.offset|)) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))] [2018-02-04 02:22:58,866 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:22:58,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 02:22:58,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 02:22:58,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2018-02-04 02:22:58,866 INFO L87 Difference]: Start difference. First operand 1280 states and 1666 transitions. Second operand 27 states. [2018-02-04 02:23:01,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:23:01,166 INFO L93 Difference]: Finished difference Result 1430 states and 1854 transitions. [2018-02-04 02:23:01,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 02:23:01,167 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 66 [2018-02-04 02:23:01,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:23:01,168 INFO L225 Difference]: With dead ends: 1430 [2018-02-04 02:23:01,168 INFO L226 Difference]: Without dead ends: 1430 [2018-02-04 02:23:01,168 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=411, Invalid=2895, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 02:23:01,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2018-02-04 02:23:01,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1275. [2018-02-04 02:23:01,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2018-02-04 02:23:01,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1659 transitions. [2018-02-04 02:23:01,176 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1659 transitions. Word has length 66 [2018-02-04 02:23:01,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:23:01,176 INFO L432 AbstractCegarLoop]: Abstraction has 1275 states and 1659 transitions. [2018-02-04 02:23:01,176 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 02:23:01,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1659 transitions. [2018-02-04 02:23:01,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 02:23:01,176 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:23:01,176 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:23:01,176 INFO L371 AbstractCegarLoop]: === Iteration 87 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:23:01,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1319110590, now seen corresponding path program 1 times [2018-02-04 02:23:01,177 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:23:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:23:01,183 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:23:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:01,404 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:23:01,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 02:23:01,404 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:23:01,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:01,404 INFO L182 omatonBuilderFactory]: Interpolants [121409#(= 0 |main_#t~malloc0.offset|), 121408#false, 121411#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 121410#(= 0 main_~tree~0.offset), 121413#(and (not (= main_~tree~0.base |main_#t~malloc30.base|)) (= 0 main_~tree~0.offset) (= main_~tmp~0.base main_~tree~0.base) (= main_~tree~0.offset main_~tmp~0.offset)), 121412#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= main_~tree~0.offset main_~tmp~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 121415#(and (not (= main_~newNode~0.base main_~tree~0.base)) (= 0 main_~tree~0.offset) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= (select |#valid| main_~tree~0.base) 1)), 121414#(and (= 0 main_~tree~0.offset) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tree~0.offset main_~tmp~0.offset)), 121417#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= (select |#valid| main_~newNode~0.base) 1) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 121416#(and (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 121419#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= 0 main_~tree~0.offset)), 121418#(and (not (= |main_#t~mem37.base| main_~tree~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= 0 main_~tree~0.offset)), 121421#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))) (= main_~tmp~0.offset 0)), 121420#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= 0 main_~tree~0.offset)), 121423#(= 1 (select |#valid| main_~tmp~0.base)), 121422#(= 1 (select |#valid| |main_#t~mem52.base|)), 121407#true] [2018-02-04 02:23:01,404 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:01,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 02:23:01,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 02:23:01,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:23:01,405 INFO L87 Difference]: Start difference. First operand 1275 states and 1659 transitions. Second operand 17 states. [2018-02-04 02:23:02,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:23:02,795 INFO L93 Difference]: Finished difference Result 2316 states and 2928 transitions. [2018-02-04 02:23:02,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 02:23:02,795 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2018-02-04 02:23:02,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:23:02,797 INFO L225 Difference]: With dead ends: 2316 [2018-02-04 02:23:02,797 INFO L226 Difference]: Without dead ends: 2316 [2018-02-04 02:23:02,797 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=457, Invalid=1103, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 02:23:02,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2018-02-04 02:23:02,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 1287. [2018-02-04 02:23:02,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1287 states. [2018-02-04 02:23:02,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1673 transitions. [2018-02-04 02:23:02,807 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1673 transitions. Word has length 67 [2018-02-04 02:23:02,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:23:02,807 INFO L432 AbstractCegarLoop]: Abstraction has 1287 states and 1673 transitions. [2018-02-04 02:23:02,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 02:23:02,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1673 transitions. [2018-02-04 02:23:02,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 02:23:02,808 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:23:02,808 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:23:02,808 INFO L371 AbstractCegarLoop]: === Iteration 88 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:23:02,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1319110589, now seen corresponding path program 1 times [2018-02-04 02:23:02,809 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:23:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:23:02,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:23:02,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:02,980 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:23:02,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 02:23:02,980 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:23:02,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:02,980 INFO L182 omatonBuilderFactory]: Interpolants [125073#true, 125075#(= (select |#valid| main_~tree~0.base) 1), 125074#false, 125077#(and (= 0 |main_#t~malloc30.offset|) (not (= main_~tmp~0.base |main_#t~malloc30.base|)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tree~0.offset main_~tmp~0.offset)), 125076#(and (= main_~tmp~0.base main_~tree~0.base) (= main_~tree~0.offset main_~tmp~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 125079#(and (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= (select |#valid| main_~tree~0.base) 1)), 125078#(and (= main_~newNode~0.offset 0) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tree~0.offset main_~tmp~0.offset)), 125081#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (<= (+ main_~newNode~0.offset 12) (select |#length| main_~newNode~0.base)) (= main_~newNode~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 125080#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= main_~newNode~0.offset 0) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 125083#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (<= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 4))))), 125082#(and (not (= |main_#t~mem37.base| main_~tree~0.base)) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (<= (+ main_~newNode~0.offset 12) (select |#length| main_~newNode~0.base)) (= main_~newNode~0.offset 0)), 125085#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))), 125084#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))))), 125087#(and (<= 12 (select |#length| main_~tmp~0.base)) (= main_~tmp~0.offset 0)), 125086#(and (<= 12 (select |#length| |main_#t~mem52.base|)) (= 0 |main_#t~mem52.offset|))] [2018-02-04 02:23:02,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:02,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 02:23:02,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 02:23:02,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:23:02,981 INFO L87 Difference]: Start difference. First operand 1287 states and 1673 transitions. Second operand 15 states. [2018-02-04 02:23:04,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:23:04,526 INFO L93 Difference]: Finished difference Result 2484 states and 3138 transitions. [2018-02-04 02:23:04,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 02:23:04,526 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2018-02-04 02:23:04,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:23:04,528 INFO L225 Difference]: With dead ends: 2484 [2018-02-04 02:23:04,528 INFO L226 Difference]: Without dead ends: 2484 [2018-02-04 02:23:04,528 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=259, Invalid=863, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 02:23:04,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2018-02-04 02:23:04,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 1308. [2018-02-04 02:23:04,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2018-02-04 02:23:04,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1707 transitions. [2018-02-04 02:23:04,537 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1707 transitions. Word has length 67 [2018-02-04 02:23:04,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:23:04,538 INFO L432 AbstractCegarLoop]: Abstraction has 1308 states and 1707 transitions. [2018-02-04 02:23:04,538 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 02:23:04,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1707 transitions. [2018-02-04 02:23:04,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 02:23:04,538 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:23:04,538 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] [2018-02-04 02:23:04,538 INFO L371 AbstractCegarLoop]: === Iteration 89 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:23:04,538 INFO L82 PathProgramCache]: Analyzing trace with hash -513311931, now seen corresponding path program 1 times [2018-02-04 02:23:04,539 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:23:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:23:04,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:23:04,556 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:23:04,556 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:23:04,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-04 02:23:04,556 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:23:04,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:04,556 INFO L182 omatonBuilderFactory]: Interpolants [128919#false, 128918#true, 128921#(and (= main_~tmp~0.base main_~pred~0.base) (= 1 (select |#valid| main_~tmp~0.base))), 128920#(= 1 (select |#valid| main_~tmp~0.base)), 128922#(= 1 (select |#valid| main_~pred~0.base))] [2018-02-04 02:23:04,556 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:23:04,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:23:04,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:23:04,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:23:04,557 INFO L87 Difference]: Start difference. First operand 1308 states and 1707 transitions. Second operand 5 states. [2018-02-04 02:23:04,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:23:04,675 INFO L93 Difference]: Finished difference Result 1380 states and 1796 transitions. [2018-02-04 02:23:04,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:23:04,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-02-04 02:23:04,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:23:04,676 INFO L225 Difference]: With dead ends: 1380 [2018-02-04 02:23:04,676 INFO L226 Difference]: Without dead ends: 1380 [2018-02-04 02:23:04,677 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:23:04,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2018-02-04 02:23:04,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1305. [2018-02-04 02:23:04,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1305 states. [2018-02-04 02:23:04,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1695 transitions. [2018-02-04 02:23:04,683 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 1695 transitions. Word has length 68 [2018-02-04 02:23:04,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:23:04,683 INFO L432 AbstractCegarLoop]: Abstraction has 1305 states and 1695 transitions. [2018-02-04 02:23:04,683 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:23:04,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1695 transitions. [2018-02-04 02:23:04,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 02:23:04,683 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:23:04,683 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] [2018-02-04 02:23:04,683 INFO L371 AbstractCegarLoop]: === Iteration 90 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:23:04,684 INFO L82 PathProgramCache]: Analyzing trace with hash -513311930, now seen corresponding path program 1 times [2018-02-04 02:23:04,684 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:23:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:23:04,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:23:04,777 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:23:04,777 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:23:04,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 02:23:04,777 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:23:04,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:04,778 INFO L182 omatonBuilderFactory]: Interpolants [131616#(and (= (select |#length| main_~tmp~0.base) (select |#length| main_~pred~0.base)) (= main_~tmp~0.offset 0) (<= (+ main_~tmp~0.offset 4) (select |#length| main_~tmp~0.base)) (= main_~pred~0.offset 0)), 131617#(and (<= 4 (select |#length| main_~pred~0.base)) (= main_~pred~0.offset 0)), 131610#true, 131611#false, 131614#(= main_~tmp~0.offset 0), 131615#(and (= main_~tmp~0.offset 0) (<= (+ main_~tmp~0.offset 4) (select |#length| main_~tmp~0.base))), 131612#(= 0 |main_#t~malloc0.offset|), 131613#(= 0 main_~tree~0.offset)] [2018-02-04 02:23:04,778 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:23:04,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:23:04,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:23:04,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:23:04,778 INFO L87 Difference]: Start difference. First operand 1305 states and 1695 transitions. Second operand 8 states. [2018-02-04 02:23:04,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:23:04,970 INFO L93 Difference]: Finished difference Result 1498 states and 1925 transitions. [2018-02-04 02:23:04,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:23:04,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2018-02-04 02:23:04,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:23:04,971 INFO L225 Difference]: With dead ends: 1498 [2018-02-04 02:23:04,971 INFO L226 Difference]: Without dead ends: 1498 [2018-02-04 02:23:04,971 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:23:04,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2018-02-04 02:23:04,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1340. [2018-02-04 02:23:04,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2018-02-04 02:23:04,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1740 transitions. [2018-02-04 02:23:04,978 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1740 transitions. Word has length 68 [2018-02-04 02:23:04,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:23:04,978 INFO L432 AbstractCegarLoop]: Abstraction has 1340 states and 1740 transitions. [2018-02-04 02:23:04,978 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:23:04,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1740 transitions. [2018-02-04 02:23:04,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 02:23:04,978 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:23:04,978 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 02:23:04,979 INFO L371 AbstractCegarLoop]: === Iteration 91 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:23:04,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1077754907, now seen corresponding path program 1 times [2018-02-04 02:23:04,979 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:23:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:23:04,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:23:06,979 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:06,979 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:23:06,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 02:23:06,980 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:23:06,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:06,980 INFO L182 omatonBuilderFactory]: Interpolants [134470#(= 0 (select |#valid| 0)), 134471#(and (= |#valid| |old(#valid)|) (= 0 (select |#valid| 0))), 134468#true, 134469#false, 134474#(and (= 1 (select |#valid| main_~tree~0.base)) (= main_~tree~0.offset 0) (= (store |#valid| main_~tree~0.base 0) |old(#valid)|) (= 0 (select |#valid| 0))), 134475#(and (= |old(#valid)| (store (store |#valid| main_~tree~0.base 0) |main_#t~malloc3.base| 0)) (= main_~tree~0.offset 0) (not (= 0 main_~tree~0.base)) (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 (select |#valid| 0)) (= 0 |main_#t~malloc3.offset|)), 134472#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|)) (= 0 (select |#valid| 0)) (= |main_#t~malloc0.offset| 0)), 134473#(and (= main_~tree~0.offset 0) (not (= 0 main_~tree~0.base)) (= (store |#valid| main_~tree~0.base 0) |old(#valid)|) (= 0 (select |#valid| 0))), 134478#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.offset 0) (= (select |#valid| (@diff |#valid| (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0))) 1) (or (= (select |#valid| (@diff (store |#valid| (@diff |#valid| (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0)) (select (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (@diff |#valid| (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0)))) (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0))) 1) (= (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (store |#valid| (@diff |#valid| (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0)) (select (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (@diff |#valid| (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0)))))) (= 0 (select |#valid| 0)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) |old(#valid)|)), 134479#(and (= main_~tree~0.offset 0) (not (= |main_#t~malloc9.base| main_~tree~0.base)) (not (= 0 main_~tree~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (= 0 (select |#valid| 0)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= |main_#t~malloc9.base| 0)) (or (= |old(#valid)| (store (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) |main_#t~malloc9.base| 0)) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~malloc9.base|))), 134476#(and (= main_~tree~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (= 0 (select |#valid| 0)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1) (= (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) |old(#valid)|)), 134477#(and (= 1 (select |#valid| main_~tree~0.base)) (= main_~tree~0.offset 0) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 (select |#valid| 0)) (= (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) |old(#valid)|)), 134482#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0) 0)) (= main_~tree~0.offset 0) (not (= 0 main_~tree~0.base)) (or (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.base) (= |old(#valid)| (store (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0) 0)) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0))) (= 0 (select |#valid| 0)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0)))), 134483#(and (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= 0 (select |#valid| 0)) (= main_~tmp~0.offset 0) (not (= 0 main_~tmp~0.base)) (or (= (store (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0) 0) |old(#valid)|) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0) 0))), 134480#(and (= main_~tree~0.offset 0) (not (= 0 main_~tree~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (= 0 (select |#valid| 0)) (not (= main_~tmpList~0.base 0)) (not (= main_~tree~0.base main_~tmpList~0.base)) (or (= (store (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) main_~tmpList~0.base 0) |old(#valid)|) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 134481#(and (= main_~tree~0.offset 0) (not (= 0 main_~tree~0.base)) (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 (select |#valid| 0)) (not (= main_~tmpList~0.base 0)) (not (= main_~tree~0.base main_~tmpList~0.base)) (or (= (store (store (store |#valid| main_~tree~0.base 0) (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) main_~tmpList~0.base 0) |old(#valid)|) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tmpList~0.base)) (not (= main_~tree~0.base |main_#t~mem13.base|))), 134486#(and (or (= (store (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0) 0) |old(#valid)|) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select |#valid| 0)) (= main_~tmp~0.offset 0) (not (= 0 main_~tmp~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0) 0))), 134487#(and (or (= (store (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0) 0) |old(#valid)|) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= |main_#t~mem57.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select |#valid| 0)) (= main_~tmp~0.offset 0) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (not (= 0 main_~tmp~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0) 0))), 134484#(and (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= 0 (select |#valid| 0)) (= main_~tmp~0.offset 0) (not (= 0 main_~tmp~0.base)) (or (= (store (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0) 0) |old(#valid)|) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0) 0)) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 0) |main_#t~mem47.base|)), 134485#(or |main_#t~short49| (and (or (= (store (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0) 0) |old(#valid)|) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select |#valid| 0)) (= main_~tmp~0.offset 0) (not (= 0 main_~tmp~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0) 0)))), 134490#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (or (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (and (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= (store (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0) 0) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmp~0.offset 0) (not (= 0 main_~tmp~0.base)) (not (= (select |#valid| 0) 1)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0) 0))), 134491#(and (= |main_#t~mem59.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (or (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (not (= (select (select |#memory_$Pointer$.offset| |main_#t~mem59.base|) |main_#t~mem59.offset|) 0)) (and (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem59.base|) |main_#t~mem59.offset|) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (store (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) (select (select |#memory_$Pointer$.base| |main_#t~mem59.base|) |main_#t~mem59.offset|) 0) |old(#valid)|))) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 0) main_~tmp~0.base)) (= |main_#t~mem59.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (or (and (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (or (not (= main_~tmp~0.offset |main_#t~mem59.offset|)) (and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem59.base|) |main_#t~mem59.offset|)) (not (= (select |#valid| 0) 1))))) (not (= |main_#t~mem59.base| main_~tmp~0.base))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= 0 main_~tmp~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0) 0))), 134488#(or (not (= 1 (select |#valid| |main_#t~mem56.base|))) (and (or (= (store (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0) 0) |old(#valid)|) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= |main_#t~mem56.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= (select |#valid| 0) (select |#valid| |main_#t~mem56.base|))) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 0) main_~tmp~0.base)) (= |main_#t~mem57.offset| |main_#t~mem56.offset|) (= main_~tmp~0.offset 0) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem56.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0) 0)))), 134489#(and (or (= (store (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0) 0) |old(#valid)|) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmp~0.offset 0) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (not (= 0 main_~tmp~0.base)) (not (= (select |#valid| 0) 1)) (= |main_#t~mem58.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0) 0)) (or (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (and (= |main_#t~mem57.offset| 0) (= |main_#t~mem58.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))))), 134494#(and (or (= main_~tmp~0.base |main_#t~mem61.base|) (and (or (not (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmpList~0.base 0))) (or (<= (+ main_~tmpList~0.offset 1) 0) (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (<= 1 main_~tmpList~0.offset) (and (not (= main_~tmpList~0.base main_~tmp~0.base)) (= (store (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) main_~tmpList~0.base (select (store |#valid| main_~tmpList~0.base 0) main_~tmpList~0.base)) |old(#valid)|) (not (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= |main_#t~mem61.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= 0 main_~tmp~0.base)))) (or (not (= main_~tmp~0.base |main_#t~mem61.base|)) (and (or (= (+ main_~tmp~0.offset 8) |main_#t~mem61.offset|) (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (not (= (select |#valid| main_~tmpList~0.base) 1))) (or (and (= (+ main_~tmp~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmpList~0.offset)) (= main_~tmpList~0.base main_~tmp~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (not (= (+ main_~tmp~0.offset 8) |main_#t~mem61.offset|)))))), 134495#(and (or (and (or (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (<= 1 main_~tmpList~0.offset) (and (not (= main_~tmpList~0.base main_~tmp~0.base)) (= (store (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) main_~tmpList~0.base (select (store |#valid| main_~tmpList~0.base 0) main_~tmpList~0.base)) |old(#valid)|) (not (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= |main_#t~mem61.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (or (not (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmpList~0.base 0))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= 0 main_~tmp~0.base))) (= main_~tmp~0.base |main_#t~mem61.base|)) (or (not (= main_~tmp~0.base |main_#t~mem61.base|)) (and (= 1 (select |#valid| main_~tmpList~0.base)) (or (and (= (+ main_~tmp~0.offset 8) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmpList~0.offset)) (= main_~tmpList~0.base main_~tmp~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= |main_#t~mem63.offset| (select (select |#memory_$Pointer$.offset| main_~tmpList~0.base) main_~tmpList~0.offset))) (not (= (+ main_~tmp~0.offset 8) |main_#t~mem61.offset|))) (or (= (+ main_~tmp~0.offset 8) |main_#t~mem61.offset|) (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)))))), 134492#(and (or (not (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= |main_#t~mem60.base| 0))) (or (not (= |main_#t~mem60.offset| 0)) (and (not (= main_~tmp~0.base |main_#t~mem60.base|)) (not (= |main_#t~mem60.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= |old(#valid)| (store (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) |main_#t~mem60.base| 0))) (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0))) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 0) main_~tmp~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= |main_#t~mem60.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= 0 main_~tmp~0.base)) (or (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) main_~tmp~0.base)) (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0))) (= |main_#t~mem60.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 134493#(and (or (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) main_~tmp~0.base)) (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (not (= (select |#valid| main_~tmpList~0.base) 1))) (or (<= (+ main_~tmpList~0.offset 1) 0) (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (<= 1 main_~tmpList~0.offset) (and (or (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= (store (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) main_~tmpList~0.base (select (store |#valid| main_~tmpList~0.base 0) main_~tmpList~0.base)) |old(#valid)|)) (not (= main_~tmpList~0.base main_~tmp~0.base)) (not (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) 0) main_~tmp~0.base)) (or (not (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmpList~0.base 0))) (= main_~tmpList~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= 0 main_~tmp~0.base))), 134498#(or (and (= (store (store |#valid| main_~tmp~0.base 0) |main_#t~mem64.base| (select (store |#valid| |main_#t~mem64.base| 0) |main_#t~mem64.base|)) |old(#valid)|) (not (= 0 |main_#t~mem64.base|)) (not (= 0 main_~tmp~0.base)) (not (= |main_#t~mem64.base| main_~tmp~0.base))) (not (= 0 |main_#t~mem64.offset|))), 134499#(and (= (store |#valid| main_~tmp~0.base 0) |old(#valid)|) (not (= 0 main_~tmp~0.base))), 134496#(or (and (or (not (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmpList~0.base 0))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= 0 main_~tmp~0.base)) (or (not (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (<= 1 main_~tmpList~0.offset) (and (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmpList~0.base main_~tmp~0.base)) (= (store (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) main_~tmpList~0.base (select (store |#valid| main_~tmpList~0.base 0) main_~tmpList~0.base)) |old(#valid)|) (not (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))))) (and (not (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= 1 (select |#valid| main_~tmpList~0.base)))), 134497#(or (not (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (and (= |old(#valid)| (store (store |#valid| main_~tmp~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= 0 main_~tmp~0.base)))), 134500#(= |#valid| |old(#valid)|)] [2018-02-04 02:23:06,980 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:06,980 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 02:23:06,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 02:23:06,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=966, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 02:23:06,981 INFO L87 Difference]: Start difference. First operand 1340 states and 1740 transitions. Second operand 33 states. [2018-02-04 02:23:08,179 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 74 DAG size of output 73 [2018-02-04 02:23:08,480 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 77 DAG size of output 76 [2018-02-04 02:23:08,696 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 83 DAG size of output 80 [2018-02-04 02:23:08,875 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 80 DAG size of output 77 [2018-02-04 02:23:09,962 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 102 DAG size of output 74 [2018-02-04 02:23:11,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:23:11,041 INFO L93 Difference]: Finished difference Result 1357 states and 1757 transitions. [2018-02-04 02:23:11,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 02:23:11,041 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 69 [2018-02-04 02:23:11,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:23:11,042 INFO L225 Difference]: With dead ends: 1357 [2018-02-04 02:23:11,042 INFO L226 Difference]: Without dead ends: 1319 [2018-02-04 02:23:11,042 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=368, Invalid=3792, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 02:23:11,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2018-02-04 02:23:11,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1312. [2018-02-04 02:23:11,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1312 states. [2018-02-04 02:23:11,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1711 transitions. [2018-02-04 02:23:11,048 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1711 transitions. Word has length 69 [2018-02-04 02:23:11,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:23:11,048 INFO L432 AbstractCegarLoop]: Abstraction has 1312 states and 1711 transitions. [2018-02-04 02:23:11,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 02:23:11,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1711 transitions. [2018-02-04 02:23:11,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 02:23:11,048 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:23:11,048 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] [2018-02-04 02:23:11,048 INFO L371 AbstractCegarLoop]: === Iteration 92 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:23:11,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1042726741, now seen corresponding path program 2 times [2018-02-04 02:23:11,049 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:23:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:23:11,055 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:23:11,331 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:11,331 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:23:11,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 02:23:11,331 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:23:11,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:11,331 INFO L182 omatonBuilderFactory]: Interpolants [137250#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem51.base|) |main_#t~mem51.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem51.base|) |main_#t~mem51.offset|))), 137251#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))), 137248#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) 0)) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) |main_#t~mem50.offset|)), 137249#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)))), 137252#(and (= |main_#t~mem50.base| 0) (= 0 |main_#t~mem50.offset|)), 137234#true, 137235#false, 137238#(and (= 0 |main_#t~malloc25.offset|) (not (= main_~tmp~0.base |main_#t~malloc25.base|)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 137239#(and (= main_~newNode~0.offset 0) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 137236#(= (select |#valid| main_~tree~0.base) 1), 137237#(and (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 137242#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|) main_~newNode~0.offset)) (not (= main_~newNode~0.base |main_#t~malloc35.base|)) (= main_~newNode~0.offset 0) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|) main_~newNode~0.offset)) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 137243#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= main_~newNode~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset))), 137240#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~tree~0.base) 1) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset))), 137241#(and (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~newNode~0.base) 1) (= 0 (select (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0) main_~newNode~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0) main_~newNode~0.offset)) (= (select |#valid| main_~tree~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0)) main_~tree~0.base) main_~tree~0.offset))), 137246#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) 0))), 137247#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) 0))), 137244#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= |main_#t~mem37.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base |main_#t~mem37.base|)) (= main_~newNode~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset))), 137245#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset)) 0)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset)) 0)))] [2018-02-04 02:23:11,332 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:11,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 02:23:11,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 02:23:11,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-02-04 02:23:11,332 INFO L87 Difference]: Start difference. First operand 1312 states and 1711 transitions. Second operand 19 states. [2018-02-04 02:23:13,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:23:13,094 INFO L93 Difference]: Finished difference Result 2506 states and 3162 transitions. [2018-02-04 02:23:13,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 02:23:13,094 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 70 [2018-02-04 02:23:13,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:23:13,096 INFO L225 Difference]: With dead ends: 2506 [2018-02-04 02:23:13,096 INFO L226 Difference]: Without dead ends: 2500 [2018-02-04 02:23:13,096 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=353, Invalid=1369, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 02:23:13,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500 states. [2018-02-04 02:23:13,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 1316. [2018-02-04 02:23:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1316 states. [2018-02-04 02:23:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1715 transitions. [2018-02-04 02:23:13,107 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1715 transitions. Word has length 70 [2018-02-04 02:23:13,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:23:13,107 INFO L432 AbstractCegarLoop]: Abstraction has 1316 states and 1715 transitions. [2018-02-04 02:23:13,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 02:23:13,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1715 transitions. [2018-02-04 02:23:13,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 02:23:13,108 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:23:13,108 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] [2018-02-04 02:23:13,108 INFO L371 AbstractCegarLoop]: === Iteration 93 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:23:13,108 INFO L82 PathProgramCache]: Analyzing trace with hash 628481191, now seen corresponding path program 1 times [2018-02-04 02:23:13,108 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:23:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:23:13,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:23:13,137 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:23:13,137 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:23:13,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 02:23:13,137 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:23:13,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-04 02:23:13,138 INFO L182 omatonBuilderFactory]: Interpolants [141122#false, 141123#(and (= main_~tmp~0.offset main_~pred~0.offset) (= main_~tmp~0.base main_~pred~0.base)), 141121#true, 141126#(and (= |main_#t~mem53.base| main_~tmp~0.base) (= |main_#t~mem53.offset| main_~tmp~0.offset)), 141124#(and (= |main_#t~mem51.base| (select (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset)) (= |main_#t~mem51.offset| (select (select |#memory_$Pointer$.offset| main_~pred~0.base) main_~pred~0.offset))), 141125#(and (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset)) (= main_~tmp~0.offset (select (select |#memory_$Pointer$.offset| main_~pred~0.base) main_~pred~0.offset)))] [2018-02-04 02:23:13,138 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:23:13,138 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:23:13,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:23:13,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:23:13,138 INFO L87 Difference]: Start difference. First operand 1316 states and 1715 transitions. Second operand 6 states. [2018-02-04 02:23:13,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:23:13,306 INFO L93 Difference]: Finished difference Result 1410 states and 1835 transitions. [2018-02-04 02:23:13,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:23:13,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-02-04 02:23:13,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:23:13,307 INFO L225 Difference]: With dead ends: 1410 [2018-02-04 02:23:13,307 INFO L226 Difference]: Without dead ends: 1410 [2018-02-04 02:23:13,307 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:23:13,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2018-02-04 02:23:13,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1352. [2018-02-04 02:23:13,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-02-04 02:23:13,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1773 transitions. [2018-02-04 02:23:13,314 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1773 transitions. Word has length 70 [2018-02-04 02:23:13,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:23:13,314 INFO L432 AbstractCegarLoop]: Abstraction has 1352 states and 1773 transitions. [2018-02-04 02:23:13,314 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:23:13,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1773 transitions. [2018-02-04 02:23:13,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-04 02:23:13,314 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:23:13,314 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] [2018-02-04 02:23:13,314 INFO L371 AbstractCegarLoop]: === Iteration 94 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:23:13,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1975611684, now seen corresponding path program 1 times [2018-02-04 02:23:13,315 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:23:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:23:13,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:23:13,336 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:23:13,336 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:23:13,336 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 02:23:13,336 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:23:13,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:13,337 INFO L182 omatonBuilderFactory]: Interpolants [143894#false, 143895#(not (= 0 |main_#t~malloc0.base|)), 143893#true, 143898#(not (= 0 main_~pred~0.base)), 143896#(not (= 0 main_~tree~0.base)), 143897#(not (= 0 main_~tmp~0.base))] [2018-02-04 02:23:13,337 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:23:13,337 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:23:13,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:23:13,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:23:13,337 INFO L87 Difference]: Start difference. First operand 1352 states and 1773 transitions. Second operand 6 states. [2018-02-04 02:23:13,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:23:13,446 INFO L93 Difference]: Finished difference Result 1479 states and 1882 transitions. [2018-02-04 02:23:13,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 02:23:13,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-02-04 02:23:13,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:23:13,447 INFO L225 Difference]: With dead ends: 1479 [2018-02-04 02:23:13,447 INFO L226 Difference]: Without dead ends: 1479 [2018-02-04 02:23:13,447 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:23:13,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2018-02-04 02:23:13,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1333. [2018-02-04 02:23:13,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2018-02-04 02:23:13,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1739 transitions. [2018-02-04 02:23:13,455 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1739 transitions. Word has length 71 [2018-02-04 02:23:13,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:23:13,455 INFO L432 AbstractCegarLoop]: Abstraction has 1333 states and 1739 transitions. [2018-02-04 02:23:13,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:23:13,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1739 transitions. [2018-02-04 02:23:13,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 02:23:13,456 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:23:13,456 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:23:13,456 INFO L371 AbstractCegarLoop]: === Iteration 95 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:23:13,456 INFO L82 PathProgramCache]: Analyzing trace with hash -486519114, now seen corresponding path program 1 times [2018-02-04 02:23:13,457 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:23:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:23:13,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:23:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:13,885 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:23:13,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 02:23:13,885 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:23:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:13,885 INFO L182 omatonBuilderFactory]: Interpolants [146722#false, 146723#(= 0 |main_#t~malloc0.offset|), 146721#true, 146726#(and (= main_~tree~0.offset 0) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 146727#(and (= 0 |main_#t~malloc25.offset|) (= main_~tree~0.offset 0) (not (= main_~tmp~0.base |main_#t~malloc25.base|)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 146724#(= main_~tree~0.offset 0), 146725#(and (= main_~tree~0.offset 0) (= (select |#valid| main_~tree~0.base) 1)), 146730#(and (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~newNode~0.base) 1) (= (select |#valid| main_~tree~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0)) main_~tree~0.base) main_~tree~0.offset))), 146731#(and (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4))) (= main_~newNode~0.offset 0) (= (select |#valid| main_~newNode~0.base) 1) (= (select |#valid| main_~tree~0.base) 1)), 146728#(and (= main_~tree~0.offset 0) (= main_~newNode~0.offset 0) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 146729#(and (= main_~tree~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~tree~0.base) 1) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset))), 146734#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 4))) (not (= |main_#t~mem37.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base |main_#t~mem37.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4))) (= main_~newNode~0.offset 0)), 146735#(and (= main_~tree~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 4)))), 146732#(and (= main_~tree~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|) (+ main_~newNode~0.offset 4))) (not (= main_~newNode~0.base |main_#t~malloc35.base|)) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) main_~tree~0.offset)) (= main_~newNode~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|) (+ main_~newNode~0.offset 4))) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 146733#(and (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 4))) (not (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4))) (= main_~newNode~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 146738#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem51.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem51.base|) (+ 0 4))) (= 0 |main_#t~mem51.offset|)), 146739#(or (<= (+ main_~tmp~0.offset 1) 0) (and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4))))), 146736#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 4)))), 146737#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 4)))), 146742#(not |main_#t~short49|), 146740#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))), 146741#(and (= 0 |main_#t~mem48.base|) (= 0 |main_#t~mem48.offset|))] [2018-02-04 02:23:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:13,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 02:23:13,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 02:23:13,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:23:13,886 INFO L87 Difference]: Start difference. First operand 1333 states and 1739 transitions. Second operand 22 states. [2018-02-04 02:23:15,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:23:15,808 INFO L93 Difference]: Finished difference Result 2444 states and 3106 transitions. [2018-02-04 02:23:15,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 02:23:15,808 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 72 [2018-02-04 02:23:15,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:23:15,810 INFO L225 Difference]: With dead ends: 2444 [2018-02-04 02:23:15,810 INFO L226 Difference]: Without dead ends: 2444 [2018-02-04 02:23:15,810 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=578, Invalid=2284, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 02:23:15,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2444 states. [2018-02-04 02:23:15,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2444 to 1333. [2018-02-04 02:23:15,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2018-02-04 02:23:15,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1738 transitions. [2018-02-04 02:23:15,820 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1738 transitions. Word has length 72 [2018-02-04 02:23:15,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:23:15,820 INFO L432 AbstractCegarLoop]: Abstraction has 1333 states and 1738 transitions. [2018-02-04 02:23:15,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 02:23:15,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1738 transitions. [2018-02-04 02:23:15,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 02:23:15,821 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:23:15,821 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:23:15,821 INFO L371 AbstractCegarLoop]: === Iteration 96 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:23:15,821 INFO L82 PathProgramCache]: Analyzing trace with hash 571499274, now seen corresponding path program 1 times [2018-02-04 02:23:15,821 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:23:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:23:15,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:23:16,413 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-04 02:23:16,413 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:23:16,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 02:23:16,413 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:23:16,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:16,414 INFO L182 omatonBuilderFactory]: Interpolants [150594#(and (= main_~tree~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset) (= main_~tmp~0.offset 0) (not (= main_~tree~0.base |main_#t~malloc25.base|)) (= main_~tmp~0.base main_~tree~0.base)), 150595#(and (= main_~tree~0.offset 0) (= main_~tmp~0.offset 0) (= (select (store (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.offset) (+ main_~tree~0.offset 8)) main_~tree~0.offset) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base)), 150592#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 150593#(and (= main_~tree~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset) (= main_~tmp~0.offset 0) (= (select |#valid| main_~tree~0.base) 1) (= main_~tree~0.base main_~tmp~0.base)), 150598#(and (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= (select |#valid| main_~newNode~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 150599#(and (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 1 (select |#valid| main_~newNode~0.base)) (not (= |main_#t~mem37.base| main_~tree~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 150596#(and (= (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset) (= main_~tree~0.offset 0) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select |#valid| main_~tree~0.base) 1) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset))), 150597#(and (= main_~tree~0.offset 0) (= (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 150602#(and (= main_~tree~0.offset 0) (or (not (= main_~tree~0.base |main_#t~malloc41.base|)) (= 4 (select |#length| main_~tree~0.base))) (or (= |main_#t~malloc41.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 150603#(and (= main_~tree~0.offset 0) (or (not (= main_~tree~0.base main_~tmpList~0.base)) (= 4 (select |#length| main_~tree~0.base))) (or (= main_~tree~0.base main_~tmpList~0.base) (and (or (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)))), 150600#(and (= main_~tree~0.offset 0) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset))) (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 150601#(and (= main_~tree~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 150606#(and (= main_~tree~0.offset 0) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem45.base| (store (select |#memory_$Pointer$.base| |main_#t~mem45.base|) |main_#t~mem45.offset| main_~tmpList~0.base)) main_~tree~0.base) main_~tree~0.offset))) (or (and (= |main_#t~mem45.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~mem45.base|))) (not (= main_~tree~0.base main_~tmpList~0.base))), 150607#(and (= main_~tree~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)))), 150604#(and (= main_~tree~0.offset 0) (or (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 150605#(and (= main_~tree~0.offset 0) (= 1 (select |#valid| main_~tmpList~0.base)) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 150610#(= (select |#valid| main_~tmp~0.base) 1), 150608#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))), 150609#(= 1 (select |#valid| |main_#t~mem20.base|)), 150586#(= 0 |main_#t~malloc0.offset|), 150587#(= 0 main_~tree~0.offset), 150584#true, 150585#false, 150590#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 150591#(and (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 150588#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 150589#(and (= |main_#t~malloc3.offset| main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 main_~tree~0.offset))] [2018-02-04 02:23:16,414 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-04 02:23:16,414 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 02:23:16,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 02:23:16,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2018-02-04 02:23:16,414 INFO L87 Difference]: Start difference. First operand 1333 states and 1738 transitions. Second operand 27 states. [2018-02-04 02:23:19,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:23:19,768 INFO L93 Difference]: Finished difference Result 2271 states and 2893 transitions. [2018-02-04 02:23:19,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 02:23:19,769 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 72 [2018-02-04 02:23:19,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:23:19,770 INFO L225 Difference]: With dead ends: 2271 [2018-02-04 02:23:19,771 INFO L226 Difference]: Without dead ends: 2271 [2018-02-04 02:23:19,771 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1316 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1489, Invalid=4061, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 02:23:19,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2271 states. [2018-02-04 02:23:19,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2271 to 1502. [2018-02-04 02:23:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1502 states. [2018-02-04 02:23:19,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 1970 transitions. [2018-02-04 02:23:19,781 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 1970 transitions. Word has length 72 [2018-02-04 02:23:19,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:23:19,781 INFO L432 AbstractCegarLoop]: Abstraction has 1502 states and 1970 transitions. [2018-02-04 02:23:19,781 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 02:23:19,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1970 transitions. [2018-02-04 02:23:19,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 02:23:19,782 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:23:19,782 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:23:19,782 INFO L371 AbstractCegarLoop]: === Iteration 97 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:23:19,782 INFO L82 PathProgramCache]: Analyzing trace with hash 571499275, now seen corresponding path program 1 times [2018-02-04 02:23:19,783 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:23:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:23:19,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:23:20,532 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-04 02:23:20,533 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:23:20,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 02:23:20,533 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:23:20,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:20,533 INFO L182 omatonBuilderFactory]: Interpolants [154498#(and (= main_~tree~0.offset 0) (= 0 |main_#t~malloc41.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= 4 (select |#length| |main_#t~malloc41.base|)) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 154499#(and (= main_~tree~0.offset 0) (or (not (= main_~tree~0.base main_~tmpList~0.base)) (= 4 (select |#length| main_~tree~0.base))) (or (and (= 0 main_~tmpList~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= 4 (select |#length| main_~tmpList~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)) (= main_~tree~0.base main_~tmpList~0.base))), 154496#(and (= main_~tree~0.offset 0) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset)) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) main_~tree~0.offset)) (<= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset))) (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 154497#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) 1) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 154502#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (or (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))))), 154503#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (or (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))))), 154500#(and (= main_~tree~0.offset 0) (= 0 main_~tmpList~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 4 (select |#length| main_~tmpList~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 154501#(and (or (= 0 main_~tmpList~0.offset) (not (= main_~tree~0.base |main_#t~mem45.base|))) (= main_~tree~0.offset 0) (or (<= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem45.base| (store (select |#memory_$Pointer$.base| |main_#t~mem45.base|) |main_#t~mem45.offset| main_~tmpList~0.base)) main_~tree~0.base) main_~tree~0.offset))) (= main_~tree~0.base |main_#t~mem45.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base main_~tmpList~0.base)) (or (not (= main_~tree~0.base |main_#t~mem45.base|)) (and (= |main_#t~mem45.offset| main_~tree~0.offset) (= 4 (select |#length| main_~tmpList~0.base))))), 154506#(and (= main_~tmp~0.offset 0) (or (<= 12 (select |#length| main_~tmp~0.base)) (= 4 (select |#length| main_~tmp~0.base)))), 154504#(and (or (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))) (= |main_#t~mem16.offset| 0) (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset))), 154505#(and (= 0 |main_#t~mem20.offset|) (or (<= 12 (select |#length| |main_#t~mem20.base|)) (= 4 (select |#length| |main_#t~mem20.base|)))), 154482#(= 0 |main_#t~malloc0.offset|), 154483#(= 0 main_~tree~0.offset), 154480#true, 154481#false, 154486#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 154487#(and (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 154484#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 154485#(and (= |main_#t~malloc3.offset| main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 main_~tree~0.offset)), 154490#(and (= 0 |main_#t~malloc25.offset|) (= main_~tree~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~malloc25.base|)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 154491#(and (= main_~tree~0.offset 0) (= (select (store (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.offset) (+ main_~tree~0.offset 8)) main_~tree~0.offset) (= main_~newNode~0.offset 0) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 154488#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 154489#(and (= main_~tree~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 154494#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (<= (+ main_~newNode~0.offset 12) (select |#length| main_~newNode~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~newNode~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 154495#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (not (= |main_#t~mem37.base| main_~tree~0.base)) (<= (+ main_~newNode~0.offset 12) (select |#length| main_~newNode~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~newNode~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 154492#(and (= main_~tree~0.offset 0) (= (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~tree~0.base) 1) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset))), 154493#(and (= main_~tree~0.offset 0) (= (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset) (= main_~newNode~0.offset 0) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~malloc35.base|)))] [2018-02-04 02:23:20,533 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-04 02:23:20,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 02:23:20,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 02:23:20,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2018-02-04 02:23:20,534 INFO L87 Difference]: Start difference. First operand 1502 states and 1970 transitions. Second operand 27 states. [2018-02-04 02:23:26,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:23:26,179 INFO L93 Difference]: Finished difference Result 2736 states and 3461 transitions. [2018-02-04 02:23:26,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-02-04 02:23:26,180 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 72 [2018-02-04 02:23:26,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:23:26,182 INFO L225 Difference]: With dead ends: 2736 [2018-02-04 02:23:26,182 INFO L226 Difference]: Without dead ends: 2736 [2018-02-04 02:23:26,182 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2473 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2294, Invalid=7018, Unknown=0, NotChecked=0, Total=9312 [2018-02-04 02:23:26,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2018-02-04 02:23:26,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 1684. [2018-02-04 02:23:26,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1684 states. [2018-02-04 02:23:26,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2220 transitions. [2018-02-04 02:23:26,194 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2220 transitions. Word has length 72 [2018-02-04 02:23:26,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:23:26,195 INFO L432 AbstractCegarLoop]: Abstraction has 1684 states and 2220 transitions. [2018-02-04 02:23:26,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 02:23:26,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2220 transitions. [2018-02-04 02:23:26,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 02:23:26,195 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:23:26,195 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:23:26,195 INFO L371 AbstractCegarLoop]: === Iteration 98 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:23:26,196 INFO L82 PathProgramCache]: Analyzing trace with hash 577224912, now seen corresponding path program 1 times [2018-02-04 02:23:26,196 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:23:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:23:26,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:23:26,829 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:26,829 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:23:26,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 02:23:26,829 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:23:26,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:26,830 INFO L182 omatonBuilderFactory]: Interpolants [159067#true, 159070#(= 0 main_~tree~0.offset), 159071#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 159068#false, 159069#(= 0 |main_#t~malloc0.offset|), 159074#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 159075#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 159072#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 159073#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.base|) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.offset|) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset)), 159078#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (not (= main_~tree~0.base (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.base) (+ main_~tree~0.offset 8)))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.offset) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base) (= 0 (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.base) (+ main_~tree~0.offset 4)))), 159079#(and (= 0 (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~newNode~0.base main_~tree~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 159076#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= (select |#valid| main_~tree~0.base) 1) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tree~0.base main_~tmp~0.base)), 159077#(and (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~malloc25.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tree~0.base main_~tmp~0.base)), 159082#(and (not (= |main_#t~mem37.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 159083#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 4)))), 159080#(and (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 159081#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 159086#(and (= main_~tree~0.offset 0) (or (= main_~tree~0.base main_~tmpList~0.base) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))) (or (not (= main_~tree~0.base main_~tmpList~0.base)) (= 4 (select |#length| main_~tree~0.base)))), 159087#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 159084#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 159085#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (or (not (= main_~tree~0.base |main_#t~malloc41.base|)) (= 4 (select |#length| main_~tree~0.base))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 159090#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= main_~tmp~0.offset 0)), 159091#(and (= 0 |main_#t~mem17.base|) (= main_~tmp~0.offset 0) (= |main_#t~mem17.offset| 0)), 159088#(and (= main_~tree~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem45.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem45.base|) |main_#t~mem45.offset| main_~tmpList~0.offset)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem45.base| (store (select |#memory_$Pointer$.base| |main_#t~mem45.base|) |main_#t~mem45.offset| main_~tmpList~0.base)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~mem45.base|))), 159089#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))), 159092#(and (= main_~tmp~0.offset 0) (not |main_#t~short18|))] [2018-02-04 02:23:26,830 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:26,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 02:23:26,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 02:23:26,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2018-02-04 02:23:26,830 INFO L87 Difference]: Start difference. First operand 1684 states and 2220 transitions. Second operand 26 states. [2018-02-04 02:23:30,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:23:30,049 INFO L93 Difference]: Finished difference Result 2384 states and 3083 transitions. [2018-02-04 02:23:30,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 02:23:30,049 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 72 [2018-02-04 02:23:30,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:23:30,051 INFO L225 Difference]: With dead ends: 2384 [2018-02-04 02:23:30,051 INFO L226 Difference]: Without dead ends: 2384 [2018-02-04 02:23:30,051 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1206, Invalid=3216, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 02:23:30,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2018-02-04 02:23:30,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 1380. [2018-02-04 02:23:30,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1380 states. [2018-02-04 02:23:30,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 1797 transitions. [2018-02-04 02:23:30,060 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 1797 transitions. Word has length 72 [2018-02-04 02:23:30,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:23:30,060 INFO L432 AbstractCegarLoop]: Abstraction has 1380 states and 1797 transitions. [2018-02-04 02:23:30,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 02:23:30,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1797 transitions. [2018-02-04 02:23:30,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 02:23:30,061 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:23:30,061 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:23:30,061 INFO L371 AbstractCegarLoop]: === Iteration 99 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:23:30,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1268857830, now seen corresponding path program 1 times [2018-02-04 02:23:30,062 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:23:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:23:30,069 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:23:30,661 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:30,661 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:23:30,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 02:23:30,661 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:23:30,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:30,662 INFO L182 omatonBuilderFactory]: Interpolants [162946#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 162947#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 162944#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 162945#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.base|) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.offset|) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset)), 162950#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 162951#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem13.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) |main_#t~mem13.offset| main_~tmpList~0.offset)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= (select |#valid| main_~tree~0.base) 1)), 162948#(and (not (= main_~tree~0.base |main_#t~malloc9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 162949#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 162954#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.offset) (+ main_~tree~0.offset 4))) (< main_~tmp~0.offset (+ main_~tree~0.offset 1)) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= 0 (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.base) (+ main_~tree~0.offset 4)))), 162955#(and (= 0 (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~newNode~0.base main_~tree~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= (select |#valid| main_~tree~0.base) 1)), 162952#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (< main_~tmp~0.offset (+ main_~tree~0.offset 1)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (= (select |#valid| main_~tree~0.base) 1) (= main_~tree~0.base main_~tmp~0.base)), 162953#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (< main_~tmp~0.offset (+ main_~tree~0.offset 1)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~malloc25.base|)) (= main_~tmp~0.base main_~tree~0.base)), 162958#(and (not (= |main_#t~mem37.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))), 162959#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 4)))), 162956#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 162957#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 162962#(and (= 0 |main_#t~mem17.base|) (= |main_#t~mem17.offset| 0)), 162963#(not |main_#t~short18|), 162960#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))), 162961#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))), 162939#true, 162942#(= 0 main_~tree~0.offset), 162943#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 162940#false, 162941#(= 0 |main_#t~malloc0.offset|)] [2018-02-04 02:23:30,662 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:30,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 02:23:30,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 02:23:30,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2018-02-04 02:23:30,662 INFO L87 Difference]: Start difference. First operand 1380 states and 1797 transitions. Second operand 25 states. [2018-02-04 02:23:33,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:23:33,911 INFO L93 Difference]: Finished difference Result 1988 states and 2522 transitions. [2018-02-04 02:23:33,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 02:23:33,911 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 72 [2018-02-04 02:23:33,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:23:33,912 INFO L225 Difference]: With dead ends: 1988 [2018-02-04 02:23:33,912 INFO L226 Difference]: Without dead ends: 1988 [2018-02-04 02:23:33,913 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1298, Invalid=3814, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 02:23:33,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2018-02-04 02:23:33,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1335. [2018-02-04 02:23:33,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1335 states. [2018-02-04 02:23:33,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 1729 transitions. [2018-02-04 02:23:33,920 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 1729 transitions. Word has length 72 [2018-02-04 02:23:33,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:23:33,920 INFO L432 AbstractCegarLoop]: Abstraction has 1335 states and 1729 transitions. [2018-02-04 02:23:33,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 02:23:33,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1729 transitions. [2018-02-04 02:23:33,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 02:23:33,921 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:23:33,921 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] [2018-02-04 02:23:33,921 INFO L371 AbstractCegarLoop]: === Iteration 100 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:23:33,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1272280474, now seen corresponding path program 1 times [2018-02-04 02:23:33,921 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:23:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:23:33,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:23:34,363 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:34,364 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:23:34,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 02:23:34,364 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:23:34,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:34,364 INFO L182 omatonBuilderFactory]: Interpolants [166402#(and (= main_~tree~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)))), 166403#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))), 166400#(and (= main_~tree~0.offset 0) (or (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)))) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 166401#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base |main_#t~mem45.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)))), 166404#(= 1 (select |#valid| |main_#t~mem51.base|)), 166405#(= 1 (select |#valid| main_~tmp~0.base)), 166382#false, 166383#(= 0 |main_#t~malloc0.offset|), 166381#true, 166386#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 main_~tree~0.offset)), 166387#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 166384#(= 0 main_~tree~0.offset), 166385#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 166390#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base |main_#t~malloc25.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 166391#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 166388#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 166389#(and (= main_~tree~0.offset 0) (= (select |#valid| main_~tree~0.base) 1) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 166394#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (= (select |#valid| main_~newNode~0.base) 1) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 166395#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (= 1 (select |#valid| main_~newNode~0.base)) (not (= |main_#t~mem37.base| main_~tree~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 166392#(and (= main_~tree~0.offset 0) (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset))), 166393#(and (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 166398#(and (= main_~tree~0.offset 0) (or (not (= main_~tree~0.base |main_#t~malloc41.base|)) (= 4 (select |#length| main_~tree~0.base))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (or (= |main_#t~malloc41.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))))), 166399#(and (= main_~tree~0.offset 0) (or (= main_~tmpList~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)))) (or (not (= main_~tree~0.base main_~tmpList~0.base)) (= 4 (select |#length| main_~tree~0.base))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 166396#(and (= main_~tree~0.offset 0) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset))) (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))))), 166397#(and (= main_~tree~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))] [2018-02-04 02:23:34,364 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:34,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 02:23:34,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 02:23:34,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2018-02-04 02:23:34,365 INFO L87 Difference]: Start difference. First operand 1335 states and 1729 transitions. Second operand 25 states. [2018-02-04 02:23:36,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:23:36,571 INFO L93 Difference]: Finished difference Result 1863 states and 2389 transitions. [2018-02-04 02:23:36,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 02:23:36,572 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 73 [2018-02-04 02:23:36,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:23:36,573 INFO L225 Difference]: With dead ends: 1863 [2018-02-04 02:23:36,573 INFO L226 Difference]: Without dead ends: 1863 [2018-02-04 02:23:36,573 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=987, Invalid=2795, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 02:23:36,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2018-02-04 02:23:36,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1348. [2018-02-04 02:23:36,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2018-02-04 02:23:36,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1744 transitions. [2018-02-04 02:23:36,582 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1744 transitions. Word has length 73 [2018-02-04 02:23:36,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:23:36,582 INFO L432 AbstractCegarLoop]: Abstraction has 1348 states and 1744 transitions. [2018-02-04 02:23:36,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 02:23:36,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1744 transitions. [2018-02-04 02:23:36,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 02:23:36,583 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:23:36,583 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] [2018-02-04 02:23:36,583 INFO L371 AbstractCegarLoop]: === Iteration 101 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:23:36,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1272280475, now seen corresponding path program 1 times [2018-02-04 02:23:36,583 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:23:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:23:36,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:23:37,293 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:37,293 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:23:37,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 02:23:37,293 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:23:37,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:37,294 INFO L182 omatonBuilderFactory]: Interpolants [169691#true, 169694#(= 0 main_~tree~0.offset), 169695#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 169692#false, 169693#(= 0 |main_#t~malloc0.offset|), 169698#(and (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 169699#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 169696#(and (= |main_#t~malloc3.offset| main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 main_~tree~0.offset)), 169697#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 169702#(and (= main_~tree~0.offset 0) (= (select (store (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.offset) (+ main_~tree~0.offset 8)) main_~tree~0.offset) (= main_~newNode~0.offset 0) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 169703#(and (= main_~tree~0.offset 0) (= (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~tree~0.base) 1) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset))), 169700#(and (= main_~tree~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 169701#(and (= 0 |main_#t~malloc25.offset|) (= main_~tree~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~malloc25.base|)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 169706#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (not (= |main_#t~mem37.base| main_~tree~0.base)) (<= (+ main_~newNode~0.offset 12) (select |#length| main_~newNode~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~newNode~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 169707#(and (= main_~tree~0.offset 0) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset)) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) main_~tree~0.offset)) (<= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset))) (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 169704#(and (= main_~tree~0.offset 0) (= (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset) (= main_~newNode~0.offset 0) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 169705#(and (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (<= (+ main_~newNode~0.offset 12) (select |#length| main_~newNode~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~newNode~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 169710#(and (= main_~tree~0.offset 0) (or (not (= main_~tree~0.base main_~tmpList~0.base)) (= 4 (select |#length| main_~tree~0.base))) (or (and (= 0 main_~tmpList~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= 4 (select |#length| main_~tmpList~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)) (= main_~tree~0.base main_~tmpList~0.base))), 169711#(and (= main_~tree~0.offset 0) (= 0 main_~tmpList~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 4 (select |#length| main_~tmpList~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 169708#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) 1) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 169709#(and (= main_~tree~0.offset 0) (= 0 |main_#t~malloc41.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= 4 (select |#length| |main_#t~malloc41.base|)) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)), 169714#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))))), 169715#(or (and (= 4 (select |#length| |main_#t~mem51.base|)) (= 0 |main_#t~mem51.offset|)) (and (<= 12 (select |#length| |main_#t~mem51.base|)) (= 0 |main_#t~mem51.offset|))), 169712#(and (= main_~tree~0.offset 0) (or (and (<= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem45.base| (store (select |#memory_$Pointer$.base| |main_#t~mem45.base|) |main_#t~mem45.offset| main_~tmpList~0.base)) main_~tree~0.base) main_~tree~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem45.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem45.base|) |main_#t~mem45.offset| main_~tmpList~0.offset)) main_~tree~0.base) main_~tree~0.offset))) (= main_~tree~0.base |main_#t~mem45.base|)) (or (= 4 (select |#length| main_~tmpList~0.base)) (not (= main_~tree~0.base |main_#t~mem45.base|))) (not (= main_~tree~0.base main_~tmpList~0.base)) (or (not (= main_~tree~0.base |main_#t~mem45.base|)) (and (= 0 main_~tmpList~0.offset) (= |main_#t~mem45.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.offset)))), 169713#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (or (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))))), 169716#(or (and (<= 12 (select |#length| main_~tmp~0.base)) (= main_~tmp~0.offset 0)) (and (= main_~tmp~0.offset 0) (= 4 (select |#length| main_~tmp~0.base))))] [2018-02-04 02:23:37,294 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:37,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 02:23:37,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 02:23:37,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2018-02-04 02:23:37,294 INFO L87 Difference]: Start difference. First operand 1348 states and 1744 transitions. Second operand 26 states. [2018-02-04 02:23:42,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:23:42,248 INFO L93 Difference]: Finished difference Result 2244 states and 2820 transitions. [2018-02-04 02:23:42,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 02:23:42,248 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 73 [2018-02-04 02:23:42,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:23:42,249 INFO L225 Difference]: With dead ends: 2244 [2018-02-04 02:23:42,249 INFO L226 Difference]: Without dead ends: 2244 [2018-02-04 02:23:42,250 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1601, Invalid=4561, Unknown=0, NotChecked=0, Total=6162 [2018-02-04 02:23:42,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2244 states. [2018-02-04 02:23:42,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2244 to 1483. [2018-02-04 02:23:42,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1483 states. [2018-02-04 02:23:42,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 1919 transitions. [2018-02-04 02:23:42,259 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 1919 transitions. Word has length 73 [2018-02-04 02:23:42,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:23:42,259 INFO L432 AbstractCegarLoop]: Abstraction has 1483 states and 1919 transitions. [2018-02-04 02:23:42,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 02:23:42,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1919 transitions. [2018-02-04 02:23:42,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 02:23:42,259 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:23:42,259 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:23:42,260 INFO L371 AbstractCegarLoop]: === Iteration 102 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:23:42,260 INFO L82 PathProgramCache]: Analyzing trace with hash -158801347, now seen corresponding path program 1 times [2018-02-04 02:23:42,260 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:23:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:23:42,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:23:42,882 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:42,883 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:23:42,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 02:23:42,883 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:23:42,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:42,883 INFO L182 omatonBuilderFactory]: Interpolants [173570#(and (= main_~tree~0.offset 0) (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 8)) 0)), 173571#(and (= main_~tree~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0)), 173568#(and (= main_~tree~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 173569#(and (= main_~tree~0.offset 0) (not (= |main_#t~mem37.base| main_~tree~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0)), 173574#(and (= 1 (select |#valid| main_~tree~0.base)) (= main_~tree~0.offset 0) (= 0 main_~tmpList~0.offset) (or (= main_~tmpList~0.base main_~tree~0.base) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tmpList~0.offset))), 173575#(and (= main_~tree~0.offset 0) (= |main_#t~mem45.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (or (not (= main_~tree~0.base |main_#t~mem45.base|)) (and (= (select |#valid| main_~tree~0.base) 1) (or (and (= 0 main_~tmpList~0.offset) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tmpList~0.base)) (not (= (+ main_~tree~0.offset 8) |main_#t~mem45.offset|))))) (= |main_#t~mem45.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 173572#(and (= main_~tree~0.offset 0) (= 0 |main_#t~malloc41.offset|) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~malloc41.offset|)), 173573#(and (= main_~tree~0.offset 0) (= 0 main_~tmpList~0.offset) (or (= main_~tmpList~0.base main_~tree~0.base) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tmpList~0.offset))), 173578#(and (<= 0 |main_#t~mem42.offset|) (<= (+ |main_#t~mem42.offset| 4) (select |#length| |main_#t~mem42.base|))), 173576#(and (= main_~tree~0.offset 0) (<= (+ (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 173577#(and (= main_~tree~0.offset 0) (<= (+ (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 173550#true, 173551#false, 173554#(and (= 1 (select |#valid| main_~tree~0.base)) (= main_~tree~0.offset 0)), 173555#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= |main_#t~malloc3.offset| 0)), 173552#(= |main_#t~malloc0.offset| 0), 173553#(= main_~tree~0.offset 0), 173558#(and (= main_~tree~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 173559#(and (= main_~tree~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 173556#(and (= main_~tree~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 173557#(and (= main_~tree~0.offset 0) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= (select |#valid| main_~tree~0.base) 1)), 173562#(and (= main_~tree~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (= (select |#valid| main_~tree~0.base) 1)), 173563#(and (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8)) 0) (= main_~tree~0.offset 0) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= (select |#valid| main_~tree~0.base) 1) (= main_~tree~0.base main_~tmp~0.base)), 173560#(and (= main_~tree~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 173561#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= (select |#valid| main_~tree~0.base) 1) (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem13.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) |main_#t~mem13.offset| main_~tmpList~0.offset)) main_~tree~0.base) (+ main_~tree~0.offset 8)) 0)), 173566#(and (= main_~tree~0.offset 0) (not (= main_~newNode~0.base main_~tree~0.base)) (= (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (= (select |#valid| main_~tree~0.base) 1)), 173567#(and (= main_~tree~0.offset 0) (= (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 173564#(and (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8)) 0) (= main_~tree~0.offset 0) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (not (= main_~tree~0.base |main_#t~malloc25.base|)) (= main_~tree~0.base main_~tmp~0.base)), 173565#(and (= main_~tree~0.offset 0) (not (= (+ main_~tree~0.offset 8) main_~tmp~0.offset)) (= (select (store (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.offset) (+ main_~tree~0.offset 8)) 0) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base))] [2018-02-04 02:23:42,883 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:42,884 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 02:23:42,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 02:23:42,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2018-02-04 02:23:42,884 INFO L87 Difference]: Start difference. First operand 1483 states and 1919 transitions. Second operand 29 states. [2018-02-04 02:23:47,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:23:47,199 INFO L93 Difference]: Finished difference Result 3511 states and 4481 transitions. [2018-02-04 02:23:47,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-02-04 02:23:47,199 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 73 [2018-02-04 02:23:47,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:23:47,201 INFO L225 Difference]: With dead ends: 3511 [2018-02-04 02:23:47,201 INFO L226 Difference]: Without dead ends: 3511 [2018-02-04 02:23:47,201 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2141 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2037, Invalid=6335, Unknown=0, NotChecked=0, Total=8372 [2018-02-04 02:23:47,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3511 states. [2018-02-04 02:23:47,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3511 to 1653. [2018-02-04 02:23:47,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1653 states. [2018-02-04 02:23:47,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2152 transitions. [2018-02-04 02:23:47,214 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2152 transitions. Word has length 73 [2018-02-04 02:23:47,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:23:47,214 INFO L432 AbstractCegarLoop]: Abstraction has 1653 states and 2152 transitions. [2018-02-04 02:23:47,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 02:23:47,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2152 transitions. [2018-02-04 02:23:47,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-04 02:23:47,215 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:23:47,215 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] [2018-02-04 02:23:47,215 INFO L371 AbstractCegarLoop]: === Iteration 103 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:23:47,215 INFO L82 PathProgramCache]: Analyzing trace with hash 2146711787, now seen corresponding path program 1 times [2018-02-04 02:23:47,215 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:23:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:23:47,222 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:23:47,540 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:47,540 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:23:47,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 02:23:47,540 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:23:47,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:47,541 INFO L182 omatonBuilderFactory]: Interpolants [178882#(and (= main_~tree~0.offset 0) (= |main_#t~mem37.base| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset)))), 178883#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8))))), 178880#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (not (= main_~tree~0.base main_~newNode~0.base)) (not (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= main_~newNode~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 178881#(and (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base main_~newNode~0.base)) (not (= |main_#t~mem37.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base |main_#t~mem37.base|)) (= main_~newNode~0.offset 0) (= |main_#t~mem37.base| (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))), 178886#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~pred~0.base (store (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset 0)) |main_#t~mem51.base|) (+ 0 8)))) (= 0 |main_#t~mem51.offset|)), 178887#(or (<= (+ main_~tmp~0.offset 1) 0) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~pred~0.base (store (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset 0)) main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 178884#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8)))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))), 178885#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~pred~0.base (store (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset 0)) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8))))), 178890#(= 1 (select |#valid| |main_#t~mem56.base|)), 178888#(= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~pred~0.base (store (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset 0)) main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 178889#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 178870#false, 178871#(= 0 |main_#t~malloc0.offset|), 178869#true, 178874#(and (= main_~tree~0.offset 0) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 178875#(and (= 0 |main_#t~malloc25.offset|) (= main_~tree~0.offset 0) (not (= main_~tmp~0.base |main_#t~malloc25.base|)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 178872#(= main_~tree~0.offset 0), 178873#(and (= main_~tree~0.offset 0) (= (select |#valid| main_~tree~0.base) 1)), 178878#(and (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~newNode~0.base) 1) (= (select |#valid| main_~tree~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0)) main_~tree~0.base) main_~tree~0.offset))), 178879#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base main_~newNode~0.base)) (not (= main_~newNode~0.base |main_#t~malloc35.base|)) (= main_~newNode~0.offset 0) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 178876#(and (= main_~tree~0.offset 0) (= main_~newNode~0.offset 0) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 178877#(and (= main_~tree~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~tree~0.base) 1) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset)))] [2018-02-04 02:23:47,541 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:47,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 02:23:47,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 02:23:47,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:23:47,541 INFO L87 Difference]: Start difference. First operand 1653 states and 2152 transitions. Second operand 22 states. [2018-02-04 02:23:49,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:23:49,559 INFO L93 Difference]: Finished difference Result 2922 states and 3716 transitions. [2018-02-04 02:23:49,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 02:23:49,559 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 74 [2018-02-04 02:23:49,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:23:49,561 INFO L225 Difference]: With dead ends: 2922 [2018-02-04 02:23:49,561 INFO L226 Difference]: Without dead ends: 2922 [2018-02-04 02:23:49,561 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=520, Invalid=2030, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 02:23:49,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2018-02-04 02:23:49,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 1658. [2018-02-04 02:23:49,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1658 states. [2018-02-04 02:23:49,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2158 transitions. [2018-02-04 02:23:49,573 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2158 transitions. Word has length 74 [2018-02-04 02:23:49,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:23:49,573 INFO L432 AbstractCegarLoop]: Abstraction has 1658 states and 2158 transitions. [2018-02-04 02:23:49,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 02:23:49,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2158 transitions. [2018-02-04 02:23:49,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-04 02:23:49,573 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:23:49,573 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] [2018-02-04 02:23:49,574 INFO L371 AbstractCegarLoop]: === Iteration 104 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:23:49,574 INFO L82 PathProgramCache]: Analyzing trace with hash 2146711788, now seen corresponding path program 1 times [2018-02-04 02:23:49,574 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:23:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:23:49,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:23:50,017 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:50,017 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:23:50,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 02:23:50,017 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:23:50,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:50,017 INFO L182 omatonBuilderFactory]: Interpolants [183530#false, 183531#(= 0 |main_#t~malloc0.offset|), 183529#true, 183534#(and (= main_~tree~0.offset 0) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 183535#(and (= 0 |main_#t~malloc25.offset|) (= main_~tree~0.offset 0) (not (= main_~tmp~0.base |main_#t~malloc25.base|)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 183532#(= main_~tree~0.offset 0), 183533#(and (= main_~tree~0.offset 0) (= (select |#valid| main_~tree~0.base) 1)), 183538#(and (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0)) main_~tree~0.base) main_~tree~0.offset)) (= (select |#valid| main_~newNode~0.base) 1) (= main_~tree~0.offset main_~newNode~0.offset) (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0)) main_~tree~0.base) main_~tree~0.offset))) (= (select |#valid| main_~tree~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0)) main_~tree~0.base) main_~tree~0.offset))), 183539#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) main_~tree~0.offset))) (= 0 |main_#t~malloc35.offset|) (= 4 (select |#length| |main_#t~malloc35.base|)) (not (= main_~newNode~0.base |main_#t~malloc35.base|)) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset main_~newNode~0.offset) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 183536#(and (= main_~tree~0.offset 0) (= main_~tree~0.offset main_~newNode~0.offset) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 183537#(and (= main_~tree~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~tree~0.offset main_~newNode~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset))), 183542#(and (= main_~tree~0.offset 0) (= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8)))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8)))), 183543#(and (= main_~tree~0.offset 0) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8)))), 183540#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (not (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8))) (= main_~tree~0.offset main_~newNode~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 183541#(and (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (not (= |main_#t~mem37.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (not (= main_~newNode~0.base |main_#t~mem37.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8))) (= main_~tree~0.offset main_~newNode~0.offset)), 183546#(and (= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~pred~0.base (store (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset 0)) |main_#t~mem51.base|) (+ 0 8)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem51.base|) (+ 0 8))) (not (= main_~pred~0.base |main_#t~mem51.base|)) (= 0 |main_#t~mem51.offset|)), 183547#(or (<= (+ main_~tmp~0.offset 1) 0) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~pred~0.base (store (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset 0)) main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmp~0.base main_~pred~0.base)))), 183544#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8)))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))), 183545#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~pred~0.base (store (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset 0)) (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8)))) (not (= main_~pred~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))), 183550#(and (= 4 (select |#length| |main_#t~mem56.base|)) (= |main_#t~mem56.offset| 0)), 183548#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~pred~0.base (store (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset 0)) main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (not (= main_~tmp~0.base main_~pred~0.base))), 183549#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))] [2018-02-04 02:23:50,018 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:50,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 02:23:50,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 02:23:50,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:23:50,018 INFO L87 Difference]: Start difference. First operand 1658 states and 2158 transitions. Second operand 22 states. [2018-02-04 02:23:52,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:23:52,063 INFO L93 Difference]: Finished difference Result 2882 states and 3676 transitions. [2018-02-04 02:23:52,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 02:23:52,064 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 74 [2018-02-04 02:23:52,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:23:52,066 INFO L225 Difference]: With dead ends: 2882 [2018-02-04 02:23:52,066 INFO L226 Difference]: Without dead ends: 2882 [2018-02-04 02:23:52,066 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=451, Invalid=1711, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 02:23:52,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2018-02-04 02:23:52,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 1658. [2018-02-04 02:23:52,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1658 states. [2018-02-04 02:23:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2157 transitions. [2018-02-04 02:23:52,078 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2157 transitions. Word has length 74 [2018-02-04 02:23:52,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:23:52,079 INFO L432 AbstractCegarLoop]: Abstraction has 1658 states and 2157 transitions. [2018-02-04 02:23:52,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 02:23:52,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2157 transitions. [2018-02-04 02:23:52,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-04 02:23:52,079 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:23:52,079 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] [2018-02-04 02:23:52,079 INFO L371 AbstractCegarLoop]: === Iteration 105 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:23:52,080 INFO L82 PathProgramCache]: Analyzing trace with hash 845586743, now seen corresponding path program 1 times [2018-02-04 02:23:52,080 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:23:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:23:52,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:23:52,662 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-04 02:23:52,662 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:23:52,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 02:23:52,662 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:23:52,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:52,663 INFO L182 omatonBuilderFactory]: Interpolants [188162#(and (or (and (= 0 main_~tree~0.offset) (= 4 (select |#length| main_~tree~0.base))) (not (= main_~tree~0.base main_~tmpList~0.base))) (or (= main_~tree~0.base main_~tmpList~0.base) (and (or (= |main_#t~mem45.offset| main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~mem45.base|))) (not (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem45.base| (store (select |#memory_$Pointer$.base| |main_#t~mem45.base|) |main_#t~mem45.offset| main_~tmpList~0.base)) main_~tree~0.base) main_~tree~0.offset) 0))))), 188163#(or (and (= 0 main_~tree~0.offset) (= 4 (select |#length| main_~tree~0.base))) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset) 0))), 188160#(and (or (and (= 0 main_~tree~0.offset) (= 4 (select |#length| main_~tree~0.base))) (not (= main_~tree~0.base main_~tmpList~0.base))) (or (= main_~tree~0.base main_~tmpList~0.base) (and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset) 0)) (not (= 0 main_~tmpList~0.base))))), 188161#(and (or (and (= 0 main_~tree~0.offset) (= 4 (select |#length| main_~tree~0.base))) (not (= main_~tree~0.base main_~tmpList~0.base))) (or (= main_~tree~0.base main_~tmpList~0.base) (and (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset) 0)) (= |main_#t~mem42.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= main_~tree~0.offset |main_#t~mem42.offset|) (not (= 0 main_~tmpList~0.base))))), 188166#(or |main_#t~short49| (and (= main_~tmp~0.offset 0) (= 4 (select |#length| main_~tmp~0.base)))), 188167#(and (= main_~tmp~0.offset 0) (= 4 (select |#length| main_~tmp~0.base))), 188164#(or (and (= main_~tmp~0.offset 0) (= 4 (select |#length| main_~tmp~0.base))) (not (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) 0))), 188165#(or (not (= 0 |main_#t~mem47.base|)) (and (= main_~tmp~0.offset 0) (= 4 (select |#length| main_~tmp~0.base)))), 188142#false, 188143#(= |main_#t~malloc0.offset| 0), 188141#true, 188146#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= main_~tree~0.offset |main_#t~malloc3.offset|) (= 0 main_~tree~0.offset)), 188147#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 188144#(= 0 main_~tree~0.offset), 188145#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 188150#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 188151#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tree~0.offset 8))) (not (= |main_#t~malloc25.base| 0)) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~malloc25.base|)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 188148#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 188149#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 188154#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) main_~tree~0.offset) 0)) (= main_~tree~0.offset (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 188155#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset) 0)) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 188152#(and (= main_~tree~0.offset (select (store (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.offset) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (not (= main_~tmp~0.base main_~newNode~0.base)) (not (= main_~newNode~0.base 0)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 188153#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset) 0)) (not (= main_~newNode~0.base main_~tree~0.base)) (= 0 main_~tree~0.offset) (= main_~tree~0.offset (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| main_~tree~0.base) 1)), 188158#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset) 0)) (= 0 main_~tree~0.offset)), 188159#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset) 0)) (or (not (= main_~tree~0.base |main_#t~malloc41.base|)) (and (= 0 main_~tree~0.offset) (= 4 (select |#length| main_~tree~0.base)))) (not (= 0 |main_#t~malloc41.base|))), 188156#(and (= main_~tree~0.offset (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= |main_#t~mem37.base| main_~tree~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset) 0)) (= 0 main_~tree~0.offset)), 188157#(and (not (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset) 0)) (= main_~tree~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset))] [2018-02-04 02:23:52,663 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-04 02:23:52,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 02:23:52,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 02:23:52,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2018-02-04 02:23:52,663 INFO L87 Difference]: Start difference. First operand 1658 states and 2157 transitions. Second operand 27 states. [2018-02-04 02:23:56,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:23:56,826 INFO L93 Difference]: Finished difference Result 2235 states and 2847 transitions. [2018-02-04 02:23:56,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 02:23:56,826 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 74 [2018-02-04 02:23:56,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:23:56,828 INFO L225 Difference]: With dead ends: 2235 [2018-02-04 02:23:56,828 INFO L226 Difference]: Without dead ends: 2226 [2018-02-04 02:23:56,828 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1502 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1580, Invalid=4900, Unknown=0, NotChecked=0, Total=6480 [2018-02-04 02:23:56,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2018-02-04 02:23:56,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 1642. [2018-02-04 02:23:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1642 states. [2018-02-04 02:23:56,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 2135 transitions. [2018-02-04 02:23:56,837 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 2135 transitions. Word has length 74 [2018-02-04 02:23:56,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:23:56,837 INFO L432 AbstractCegarLoop]: Abstraction has 1642 states and 2135 transitions. [2018-02-04 02:23:56,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 02:23:56,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 2135 transitions. [2018-02-04 02:23:56,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-04 02:23:56,838 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:23:56,838 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:23:56,838 INFO L371 AbstractCegarLoop]: === Iteration 106 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:23:56,838 INFO L82 PathProgramCache]: Analyzing trace with hash -564943592, now seen corresponding path program 1 times [2018-02-04 02:23:56,839 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:23:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:23:56,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:23:57,662 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:57,663 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:23:57,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 02:23:57,698 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:23:57,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:57,699 INFO L182 omatonBuilderFactory]: Interpolants [192154#false, 192155#(= (select |#valid| 0) 0), 192153#true, 192158#(and (= 1 (select |#valid| main_~tree~0.base)) (= (select |#valid| 0) 0) (= 0 main_~tree~0.offset)), 192159#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= (select |#valid| 0) 0) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 192156#(and (= 0 |main_#t~malloc0.offset|) (= (select |#valid| 0) 0)), 192157#(and (= (select |#valid| 0) 0) (= 0 main_~tree~0.offset)), 192162#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= (select |#valid| 0) 0) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 192163#(and (= (select |#valid| 0) 0) (= 0 main_~tree~0.offset) (= main_~tmp~0.base main_~tree~0.base) (= main_~tree~0.offset main_~tmp~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 192160#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8) |main_#t~malloc3.base|) (+ main_~tree~0.offset 4))) (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= (select |#valid| 0) 0) (= 0 main_~tree~0.offset)), 192161#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= (select |#valid| 0) 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 192166#(and (or (= 0 (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= (select |#valid| 0) 0)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= (select |#valid| main_~tree~0.base) 1)), 192167#(and (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 1 (select |#valid| main_~newNode~0.base)) (or (and (= (select |#valid| 0) 0) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0) main_~newNode~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0)) main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0) main_~newNode~0.offset)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 192164#(and (= 0 |main_#t~malloc30.offset|) (= (select |#valid| 0) 0) (= 0 main_~tree~0.offset) (not (= main_~tmp~0.base |main_#t~malloc30.base|)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tree~0.offset main_~tmp~0.offset)), 192165#(and (= (select |#valid| 0) 0) (= main_~newNode~0.offset 0) (= 0 main_~tree~0.offset) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tree~0.offset main_~tmp~0.offset)), 192170#(and (not (= |main_#t~mem37.base| main_~tree~0.base)) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (or (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 1 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset))) (not (= main_~newNode~0.base |main_#t~mem37.base|)) (= main_~newNode~0.offset 0) (= 0 main_~tree~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset))), 192171#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 4))) 0)) (or (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 4))) 0)) (= 1 (select |#valid| 0)) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= 0 main_~tree~0.offset)), 192168#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|) main_~newNode~0.offset)) (not (= main_~newNode~0.base |main_#t~malloc35.base|)) (= main_~newNode~0.offset 0) (= 0 main_~tree~0.offset) (or (= 0 (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 1 (select |#valid| 0)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|) main_~newNode~0.offset))) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 192169#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (or (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 1 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset))) (not (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= main_~newNode~0.offset 0) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset))), 192174#(and (or (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) 0)) (= 0 |main_#t~mem48.base|) (= 1 (select |#valid| 0))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4)) |main_#t~mem48.offset|) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= main_~tmp~0.offset 0)), 192175#(and (= main_~tmp~0.offset 0) (or (= 1 (select |#valid| 0)) (not |main_#t~short49|) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4))))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4))))), 192172#(and (or (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 1 (select |#valid| 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 main_~tree~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) 0))), 192173#(and (or (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= 1 (select |#valid| 0))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= main_~tmp~0.offset 0)), 192178#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (or (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 1 (select |#valid| 0)))), 192179#(and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset) |main_#t~mem47.base|) (= |main_#t~mem47.base| 0) (or (= 0 |main_#t~mem47.offset|) (= 1 (select |#valid| 0)))), 192176#(and (= main_~tmp~0.offset 0) (or (= 1 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4))))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4))))), 192177#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem52.base|) |main_#t~mem52.offset|)) (or (= 1 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem52.base|) |main_#t~mem52.offset|)))), 192182#(and (= 0 |main_#t~mem51.base|) (= 1 (select |#valid| 0))), 192183#(= 1 (select |#valid| main_~tmp~0.base)), 192180#(or (and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= 1 (select |#valid| 0))) (not |main_#t~short49|)), 192181#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= 1 (select |#valid| 0)))] [2018-02-04 02:23:57,699 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:23:57,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 02:23:57,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 02:23:57,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=837, Unknown=0, NotChecked=0, Total=930 [2018-02-04 02:23:57,699 INFO L87 Difference]: Start difference. First operand 1642 states and 2135 transitions. Second operand 31 states. [2018-02-04 02:24:02,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:24:02,085 INFO L93 Difference]: Finished difference Result 2837 states and 3627 transitions. [2018-02-04 02:24:02,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-04 02:24:02,085 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 76 [2018-02-04 02:24:02,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:24:02,087 INFO L225 Difference]: With dead ends: 2837 [2018-02-04 02:24:02,087 INFO L226 Difference]: Without dead ends: 2837 [2018-02-04 02:24:02,087 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2030 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1357, Invalid=6475, Unknown=0, NotChecked=0, Total=7832 [2018-02-04 02:24:02,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2837 states. [2018-02-04 02:24:02,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2837 to 1638. [2018-02-04 02:24:02,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1638 states. [2018-02-04 02:24:02,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2129 transitions. [2018-02-04 02:24:02,097 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2129 transitions. Word has length 76 [2018-02-04 02:24:02,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:24:02,097 INFO L432 AbstractCegarLoop]: Abstraction has 1638 states and 2129 transitions. [2018-02-04 02:24:02,097 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 02:24:02,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2129 transitions. [2018-02-04 02:24:02,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-04 02:24:02,098 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:24:02,098 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:24:02,098 INFO L371 AbstractCegarLoop]: === Iteration 107 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:24:02,098 INFO L82 PathProgramCache]: Analyzing trace with hash -979189142, now seen corresponding path program 1 times [2018-02-04 02:24:02,098 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:24:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:24:02,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:24:02,157 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:24:02,157 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:24:02,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 02:24:02,157 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:24:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:24:02,158 INFO L182 omatonBuilderFactory]: Interpolants [196775#true, 196779#(= main_~tmp~0.offset 0), 196778#(= 0 main_~tree~0.offset), 196777#(= 0 |main_#t~malloc0.offset|), 196776#false, 196782#(and (<= 8 (select |#length| main_~pred~0.base)) (= main_~pred~0.offset 0)), 196781#(and (= (select |#length| main_~tmp~0.base) (select |#length| main_~pred~0.base)) (= main_~tmp~0.offset 0) (= main_~pred~0.offset 0) (<= (+ main_~tmp~0.offset 8) (select |#length| main_~tmp~0.base))), 196780#(and (= main_~tmp~0.offset 0) (<= (+ main_~tmp~0.offset 8) (select |#length| main_~tmp~0.base)))] [2018-02-04 02:24:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:24:02,158 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:24:02,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:24:02,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:24:02,158 INFO L87 Difference]: Start difference. First operand 1638 states and 2129 transitions. Second operand 8 states. [2018-02-04 02:24:02,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:24:02,318 INFO L93 Difference]: Finished difference Result 1881 states and 2408 transitions. [2018-02-04 02:24:02,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:24:02,318 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 76 [2018-02-04 02:24:02,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:24:02,319 INFO L225 Difference]: With dead ends: 1881 [2018-02-04 02:24:02,319 INFO L226 Difference]: Without dead ends: 1881 [2018-02-04 02:24:02,319 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:24:02,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2018-02-04 02:24:02,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1640. [2018-02-04 02:24:02,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1640 states. [2018-02-04 02:24:02,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 2129 transitions. [2018-02-04 02:24:02,342 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 2129 transitions. Word has length 76 [2018-02-04 02:24:02,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:24:02,342 INFO L432 AbstractCegarLoop]: Abstraction has 1640 states and 2129 transitions. [2018-02-04 02:24:02,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:24:02,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 2129 transitions. [2018-02-04 02:24:02,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-04 02:24:02,343 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:24:02,343 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:24:02,343 INFO L371 AbstractCegarLoop]: === Iteration 108 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:24:02,343 INFO L82 PathProgramCache]: Analyzing trace with hash -265726194, now seen corresponding path program 1 times [2018-02-04 02:24:02,343 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:24:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:24:02,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:24:03,327 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:24:03,328 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:24:03,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 02:24:03,328 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:24:03,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:24:03,328 INFO L182 omatonBuilderFactory]: Interpolants [200323#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 200322#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 200321#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 main_~tree~0.offset)), 200320#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 200327#(and (= main_~tree~0.offset 0) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 200326#(and (= main_~tree~0.offset 0) (or |main_#t~short18| (and (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= main_~tmp~0.offset main_~tree~0.offset))) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 200325#(and (= main_~tree~0.offset 0) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= main_~tree~0.base main_~tmp~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 200324#(and (= main_~tree~0.offset 0) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tmp~0.offset 0) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 200331#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 200330#(and (= main_~tree~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset))), 200329#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~tmp~0.base (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4) main_~newNode~0.base) (+ main_~tree~0.offset 8)))) (= main_~tmp~0.offset 0) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base)), 200328#(and (= main_~tree~0.offset 0) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~tmp~0.base |main_#t~malloc30.base|)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 200335#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 200334#(and (= main_~tree~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) main_~tree~0.offset))), 200333#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= |main_#t~mem37.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 200332#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 200339#(and (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem45.base| (store (select |#memory_$Pointer$.base| |main_#t~mem45.base|) |main_#t~mem45.offset| main_~tmpList~0.base)) main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem45.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem45.base|) |main_#t~mem45.offset| main_~tmpList~0.offset)) main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (not (= main_~tree~0.base main_~tmpList~0.base))), 200338#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 200337#(and (= main_~tree~0.offset 0) (or (not (= main_~tree~0.base main_~tmpList~0.base)) (= 4 (select |#length| main_~tmpList~0.base))) (or (= main_~tree~0.base main_~tmpList~0.base) (and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))))), 200336#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 4 (select |#length| |main_#t~malloc41.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 200343#(not |main_#t~short18|), 200342#(and (= |main_#t~mem16.base| 0) (= |main_#t~mem16.offset| 0)), 200341#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))), 200340#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 200319#(= 0 main_~tree~0.offset), 200318#(= 0 |main_#t~malloc0.offset|), 200317#false, 200316#true] [2018-02-04 02:24:03,328 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:24:03,328 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 02:24:03,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 02:24:03,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2018-02-04 02:24:03,329 INFO L87 Difference]: Start difference. First operand 1640 states and 2129 transitions. Second operand 28 states. [2018-02-04 02:24:06,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:24:06,557 INFO L93 Difference]: Finished difference Result 2615 states and 3362 transitions. [2018-02-04 02:24:06,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 02:24:06,558 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 76 [2018-02-04 02:24:06,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:24:06,560 INFO L225 Difference]: With dead ends: 2615 [2018-02-04 02:24:06,560 INFO L226 Difference]: Without dead ends: 2615 [2018-02-04 02:24:06,560 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 7 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1302 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1525, Invalid=4327, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 02:24:06,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2615 states. [2018-02-04 02:24:06,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2615 to 1706. [2018-02-04 02:24:06,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2018-02-04 02:24:06,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2210 transitions. [2018-02-04 02:24:06,571 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2210 transitions. Word has length 76 [2018-02-04 02:24:06,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:24:06,571 INFO L432 AbstractCegarLoop]: Abstraction has 1706 states and 2210 transitions. [2018-02-04 02:24:06,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 02:24:06,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2210 transitions. [2018-02-04 02:24:06,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-04 02:24:06,571 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:24:06,571 INFO L351 BasicCegarLoop]: trace histogram [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-04 02:24:06,572 INFO L371 AbstractCegarLoop]: === Iteration 109 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:24:06,572 INFO L82 PathProgramCache]: Analyzing trace with hash -578591476, now seen corresponding path program 1 times [2018-02-04 02:24:06,572 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:24:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:24:06,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:24:07,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:24:07,191 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:24:07,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 02:24:07,191 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:24:07,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:24:07,191 INFO L182 omatonBuilderFactory]: Interpolants [204763#true, 204767#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 204766#(= 0 main_~tree~0.offset), 204765#(= 0 |main_#t~malloc0.offset|), 204764#false, 204771#(and (= main_~tree~0.offset 0) (= (select |#valid| main_~tree~0.base) 1) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 204770#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 204769#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 204768#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 main_~tree~0.offset)), 204775#(and (= 1 (select |#valid| main_~tree~0.base)) (= main_~tree~0.offset 0) (= 1 (select |#valid| main_~newNode~0.base)) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= 12 (select |#length| main_~newNode~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0)) main_~tree~0.base) (+ main_~tree~0.offset 8))))), 204774#(and (= 1 (select |#valid| main_~tree~0.base)) (= main_~tree~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 12 (select |#length| main_~newNode~0.base)) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset))), 204773#(and (= main_~tree~0.offset 0) (= 0 main_~newNode~0.offset) (not (= main_~tree~0.base (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset main_~newNode~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tmp~0.base main_~newNode~0.base)) (= 12 (select |#length| main_~newNode~0.base)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 204772#(and (= 0 |main_#t~malloc25.offset|) (= main_~tree~0.offset 0) (= 12 (select |#length| |main_#t~malloc25.base|)) (not (= main_~tree~0.base |main_#t~malloc25.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 204779#(and (= main_~tree~0.offset 0) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset))) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset))) (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) main_~tree~0.offset))), 204778#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (= 1 (select |#valid| main_~newNode~0.base)) (not (= |main_#t~mem37.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 12 (select |#length| main_~newNode~0.base))), 204777#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= (select |#valid| main_~newNode~0.base) 1) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 12 (select |#length| main_~newNode~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)) main_~tree~0.base))), 204776#(and (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= main_~tree~0.offset 0) (not (= main_~newNode~0.base |main_#t~malloc35.base|)) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) main_~tree~0.offset)) (not (= |main_#t~malloc35.base| main_~tree~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) main_~tree~0.offset)) (= 12 (select |#length| main_~newNode~0.base))), 204783#(and (= main_~tree~0.offset 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 204782#(and (= main_~tree~0.offset 0) (or (not (= main_~tree~0.base main_~tmpList~0.base)) (= 4 (select |#length| main_~tree~0.base))) (or (= main_~tree~0.base main_~tmpList~0.base) (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))))), 204781#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (or (not (= main_~tree~0.base |main_#t~malloc41.base|)) (= 4 (select |#length| main_~tree~0.base))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 204780#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 204787#(and (= 12 (select |#length| |main_#t~mem51.base|)) (= 0 |main_#t~mem51.offset|)), 204786#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))), 204785#(and (= main_~tree~0.offset 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 204784#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem45.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem45.base|) |main_#t~mem45.offset| main_~tmpList~0.offset)) main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base |main_#t~mem45.base|))), 204789#(and (= (select |#length| main_~tmp~0.base) 12) (= main_~tmp~0.offset 0)), 204788#(or (and (= (select |#length| main_~tmp~0.base) 12) (= main_~tmp~0.offset 0)) (not (= 1 (select |#valid| main_~tmp~0.base))))] [2018-02-04 02:24:07,192 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:24:07,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 02:24:07,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 02:24:07,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2018-02-04 02:24:07,192 INFO L87 Difference]: Start difference. First operand 1706 states and 2210 transitions. Second operand 27 states. [2018-02-04 02:24:10,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:24:10,733 INFO L93 Difference]: Finished difference Result 2486 states and 3152 transitions. [2018-02-04 02:24:10,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 02:24:10,733 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 76 [2018-02-04 02:24:10,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:24:10,736 INFO L225 Difference]: With dead ends: 2486 [2018-02-04 02:24:10,736 INFO L226 Difference]: Without dead ends: 2486 [2018-02-04 02:24:10,736 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1231 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1143, Invalid=4407, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 02:24:10,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2018-02-04 02:24:10,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 1681. [2018-02-04 02:24:10,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1681 states. [2018-02-04 02:24:10,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1681 states and 2170 transitions. [2018-02-04 02:24:10,753 INFO L78 Accepts]: Start accepts. Automaton has 1681 states and 2170 transitions. Word has length 76 [2018-02-04 02:24:10,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:24:10,753 INFO L432 AbstractCegarLoop]: Abstraction has 1681 states and 2170 transitions. [2018-02-04 02:24:10,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 02:24:10,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2170 transitions. [2018-02-04 02:24:10,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 02:24:10,753 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:24:10,754 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] [2018-02-04 02:24:10,754 INFO L371 AbstractCegarLoop]: === Iteration 110 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:24:10,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1088094742, now seen corresponding path program 1 times [2018-02-04 02:24:10,754 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:24:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:24:10,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:24:11,434 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:24:11,434 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:24:11,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 02:24:11,434 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:24:11,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:24:11,435 INFO L182 omatonBuilderFactory]: Interpolants [209055#(= 0 |main_#t~malloc0.offset|), 209054#false, 209053#true, 209059#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 209058#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 main_~tree~0.offset)), 209057#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 209056#(= 0 main_~tree~0.offset), 209063#(and (= main_~tree~0.offset 0) (or |main_#t~short18| (and (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= main_~tmp~0.offset main_~tree~0.offset))) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 209062#(and (= main_~tree~0.offset 0) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset) |main_#t~mem16.offset|) (= main_~tmp~0.offset 0) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 209061#(and (= main_~tree~0.offset 0) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tmp~0.offset 0) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 209060#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 209067#(and (= main_~tree~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset))), 209066#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~tmp~0.base (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4) main_~newNode~0.base) (+ main_~tree~0.offset 8)))) (= main_~tmp~0.offset 0) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base)), 209065#(and (= main_~tree~0.offset 0) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~tmp~0.base |main_#t~malloc30.base|)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 209064#(and (= main_~tree~0.offset 0) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 209071#(and (= main_~tree~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) main_~tree~0.offset))), 209070#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= |main_#t~mem37.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 209069#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 209068#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 209075#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 209074#(and (= main_~tree~0.offset 0) (or (not (= main_~tree~0.base main_~tmpList~0.base)) (= 4 (select |#length| main_~tmpList~0.base))) (or (= main_~tree~0.base main_~tmpList~0.base) (and (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))))), 209073#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 4 (select |#length| |main_#t~malloc41.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 209072#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 209079#(and (= |main_#t~mem47.base| 0) (= 0 |main_#t~mem47.offset|)), 209078#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset))), 209077#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset))), 209076#(and (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem45.base| (store (select |#memory_$Pointer$.base| |main_#t~mem45.base|) |main_#t~mem45.offset| main_~tmpList~0.base)) main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem45.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem45.base|) |main_#t~mem45.offset| main_~tmpList~0.offset)) main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (not (= main_~tree~0.base main_~tmpList~0.base))), 209080#(not |main_#t~short49|)] [2018-02-04 02:24:11,435 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:24:11,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 02:24:11,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 02:24:11,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2018-02-04 02:24:11,436 INFO L87 Difference]: Start difference. First operand 1681 states and 2170 transitions. Second operand 28 states. [2018-02-04 02:24:15,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:24:15,313 INFO L93 Difference]: Finished difference Result 2548 states and 3258 transitions. [2018-02-04 02:24:15,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-02-04 02:24:15,314 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 77 [2018-02-04 02:24:15,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:24:15,315 INFO L225 Difference]: With dead ends: 2548 [2018-02-04 02:24:15,315 INFO L226 Difference]: Without dead ends: 2548 [2018-02-04 02:24:15,316 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1953, Invalid=6419, Unknown=0, NotChecked=0, Total=8372 [2018-02-04 02:24:15,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2018-02-04 02:24:15,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 1679. [2018-02-04 02:24:15,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1679 states. [2018-02-04 02:24:15,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 2167 transitions. [2018-02-04 02:24:15,326 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 2167 transitions. Word has length 77 [2018-02-04 02:24:15,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:24:15,326 INFO L432 AbstractCegarLoop]: Abstraction has 1679 states and 2167 transitions. [2018-02-04 02:24:15,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 02:24:15,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 2167 transitions. [2018-02-04 02:24:15,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 02:24:15,326 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:24:15,327 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] [2018-02-04 02:24:15,327 INFO L371 AbstractCegarLoop]: === Iteration 111 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:24:15,327 INFO L82 PathProgramCache]: Analyzing trace with hash 628076036, now seen corresponding path program 1 times [2018-02-04 02:24:15,327 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:24:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:24:15,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:24:15,676 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:24:15,676 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:24:15,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 02:24:15,676 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:24:15,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:24:15,677 INFO L182 omatonBuilderFactory]: Interpolants [213443#(and (= main_~tree~0.offset 0) (= main_~newNode~0.offset 0) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.offset main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 213442#(and (= 0 |main_#t~malloc25.offset|) (= main_~tree~0.offset 0) (not (= main_~tmp~0.base |main_#t~malloc25.base|)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset)), 213441#(and (= main_~tree~0.offset 0) (= main_~tmp~0.base main_~tree~0.base) (= main_~tmp~0.offset main_~tree~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 213440#(and (= main_~tree~0.offset 0) (= (select |#valid| main_~tree~0.base) 1)), 213447#(and (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (= main_~tree~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (not (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= main_~newNode~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 213446#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) main_~tree~0.offset))) (= 0 |main_#t~malloc35.offset|) (not (= main_~newNode~0.base |main_#t~malloc35.base|)) (= main_~newNode~0.offset 0) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 213445#(and (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0)) main_~tree~0.base) main_~tree~0.offset)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~newNode~0.base) 1) (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0)) main_~tree~0.base) main_~tree~0.offset))) (= (select |#valid| main_~tree~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0)) main_~tree~0.base) main_~tree~0.offset))), 213444#(and (= main_~tree~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~tree~0.base) 1) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) main_~tree~0.offset))), 213451#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))), 213450#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8)))), 213449#(and (= main_~tree~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) main_~tree~0.offset)) (+ main_~tree~0.offset 8)))), 213448#(and (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) main_~tree~0.offset))) (not (= |main_#t~mem37.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) main_~tree~0.offset)) (not (= main_~newNode~0.base |main_#t~mem37.base|)) (= main_~newNode~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))), 213455#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (not (= main_~tmp~0.base main_~pred~0.base))), 213454#(and (or (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (<= (+ main_~tmp~0.offset 1) 0)) (not (= main_~tmp~0.base main_~pred~0.base))), 213453#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem51.base|) (+ 0 8))) (not (= main_~pred~0.base |main_#t~mem51.base|)) (= 0 |main_#t~mem51.offset|)), 213452#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)) (+ 0 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) main_~tmp~0.offset)) (not (= main_~pred~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset)))), 213457#(= |main_#t~mem64.offset| 0), 213456#(= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))), 213439#(= main_~tree~0.offset 0), 213438#(= 0 |main_#t~malloc0.offset|), 213437#false, 213436#true] [2018-02-04 02:24:15,677 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:24:15,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 02:24:15,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 02:24:15,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:24:15,677 INFO L87 Difference]: Start difference. First operand 1679 states and 2167 transitions. Second operand 22 states. [2018-02-04 02:24:17,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:24:17,535 INFO L93 Difference]: Finished difference Result 2947 states and 3723 transitions. [2018-02-04 02:24:17,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 02:24:17,535 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2018-02-04 02:24:17,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:24:17,537 INFO L225 Difference]: With dead ends: 2947 [2018-02-04 02:24:17,537 INFO L226 Difference]: Without dead ends: 2947 [2018-02-04 02:24:17,537 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=492, Invalid=1958, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 02:24:17,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2018-02-04 02:24:17,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 1682. [2018-02-04 02:24:17,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2018-02-04 02:24:17,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2171 transitions. [2018-02-04 02:24:17,548 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2171 transitions. Word has length 77 [2018-02-04 02:24:17,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:24:17,549 INFO L432 AbstractCegarLoop]: Abstraction has 1682 states and 2171 transitions. [2018-02-04 02:24:17,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 02:24:17,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2171 transitions. [2018-02-04 02:24:17,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 02:24:17,549 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:24:17,549 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:24:17,549 INFO L371 AbstractCegarLoop]: === Iteration 112 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:24:17,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1216035641, now seen corresponding path program 1 times [2018-02-04 02:24:17,550 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:24:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:24:17,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:24:18,172 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:24:18,172 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:24:18,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-04 02:24:18,172 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:24:18,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:24:18,172 INFO L182 omatonBuilderFactory]: Interpolants [218143#true, 218147#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 218146#(= 0 main_~tree~0.offset), 218145#(= 0 |main_#t~malloc0.offset|), 218144#false, 218151#(and (not (= main_~tree~0.base |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 218150#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 218149#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 218148#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 main_~tree~0.offset)), 218155#(and (= main_~tree~0.offset 0) (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (= (select |#valid| main_~tree~0.base) 1) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tree~0.base main_~tmp~0.base)), 218154#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= (select |#valid| main_~tree~0.base) 1)), 218153#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 218152#(and (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 218159#(and (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= main_~tree~0.offset 0) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 218158#(and (= main_~tree~0.offset 0) (not (= main_~newNode~0.base main_~tree~0.base)) (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= (select |#valid| main_~tree~0.base) 1)), 218157#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4) main_~newNode~0.base) (+ main_~tree~0.offset 8)))) (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base)), 218156#(and (= main_~tree~0.offset 0) (not (= (+ main_~tree~0.offset 4) main_~tmp~0.offset)) (not (= main_~tree~0.base |main_#t~malloc30.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)))) (= main_~tree~0.base main_~tmp~0.base)), 218163#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 218162#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))))), 218161#(and (= main_~tree~0.offset 0) (not (= |main_#t~mem37.base| main_~tree~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 218160#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 218167#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0))), 218166#(and (= main_~tree~0.offset 0) (= |main_#t~mem42.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tmpList~0.base main_~tree~0.base))), 218165#(and (= main_~tree~0.offset 0) (or (and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= main_~tmpList~0.base main_~tree~0.base))) (= (select |#length| main_~tree~0.base) 4))), 218164#(and (= main_~tree~0.offset 0) (or (= 4 (select |#length| |main_#t~malloc41.base|)) (= (select |#length| main_~tree~0.base) 4)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 218171#(and (= main_~tree~0.offset 0) (<= (+ (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)))), 218170#(and (= main_~tree~0.offset 0) (<= (+ (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0))), 218169#(and (= main_~tree~0.offset 0) (= |main_#t~mem45.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= |main_#t~mem45.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tree~0.base |main_#t~mem45.base|)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0))), 218168#(and (= main_~tree~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0))), 218172#(and (<= 0 |main_#t~mem42.offset|) (<= (+ |main_#t~mem42.offset| 4) (select |#length| |main_#t~mem42.base|)))] [2018-02-04 02:24:18,172 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:24:18,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 02:24:18,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 02:24:18,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2018-02-04 02:24:18,173 INFO L87 Difference]: Start difference. First operand 1682 states and 2171 transitions. Second operand 30 states. [2018-02-04 02:24:23,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:24:23,051 INFO L93 Difference]: Finished difference Result 3434 states and 4356 transitions. [2018-02-04 02:24:23,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-02-04 02:24:23,051 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 77 [2018-02-04 02:24:23,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:24:23,053 INFO L225 Difference]: With dead ends: 3434 [2018-02-04 02:24:23,053 INFO L226 Difference]: Without dead ends: 3434 [2018-02-04 02:24:23,054 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2348 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2541, Invalid=7965, Unknown=0, NotChecked=0, Total=10506 [2018-02-04 02:24:23,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3434 states. [2018-02-04 02:24:23,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3434 to 1843. [2018-02-04 02:24:23,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1843 states. [2018-02-04 02:24:23,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1843 states and 2389 transitions. [2018-02-04 02:24:23,067 INFO L78 Accepts]: Start accepts. Automaton has 1843 states and 2389 transitions. Word has length 77 [2018-02-04 02:24:23,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:24:23,067 INFO L432 AbstractCegarLoop]: Abstraction has 1843 states and 2389 transitions. [2018-02-04 02:24:23,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 02:24:23,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 2389 transitions. [2018-02-04 02:24:23,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-04 02:24:23,067 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:24:23,067 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:24:23,068 INFO L371 AbstractCegarLoop]: === Iteration 113 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:24:23,068 INFO L82 PathProgramCache]: Analyzing trace with hash 730517433, now seen corresponding path program 2 times [2018-02-04 02:24:23,068 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:24:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:24:23,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:24:23,644 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:24:23,644 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:24:23,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 02:24:23,645 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:24: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-04 02:24:23,645 INFO L182 omatonBuilderFactory]: Interpolants [223617#(not |main_#t~short49|), 223616#(and (= 0 |main_#t~mem48.base|) (= 0 |main_#t~mem48.offset|)), 223599#(= 0 main_~tree~0.offset), 223598#(= 0 |main_#t~malloc0.offset|), 223597#false, 223596#true, 223603#(and (= main_~tree~0.offset 0) (= main_~newNode~0.offset 0) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tree~0.offset main_~tmp~0.offset)), 223602#(and (= 0 |main_#t~malloc30.offset|) (= 0 main_~tree~0.offset) (not (= main_~tmp~0.base |main_#t~malloc30.base|)) (= main_~tmp~0.base main_~tree~0.base) (= main_~tree~0.offset main_~tmp~0.offset)), 223601#(and (= 0 main_~tree~0.offset) (= main_~tmp~0.base main_~tree~0.base) (= main_~tree~0.offset main_~tmp~0.offset) (= (select |#valid| main_~tmp~0.base) 1)), 223600#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 223607#(and (= main_~tree~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.offset|) (+ main_~newNode~0.offset 4))) (not (= main_~newNode~0.base |main_#t~malloc35.base|)) (= main_~newNode~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|) (+ main_~newNode~0.offset 4))) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 223606#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 4))) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4))) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~newNode~0.base) 1) (= (select |#valid| main_~tree~0.base) 1)), 223605#(and (= main_~tree~0.offset 0) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 4) 0)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= (select |#valid| main_~newNode~0.base) 1) (= (select |#valid| main_~tree~0.base) 1)), 223604#(and (= main_~tree~0.offset 0) (not (= main_~newNode~0.base main_~tree~0.base)) (= main_~newNode~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~newNode~0.base (store (select |#memory_$Pointer$.offset| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= (select |#valid| main_~tree~0.base) 1)), 223611#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (+ main_~tree~0.offset 4))) (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (+ main_~tree~0.offset 4)))), 223610#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (= main_~tree~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (+ main_~tree~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem37.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.offset|)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 4))) (+ main_~tree~0.offset 4)))), 223609#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 4))) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= |main_#t~mem37.base| main_~tree~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~newNode~0.base |main_#t~mem37.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4))) (= main_~newNode~0.offset 0)), 223608#(and (= main_~tree~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~newNode~0.base) (+ main_~newNode~0.offset 4))) (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))) (not (= main_~newNode~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 4))) (= main_~newNode~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 223615#(and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))), 223614#(or (<= (+ main_~tmp~0.offset 1) 0) (and (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4))))), 223613#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem52.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem52.base|) (+ 0 4))) (= 0 |main_#t~mem52.offset|)), 223612#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (+ 0 4))) (= main_~tmp~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4))) (+ 0 4))))] [2018-02-04 02:24:23,645 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:24:23,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 02:24:23,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 02:24:23,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:24:23,646 INFO L87 Difference]: Start difference. First operand 1843 states and 2389 transitions. Second operand 22 states. [2018-02-04 02:24:25,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:24:25,983 INFO L93 Difference]: Finished difference Result 3136 states and 3976 transitions. [2018-02-04 02:24:25,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 02:24:25,983 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 78 [2018-02-04 02:24:25,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:24:25,985 INFO L225 Difference]: With dead ends: 3136 [2018-02-04 02:24:25,985 INFO L226 Difference]: Without dead ends: 3136 [2018-02-04 02:24:25,985 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=696, Invalid=2726, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 02:24:25,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3136 states. [2018-02-04 02:24:26,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3136 to 1840. [2018-02-04 02:24:26,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1840 states. [2018-02-04 02:24:26,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2384 transitions. [2018-02-04 02:24:26,003 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2384 transitions. Word has length 78 [2018-02-04 02:24:26,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:24:26,004 INFO L432 AbstractCegarLoop]: Abstraction has 1840 states and 2384 transitions. [2018-02-04 02:24:26,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 02:24:26,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2384 transitions. [2018-02-04 02:24:26,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-04 02:24:26,004 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:24:26,004 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] [2018-02-04 02:24:26,004 INFO L371 AbstractCegarLoop]: === Iteration 114 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:24:26,004 INFO L82 PathProgramCache]: Analyzing trace with hash -569203653, now seen corresponding path program 1 times [2018-02-04 02:24:26,005 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:24:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:24:26,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:24:26,679 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-04 02:24:26,679 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:24:26,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 02:24:26,680 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:24:26,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:24:26,680 INFO L182 omatonBuilderFactory]: Interpolants [228675#(and (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 228674#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 228673#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= (select |#valid| |main_#t~malloc3.base|) 1) (= 0 main_~tree~0.offset)), 228672#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 228679#(and (or (= main_~newNode~0.base (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4) main_~newNode~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4) main_~newNode~0.base) (+ main_~tree~0.offset 8))) 1)) (< main_~tmp~0.offset (+ main_~tree~0.offset 1)) (= 0 main_~tree~0.offset) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.base main_~tmp~0.base)), 228678#(and (or (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)) |main_#t~malloc30.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))) 1)) (< main_~tmp~0.offset (+ main_~tree~0.offset 1)) (= 0 main_~tree~0.offset) (not (= main_~tmp~0.base |main_#t~malloc30.base|)) (= main_~tree~0.base main_~tmp~0.base)), 228677#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))) 1) (< main_~tmp~0.offset (+ main_~tree~0.offset 1)) (= 0 main_~tree~0.offset) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 228676#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 228683#(and (not (= |main_#t~mem37.base| main_~tree~0.base)) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1) (= |main_#t~mem37.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 228682#(and (or (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)) (= (select |#valid| main_~newNode~0.base) 1) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))))), 228681#(and (or (= (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~malloc35.base|) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) 1) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 228680#(and (or (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)) (not (= main_~newNode~0.base main_~tree~0.base)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 228687#(and (or (not (= main_~tree~0.base main_~tmpList~0.base)) (and (= 4 (select |#length| main_~tmpList~0.base)) (= 0 main_~tree~0.offset))) (or (= main_~tree~0.base main_~tmpList~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tmpList~0.base)))), 228686#(and (= 4 (select |#length| |main_#t~malloc41.base|)) (= 0 main_~tree~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~malloc41.base|))), 228685#(and (= 0 main_~tree~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 228684#(and (= 0 main_~tree~0.offset) (or (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) 1) (= |main_#t~mem37.base| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))))), 228691#(and (or (not (= main_~tree~0.base main_~tmpList~0.base)) (and (= 4 (select |#length| main_~tmpList~0.base)) (= 0 main_~tree~0.offset))) (or (= main_~tree~0.base main_~tmpList~0.base) (and (or (= main_~tree~0.base |main_#t~mem45.base|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (or (not (= main_~tree~0.base |main_#t~mem45.base|)) (and (or (= 1 (select |#valid| main_~tmpList~0.base)) (not (= (+ main_~tree~0.offset 8) |main_#t~mem45.offset|))) (or (= (+ main_~tree~0.offset 8) |main_#t~mem45.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))))))), 228690#(and (or (= main_~tree~0.base main_~tmpList~0.base) (and (= 1 (select |#valid| main_~tmpList~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))) (or (not (= main_~tree~0.base main_~tmpList~0.base)) (and (= 4 (select |#length| main_~tmpList~0.base)) (= 0 main_~tree~0.offset)))), 228689#(and (or (= main_~tree~0.base main_~tmpList~0.base) (and (= 1 (select |#valid| main_~tree~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))) (or (not (= main_~tree~0.base main_~tmpList~0.base)) (and (= 4 (select |#length| main_~tmpList~0.base)) (= 0 main_~tree~0.offset)))), 228688#(and (or (not (= main_~tree~0.base main_~tmpList~0.base)) (and (= 4 (select |#length| main_~tmpList~0.base)) (= 0 main_~tree~0.offset))) (or (= main_~tree~0.base main_~tmpList~0.base) (and (= 1 (select |#valid| main_~tree~0.base)) (not (= |main_#t~mem42.base| main_~tmpList~0.base)) (= |main_#t~mem42.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))))), 228695#(= 1 (select |#valid| |main_#t~mem56.base|)), 228694#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))), 228693#(or (and (= main_~tmp~0.offset 0) (= 4 (select |#length| main_~tmp~0.base))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 228692#(or (and (= 0 main_~tree~0.offset) (= 4 (select |#length| main_~tree~0.base))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))))), 228671#(= 0 main_~tree~0.offset), 228670#(= 0 |main_#t~malloc0.offset|), 228669#false, 228668#true] [2018-02-04 02:24:26,680 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-04 02:24:26,680 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 02:24:26,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 02:24:26,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2018-02-04 02:24:26,681 INFO L87 Difference]: Start difference. First operand 1840 states and 2384 transitions. Second operand 28 states. [2018-02-04 02:24:29,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:24:29,721 INFO L93 Difference]: Finished difference Result 2318 states and 2975 transitions. [2018-02-04 02:24:29,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 02:24:29,721 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 78 [2018-02-04 02:24:29,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:24:29,722 INFO L225 Difference]: With dead ends: 2318 [2018-02-04 02:24:29,722 INFO L226 Difference]: Without dead ends: 2318 [2018-02-04 02:24:29,722 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=998, Invalid=3162, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 02:24:29,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2018-02-04 02:24:29,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 1854. [2018-02-04 02:24:29,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1854 states. [2018-02-04 02:24:29,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2400 transitions. [2018-02-04 02:24:29,731 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2400 transitions. Word has length 78 [2018-02-04 02:24:29,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:24:29,732 INFO L432 AbstractCegarLoop]: Abstraction has 1854 states and 2400 transitions. [2018-02-04 02:24:29,732 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 02:24:29,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2400 transitions. [2018-02-04 02:24:29,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-04 02:24:29,732 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:24:29,732 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] [2018-02-04 02:24:29,733 INFO L371 AbstractCegarLoop]: === Iteration 115 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:24:29,733 INFO L82 PathProgramCache]: Analyzing trace with hash -569203652, now seen corresponding path program 1 times [2018-02-04 02:24:29,733 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:24:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:24:29,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:24:30,491 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-04 02:24:30,491 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:24:30,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 02:24:30,491 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:24:30,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:24:30,492 INFO L182 omatonBuilderFactory]: Interpolants [232963#(and (or (not (= main_~tree~0.base main_~tmpList~0.base)) (and (= 4 (select |#length| main_~tmpList~0.base)) (= 0 main_~tree~0.offset))) (or (= main_~tree~0.base main_~tmpList~0.base) (and (or (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tree~0.base)) (not (= 0 main_~tmpList~0.base))) (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~tmpList~0.base (store (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem44.base|)) main_~tree~0.base) (+ main_~tree~0.offset 4))))))), 232962#(and (or (= main_~tree~0.base main_~tmpList~0.base) (and (not (= |main_#t~mem42.base| main_~tmpList~0.base)) (= |main_#t~mem42.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (or (not (= main_~tree~0.base |main_#t~mem42.base|)) (not (= 0 main_~tmpList~0.base))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))))) (or (not (= main_~tree~0.base main_~tmpList~0.base)) (and (= 4 (select |#length| main_~tmpList~0.base)) (= 0 main_~tree~0.offset)))), 232961#(and (or (= main_~tree~0.base main_~tmpList~0.base) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (not (= 0 main_~tmpList~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) main_~tmpList~0.base)))) (or (not (= main_~tree~0.base main_~tmpList~0.base)) (and (= 4 (select |#length| main_~tmpList~0.base)) (= 0 main_~tree~0.offset)))), 232960#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= 4 (select |#length| |main_#t~malloc41.base|)) (= 0 main_~tree~0.offset) (not (= 0 |main_#t~malloc41.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~malloc41.base|))), 232967#(or (not (= 0 |main_#t~mem48.base|)) (and (= main_~tmp~0.offset 0) (= 4 (select |#length| main_~tmp~0.base)))), 232966#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4)))) (and (= main_~tmp~0.offset 0) (= 4 (select |#length| main_~tmp~0.base)))), 232965#(or (and (= 0 main_~tree~0.offset) (= 4 (select |#length| main_~tree~0.base))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4))))), 232964#(and (or (not (= main_~tree~0.base main_~tmpList~0.base)) (and (= 4 (select |#length| main_~tmpList~0.base)) (= 0 main_~tree~0.offset))) (or (= main_~tree~0.base main_~tmpList~0.base) (not (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem45.base| (store (select |#memory_$Pointer$.base| |main_#t~mem45.base|) |main_#t~mem45.offset| main_~tmpList~0.base)) main_~tree~0.base) (+ main_~tree~0.offset 4)))))), 232969#(and (= main_~tmp~0.offset 0) (= 4 (select |#length| main_~tmp~0.base))), 232968#(or |main_#t~short49| (and (= main_~tmp~0.offset 0) (= 4 (select |#length| main_~tmp~0.base)))), 232943#false, 232942#true, 232947#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= (select |#valid| |main_#t~malloc3.base|) 1) (= 0 main_~tree~0.offset)), 232946#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 232945#(= 0 main_~tree~0.offset), 232944#(= 0 |main_#t~malloc0.offset|), 232951#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))) 1) (= 0 main_~tree~0.offset) (= main_~tree~0.offset main_~tmp~0.offset) (= main_~tree~0.base main_~tmp~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 232950#(and (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 232949#(and (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 232948#(and (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 232955#(and (or (= (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~malloc35.base|) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) 1) (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8)))) (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8) |main_#t~malloc35.base|)) main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~malloc35.base|))), 232954#(and (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 4)))) (or (= main_~newNode~0.base (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~newNode~0.base (store (select |#memory_$Pointer$.base| main_~newNode~0.base) main_~newNode~0.offset 0)) main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)) (not (= main_~newNode~0.base main_~tree~0.base)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 232953#(and (not (= 0 main_~newNode~0.base)) (or (= main_~newNode~0.base (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4) main_~newNode~0.base) (+ main_~tree~0.offset 8))) (= (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4) main_~newNode~0.base) (+ main_~tree~0.offset 8))) 1)) (= 0 main_~tree~0.offset) (not (= main_~tmp~0.base main_~newNode~0.base)) (= main_~tree~0.offset main_~tmp~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 232952#(and (or (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8)) |main_#t~malloc30.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tree~0.offset 8))) 1)) (not (= 0 |main_#t~malloc30.base|)) (= 0 main_~tree~0.offset) (not (= main_~tmp~0.base |main_#t~malloc30.base|)) (= main_~tree~0.offset main_~tmp~0.offset) (= main_~tree~0.base main_~tmp~0.base)), 232959#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= 0 main_~tree~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)), 232958#(and (not (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= 0 main_~tree~0.offset) (or (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) 1) (= |main_#t~mem37.base| (select (select (store |#memory_$Pointer$.base| |main_#t~mem37.base| (store (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset| |main_#t~mem39.base|)) main_~tree~0.base) (+ main_~tree~0.offset 8))))), 232957#(and (not (= |main_#t~mem37.base| main_~tree~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1) (= |main_#t~mem37.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 232956#(and (or (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 1)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 4)))) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~newNode~0.base) (+ main_~newNode~0.offset 8)))))] [2018-02-04 02:24:30,492 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-04 02:24:30,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 02:24:30,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 02:24:30,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2018-02-04 02:24:30,492 INFO L87 Difference]: Start difference. First operand 1854 states and 2400 transitions. Second operand 28 states. [2018-02-04 02:24:33,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:24:33,096 INFO L93 Difference]: Finished difference Result 2208 states and 2849 transitions. [2018-02-04 02:24:33,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 02:24:33,096 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 78 [2018-02-04 02:24:33,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:24:33,097 INFO L225 Difference]: With dead ends: 2208 [2018-02-04 02:24:33,097 INFO L226 Difference]: Without dead ends: 2205 [2018-02-04 02:24:33,098 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=756, Invalid=3026, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 02:24:33,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2018-02-04 02:24:33,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 1892. [2018-02-04 02:24:33,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1892 states. [2018-02-04 02:24:33,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2444 transitions. [2018-02-04 02:24:33,107 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2444 transitions. Word has length 78 [2018-02-04 02:24:33,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:24:33,107 INFO L432 AbstractCegarLoop]: Abstraction has 1892 states and 2444 transitions. [2018-02-04 02:24:33,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 02:24:33,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2444 transitions. [2018-02-04 02:24:33,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-04 02:24:33,108 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:24:33,108 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:24:33,108 INFO L371 AbstractCegarLoop]: === Iteration 116 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 02:24:33,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1803980564, now seen corresponding path program 2 times [2018-02-04 02:24:33,108 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:24:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:24:33,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:24:34,597 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:24:34,598 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:24:34,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-04 02:24:34,598 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:24:34,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:24:34,598 INFO L182 omatonBuilderFactory]: Interpolants [237139#false, 237138#true, 237143#(and (not (= main_~tree~0.base |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|) (= 0 main_~tree~0.offset)), 237142#(and (= 1 (select |#valid| main_~tree~0.base)) (= 0 main_~tree~0.offset)), 237141#(= 0 main_~tree~0.offset), 237140#(= 0 |main_#t~malloc0.offset|), 237147#(and (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (= 1 (select |#valid| main_~tmpList~0.base)) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 237146#(and (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base |main_#t~malloc9.base|)) (= 1 (select |#valid| |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 237145#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base |main_#t~mem5.base|)) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 237144#(and (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 237151#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base |main_#t~malloc9.base|)) (= |main_#t~malloc9.offset| 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) |main_#t~malloc9.base|)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (not (= |main_#t~malloc9.base| 0))), 237150#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 237149#(and (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 1 (select |#valid| main_~tmpList~0.base)) (not (= main_~tree~0.base main_~tmpList~0.base)) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= (select |#valid| main_~tree~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem13.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) |main_#t~mem13.offset| main_~tmpList~0.offset)) main_~tree~0.base) (+ main_~tree~0.offset 8)))), 237148#(and (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (= 1 (select |#valid| main_~tmpList~0.base)) (not (= main_~tree~0.base main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= (select |#valid| main_~tree~0.base) 1)), 237155#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= main_~tmpList~0.base 0)) (not (= main_~tree~0.base main_~tmpList~0.base)) (= main_~tmpList~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset) main_~tmpList~0.base))), 237154#(and (= 1 (select |#valid| |main_#t~mem12.base|)) (not (= main_~tmpList~0.base 0)) (not (= main_~tree~0.base main_~tmpList~0.base)) (= main_~tmpList~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~tmpList~0.base (store (select |#memory_$Pointer$.offset| main_~tmpList~0.base) main_~tmpList~0.offset |main_#t~mem12.offset|)) main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= |main_#t~mem12.base| main_~tmpList~0.base))), 237153#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (not (= main_~tmpList~0.base 0)) (not (= main_~tree~0.base main_~tmpList~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem10.base|) |main_#t~mem10.offset|))) (= main_~tmpList~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem10.base|) |main_#t~mem10.offset|) main_~tmpList~0.base)) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 237152#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))))) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) main_~tmpList~0.base)) (not (= main_~tmpList~0.base 0)) (not (= main_~tree~0.base main_~tmpList~0.base)) (= main_~tmpList~0.offset 0) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 237159#(and (= |main_#t~mem57.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (or (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) 0)))) (and (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmp~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0) 0)) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)), 237158#(and (or (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) 0)))) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmp~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0) 0)) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)), 237157#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0) 0)) (= (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (or (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0)) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0)) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8))) 0)) 0))))) (not (= main_~tree~0.base (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)))) (= 0 main_~tree~0.offset)), 237156#(and (or (= main_~tmpList~0.base |main_#t~mem13.base|) (and (not (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem13.base| (store (select |#memory_$Pointer$.base| |main_#t~mem13.base|) |main_#t~mem13.offset| main_~tmpList~0.base)) main_~tmpList~0.base) main_~tmpList~0.offset) main_~tmpList~0.base)) (= main_~tmpList~0.offset 0) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem13.base| (store (select |#memory_$Pointer$.base| |main_#t~mem13.base|) |main_#t~mem13.offset| main_~tmpList~0.base)) main_~tmpList~0.base) main_~tmpList~0.offset))))) (not (= main_~tmpList~0.base 0)) (not (= main_~tree~0.base main_~tmpList~0.base)) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~tree~0.base) (+ main_~tree~0.offset 8))) (= 0 main_~tree~0.offset) (not (= main_~tree~0.base |main_#t~mem13.base|)) (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem13.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) |main_#t~mem13.offset| main_~tmpList~0.offset)) main_~tree~0.base) (+ main_~tree~0.offset 8)) 0) (= (select (select |#memory_$Pointer$.base| main_~tree~0.base) (+ main_~tree~0.offset 8)) |main_#t~mem13.base|)), 237163#(and (or (and (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem59.base|) 0) 0)) (or (not (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem59.base|) |main_#t~mem59.offset|))) (and (= |main_#t~mem59.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem59.base|) |main_#t~mem59.offset|)) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem59.base|) |main_#t~mem59.offset|)) 0))))) (= |main_#t~mem59.offset| (select (select |#memory_$Pointer$.offset| |main_#t~mem59.base|) |main_#t~mem59.offset|))) (and (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) (not (= (select (select |#memory_$Pointer$.offset| |main_#t~mem59.base|) |main_#t~mem59.offset|) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmp~0.offset 0)), 237162#(and (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmp~0.offset 0) (or (and (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (or (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) 0)))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0) 0))))), 237161#(and (= |main_#t~mem57.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (or (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) 0)))) (and (= |main_#t~mem58.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmp~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0) 0)) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0) (= |main_#t~mem58.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))), 237160#(and (= |main_#t~mem57.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (or (and (= |main_#t~mem56.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0)) 0)))) (and (= |main_#t~mem56.offset| |main_#t~mem57.offset|) (= (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) (select (select |#memory_$Pointer$.base| |main_#t~mem56.base|) 0)) (= |main_#t~mem57.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmp~0.offset 0) (= |main_#t~mem56.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) 0) 0)) (= (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8)) 0)), 237167#(and (or (not (= 0 main_~tmpList~0.offset)) (and (not (= main_~tmpList~0.base 0)) (= main_~tmp~0.offset 0) (= 1 (select (store |#valid| main_~tmpList~0.base 0) |main_#t~mem63.base|)) (= |main_#t~mem61.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem61.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (not (= main_~tmp~0.base |main_#t~mem61.base|))), 237166#(and (not (= main_~tmp~0.base |main_#t~mem61.base|)) (or (not (= 0 main_~tmpList~0.offset)) (and (= main_~tmp~0.offset 0) (not (= main_~tmpList~0.base 0)) (= 1 (select (store |#valid| main_~tmpList~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset))) (= |main_#t~mem61.offset| (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (= |main_#t~mem61.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))))), 237165#(and (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (or (not (= 0 main_~tmpList~0.offset)) (and (= main_~tmp~0.offset 0) (not (= main_~tmpList~0.base 0)) (= 1 (select (store |#valid| main_~tmpList~0.base 0) (select (select |#memory_$Pointer$.base| main_~tmpList~0.base) main_~tmpList~0.offset)))))), 237164#(and (not (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8)))) (= main_~tmp~0.offset 0) (or (not (= 0 |main_#t~mem60.offset|)) (not (= |main_#t~mem60.base| 0))) (or (not (= 0 |main_#t~mem60.offset|)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem60.base|) 0))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem60.base|) 0) |main_#t~mem60.base|))))), 237171#(and (= 1 (select |#valid| |main_#t~mem60.base|)) (= main_~tmp~0.offset 0)), 237170#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem59.base|) |main_#t~mem59.offset|))) (= main_~tmp~0.offset 0)), 237169#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (= main_~tmp~0.offset 0)), 237168#(or (not (= 0 main_~tmpList~0.offset)) (and (= 1 (select (store |#valid| main_~tmpList~0.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 8))) (select (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 8))))) (= main_~tmp~0.offset 0) (not (= main_~tmpList~0.base 0)))), 237173#(= 1 (select |#valid| main_~tmpList~0.base)), 237172#(and (= 1 (select |#valid| main_~tmpList~0.base)) (= main_~tmp~0.offset 0))] [2018-02-04 02:24:34,598 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:24:34,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 02:24:34,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 02:24:34,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1156, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 02:24:34,599 INFO L87 Difference]: Start difference. First operand 1892 states and 2444 transitions. Second operand 36 states. Received shutdown request... [2018-02-04 02:24:35,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 02:24:35,108 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 02:24:35,112 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 02:24:35,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:24:35 BoogieIcfgContainer [2018-02-04 02:24:35,112 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 02:24:35,113 INFO L168 Benchmark]: Toolchain (without parser) took 178756.37 ms. Allocated memory was 402.1 MB in the beginning and 884.5 MB in the end (delta: 482.3 MB). Free memory was 358.8 MB in the beginning and 713.4 MB in the end (delta: -354.6 MB). Peak memory consumption was 127.8 MB. Max. memory is 5.3 GB. [2018-02-04 02:24:35,113 INFO L168 Benchmark]: CDTParser took 1.16 ms. Allocated memory is still 402.1 MB. Free memory is still 364.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 02:24:35,114 INFO L168 Benchmark]: CACSL2BoogieTranslator took 171.67 ms. Allocated memory is still 402.1 MB. Free memory was 358.8 MB in the beginning and 345.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 02:24:35,114 INFO L168 Benchmark]: Boogie Preprocessor took 29.23 ms. Allocated memory is still 402.1 MB. Free memory is still 345.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 02:24:35,114 INFO L168 Benchmark]: RCFGBuilder took 461.35 ms. Allocated memory is still 402.1 MB. Free memory was 345.6 MB in the beginning and 288.7 MB in the end (delta: 56.9 MB). Peak memory consumption was 56.9 MB. Max. memory is 5.3 GB. [2018-02-04 02:24:35,114 INFO L168 Benchmark]: TraceAbstraction took 178090.85 ms. Allocated memory was 402.1 MB in the beginning and 884.5 MB in the end (delta: 482.3 MB). Free memory was 288.7 MB in the beginning and 713.4 MB in the end (delta: -424.7 MB). Peak memory consumption was 57.7 MB. Max. memory is 5.3 GB. [2018-02-04 02:24:35,115 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.16 ms. Allocated memory is still 402.1 MB. Free memory is still 364.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 171.67 ms. Allocated memory is still 402.1 MB. Free memory was 358.8 MB in the beginning and 345.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.23 ms. Allocated memory is still 402.1 MB. Free memory is still 345.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 461.35 ms. Allocated memory is still 402.1 MB. Free memory was 345.6 MB in the beginning and 288.7 MB in the end (delta: 56.9 MB). Peak memory consumption was 56.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 178090.85 ms. Allocated memory was 402.1 MB in the beginning and 884.5 MB in the end (delta: 482.3 MB). Free memory was 288.7 MB in the beginning and 713.4 MB in the end (delta: -424.7 MB). Peak memory consumption was 57.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 709). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 703). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 722). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 720). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 722). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 720). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 722). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 722). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 692). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 703). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 723). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 692). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 705). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 709). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 723). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 705). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (1892states) and interpolant automaton (currently 13 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 220 locations, 101 error locations. TIMEOUT Result, 178.0s OverallTime, 116 OverallIterations, 3 TraceHistogramMax, 144.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 20979 SDtfs, 118247 SDslu, 146012 SDs, 0 SdLazy, 157187 SolverSat, 10707 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 63.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4038 GetRequests, 222 SyntacticMatches, 195 SemanticMatches, 3620 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47051 ImplicationChecksByTransitivity, 92.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1892occurred in iteration=115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 131/567 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 115 MinimizatonAttempts, 51384 StatesRemovedByMinimization, 106 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 30.6s InterpolantComputationTime, 6006 NumberOfCodeBlocks, 6006 NumberOfCodeBlocksAsserted, 116 NumberOfCheckSat, 5890 ConstructedInterpolants, 0 QuantifiedInterpolants, 6483271 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 116 InterpolantComputations, 51 PerfectInterpolantSequences, 131/567 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/tree_of_cslls_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_02-24-35-124.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_of_cslls_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_02-24-35-124.csv Completed graceful shutdown