java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_of_cslls_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:01:13,281 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:01:13,282 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:01:13,292 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:01:13,292 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:01:13,293 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:01:13,294 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:01:13,295 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:01:13,296 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:01:13,297 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:01:13,298 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:01:13,298 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:01:13,299 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:01:13,300 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:01:13,301 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:01:13,302 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:01:13,304 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:01:13,305 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:01:13,306 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:01:13,307 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:01:13,309 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:01:13,309 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:01:13,309 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:01:13,310 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:01:13,311 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:01:13,312 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:01:13,312 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:01:13,312 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:01:13,313 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:01:13,313 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:01:13,313 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:01:13,313 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 10:01:13,323 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:01:13,323 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:01:13,324 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:01:13,325 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:01:13,325 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:01:13,325 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:01:13,325 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:01:13,325 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:01:13,325 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:01:13,325 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:01:13,326 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:01:13,326 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:01:13,326 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:01:13,326 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:01:13,326 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:01:13,326 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:01:13,327 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:01:13,327 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:01:13,327 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:01:13,327 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:01:13,327 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:01:13,327 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:01:13,327 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:01:13,358 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:01:13,368 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:01:13,371 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:01:13,372 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:01:13,372 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:01:13,373 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-02 10:01:13,510 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:01:13,512 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:01:13,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:01:13,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:01:13,517 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:01:13,518 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:01:13" (1/1) ... [2018-02-02 10:01:13,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3390db28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:01:13, skipping insertion in model container [2018-02-02 10:01:13,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:01:13" (1/1) ... [2018-02-02 10:01:13,534 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:01:13,562 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:01:13,662 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:01:13,677 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:01:13,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:01:13 WrapperNode [2018-02-02 10:01:13,683 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:01:13,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:01:13,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:01:13,684 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:01:13,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:01:13" (1/1) ... [2018-02-02 10:01:13,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:01:13" (1/1) ... [2018-02-02 10:01:13,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:01:13" (1/1) ... [2018-02-02 10:01:13,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:01:13" (1/1) ... [2018-02-02 10:01:13,706 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:01:13" (1/1) ... [2018-02-02 10:01:13,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:01:13" (1/1) ... [2018-02-02 10:01:13,710 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:01:13" (1/1) ... [2018-02-02 10:01:13,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:01:13,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:01:13,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:01:13,712 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:01:13,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:01:13" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:01:13,747 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:01:13,748 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:01:13,748 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:01:13,748 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:01:13,748 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:01:13,748 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:01:13,748 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:01:13,748 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:01:13,748 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:01:13,749 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:01:13,749 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:01:13,749 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:01:13,749 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:01:13,749 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:01:14,201 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:01:14,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:01:14 BoogieIcfgContainer [2018-02-02 10:01:14,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:01:14,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:01:14,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:01:14,205 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:01:14,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:01:13" (1/3) ... [2018-02-02 10:01:14,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3465e389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:01:14, skipping insertion in model container [2018-02-02 10:01:14,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:01:13" (2/3) ... [2018-02-02 10:01:14,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3465e389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:01:14, skipping insertion in model container [2018-02-02 10:01:14,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:01:14" (3/3) ... [2018-02-02 10:01:14,208 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_of_cslls_true-valid-memsafety.i [2018-02-02 10:01:14,215 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:01:14,219 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 101 error locations. [2018-02-02 10:01:14,249 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:01:14,249 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:01:14,249 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:01:14,249 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:01:14,250 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:01:14,250 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:01:14,250 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:01:14,250 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:01:14,251 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:01:14,265 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states. [2018-02-02 10:01:14,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:01:14,274 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:14,275 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:14,275 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-02 10:01:14,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1603684078, now seen corresponding path program 1 times [2018-02-02 10:01:14,329 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:14,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:14,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:14,417 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:14,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:01:14,418 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:14,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-02 10:01:14,419 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-02 10:01:14,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-02 10:01:14,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:01:14,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:01:14,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:01:14,435 INFO L87 Difference]: Start difference. First operand 220 states. Second operand 4 states. [2018-02-02 10:01:14,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:14,794 INFO L93 Difference]: Finished difference Result 325 states and 349 transitions. [2018-02-02 10:01:14,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:01:14,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:01:14,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:14,806 INFO L225 Difference]: With dead ends: 325 [2018-02-02 10:01:14,807 INFO L226 Difference]: Without dead ends: 321 [2018-02-02 10:01:14,808 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:01:14,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-02-02 10:01:14,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 208. [2018-02-02 10:01:14,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 10:01:14,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 224 transitions. [2018-02-02 10:01:14,838 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 224 transitions. Word has length 8 [2018-02-02 10:01:14,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:14,838 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 224 transitions. [2018-02-02 10:01:14,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:01:14,838 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 224 transitions. [2018-02-02 10:01:14,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:01:14,839 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:14,839 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:14,839 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-02 10:01:14,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1603684077, now seen corresponding path program 1 times [2018-02-02 10:01:14,839 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:14,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:14,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-02 10:01:14,920 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:14,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:01:14,920 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:14,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-02 10:01:14,921 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-02 10:01:14,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-02 10:01:14,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:01:14,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:01:14,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:01:14,922 INFO L87 Difference]: Start difference. First operand 208 states and 224 transitions. Second operand 4 states. [2018-02-02 10:01:15,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:15,108 INFO L93 Difference]: Finished difference Result 206 states and 222 transitions. [2018-02-02 10:01:15,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:01:15,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:01:15,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:15,110 INFO L225 Difference]: With dead ends: 206 [2018-02-02 10:01:15,111 INFO L226 Difference]: Without dead ends: 206 [2018-02-02 10:01:15,111 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:01:15,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-02 10:01:15,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-02-02 10:01:15,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 10:01:15,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 222 transitions. [2018-02-02 10:01:15,120 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 222 transitions. Word has length 8 [2018-02-02 10:01:15,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:15,120 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 222 transitions. [2018-02-02 10:01:15,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:01:15,120 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 222 transitions. [2018-02-02 10:01:15,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-02 10:01:15,121 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:15,121 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:15,121 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-02 10:01:15,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1863813244, now seen corresponding path program 1 times [2018-02-02 10:01:15,122 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:15,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:15,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:15,184 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:15,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:01:15,184 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:15,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:15,185 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-02 10:01:15,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:15,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:01:15,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:01:15,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:01:15,185 INFO L87 Difference]: Start difference. First operand 206 states and 222 transitions. Second operand 5 states. [2018-02-02 10:01:15,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:15,506 INFO L93 Difference]: Finished difference Result 355 states and 383 transitions. [2018-02-02 10:01:15,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:01:15,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-02-02 10:01:15,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:15,508 INFO L225 Difference]: With dead ends: 355 [2018-02-02 10:01:15,508 INFO L226 Difference]: Without dead ends: 355 [2018-02-02 10:01:15,508 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-02 10:01:15,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-02-02 10:01:15,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 199. [2018-02-02 10:01:15,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-02 10:01:15,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 215 transitions. [2018-02-02 10:01:15,517 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 215 transitions. Word has length 11 [2018-02-02 10:01:15,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:15,517 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 215 transitions. [2018-02-02 10:01:15,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:01:15,517 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 215 transitions. [2018-02-02 10:01:15,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:01:15,518 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:15,518 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:15,518 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-02 10:01:15,518 INFO L82 PathProgramCache]: Analyzing trace with hash -476893285, now seen corresponding path program 1 times [2018-02-02 10:01:15,519 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:15,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:15,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:15,555 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:15,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:01:15,555 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:15,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-02 10:01:15,556 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-02 10:01:15,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-02 10:01:15,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:01:15,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:01:15,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:01:15,557 INFO L87 Difference]: Start difference. First operand 199 states and 215 transitions. Second operand 5 states. [2018-02-02 10:01:15,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:15,739 INFO L93 Difference]: Finished difference Result 274 states and 296 transitions. [2018-02-02 10:01:15,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:01:15,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 10:01:15,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:15,741 INFO L225 Difference]: With dead ends: 274 [2018-02-02 10:01:15,741 INFO L226 Difference]: Without dead ends: 274 [2018-02-02 10:01:15,741 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-02 10:01:15,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-02-02 10:01:15,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 198. [2018-02-02 10:01:15,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-02 10:01:15,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 214 transitions. [2018-02-02 10:01:15,748 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 214 transitions. Word has length 14 [2018-02-02 10:01:15,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:15,748 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 214 transitions. [2018-02-02 10:01:15,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:01:15,748 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 214 transitions. [2018-02-02 10:01:15,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:01:15,749 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:15,749 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:15,749 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-02 10:01:15,749 INFO L82 PathProgramCache]: Analyzing trace with hash -476893284, now seen corresponding path program 1 times [2018-02-02 10:01:15,750 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:15,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:15,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:15,815 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:15,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:01:15,816 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:15,816 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-02 10:01:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:15,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:01:15,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:01:15,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:01:15,817 INFO L87 Difference]: Start difference. First operand 198 states and 214 transitions. Second operand 5 states. [2018-02-02 10:01:16,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:16,006 INFO L93 Difference]: Finished difference Result 315 states and 345 transitions. [2018-02-02 10:01:16,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:01:16,006 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 10:01:16,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:16,008 INFO L225 Difference]: With dead ends: 315 [2018-02-02 10:01:16,008 INFO L226 Difference]: Without dead ends: 315 [2018-02-02 10:01:16,008 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-02 10:01:16,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-02-02 10:01:16,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 197. [2018-02-02 10:01:16,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-02 10:01:16,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 213 transitions. [2018-02-02 10:01:16,012 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 213 transitions. Word has length 14 [2018-02-02 10:01:16,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:16,012 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 213 transitions. [2018-02-02 10:01:16,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:01:16,012 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 213 transitions. [2018-02-02 10:01:16,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:01:16,013 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:16,013 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-02 10:01:16,013 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-02 10:01:16,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1521405160, now seen corresponding path program 1 times [2018-02-02 10:01:16,014 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:16,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:16,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:16,110 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:16,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:01:16,111 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:16,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:16,111 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-02 10:01:16,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:16,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:01:16,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:01:16,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:01:16,112 INFO L87 Difference]: Start difference. First operand 197 states and 213 transitions. Second operand 8 states. [2018-02-02 10:01:16,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:16,622 INFO L93 Difference]: Finished difference Result 369 states and 405 transitions. [2018-02-02 10:01:16,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:01:16,622 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-02-02 10:01:16,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:16,624 INFO L225 Difference]: With dead ends: 369 [2018-02-02 10:01:16,624 INFO L226 Difference]: Without dead ends: 369 [2018-02-02 10:01:16,624 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 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-02 10:01:16,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-02-02 10:01:16,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 204. [2018-02-02 10:01:16,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-02 10:01:16,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 222 transitions. [2018-02-02 10:01:16,629 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 222 transitions. Word has length 22 [2018-02-02 10:01:16,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:16,630 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 222 transitions. [2018-02-02 10:01:16,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:01:16,630 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 222 transitions. [2018-02-02 10:01:16,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:01:16,630 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:16,631 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-02 10:01:16,632 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-02 10:01:16,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1521405161, now seen corresponding path program 1 times [2018-02-02 10:01:16,633 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:16,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:16,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-02 10:01:16,752 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:16,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:01:16,753 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:16,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:16,753 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-02 10:01:16,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:16,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:01:16,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:01:16,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:01:16,754 INFO L87 Difference]: Start difference. First operand 204 states and 222 transitions. Second operand 8 states. [2018-02-02 10:01:17,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:17,358 INFO L93 Difference]: Finished difference Result 555 states and 611 transitions. [2018-02-02 10:01:17,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:01:17,358 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-02-02 10:01:17,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:17,360 INFO L225 Difference]: With dead ends: 555 [2018-02-02 10:01:17,360 INFO L226 Difference]: Without dead ends: 555 [2018-02-02 10:01:17,360 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-02 10:01:17,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-02-02 10:01:17,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 204. [2018-02-02 10:01:17,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-02 10:01:17,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 221 transitions. [2018-02-02 10:01:17,363 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 221 transitions. Word has length 22 [2018-02-02 10:01:17,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:17,364 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 221 transitions. [2018-02-02 10:01:17,364 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:01:17,364 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 221 transitions. [2018-02-02 10:01:17,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:01:17,364 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:17,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] [2018-02-02 10:01:17,364 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-02 10:01:17,364 INFO L82 PathProgramCache]: Analyzing trace with hash -115400475, now seen corresponding path program 1 times [2018-02-02 10:01:17,365 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:17,370 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:17,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:17,389 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:17,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:01:17,389 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:17,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:17,390 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-02 10:01:17,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:17,390 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:01:17,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:01:17,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:01:17,390 INFO L87 Difference]: Start difference. First operand 204 states and 221 transitions. Second operand 4 states. [2018-02-02 10:01:17,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:17,521 INFO L93 Difference]: Finished difference Result 273 states and 297 transitions. [2018-02-02 10:01:17,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:01:17,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-02 10:01:17,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:17,522 INFO L225 Difference]: With dead ends: 273 [2018-02-02 10:01:17,523 INFO L226 Difference]: Without dead ends: 273 [2018-02-02 10:01:17,523 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-02 10:01:17,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-02-02 10:01:17,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 197. [2018-02-02 10:01:17,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-02 10:01:17,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 218 transitions. [2018-02-02 10:01:17,527 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 218 transitions. Word has length 23 [2018-02-02 10:01:17,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:17,527 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 218 transitions. [2018-02-02 10:01:17,527 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:01:17,527 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2018-02-02 10:01:17,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:01:17,528 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:17,528 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:17,528 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-02 10:01:17,528 INFO L82 PathProgramCache]: Analyzing trace with hash -115400474, now seen corresponding path program 1 times [2018-02-02 10:01:17,529 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:17,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:17,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:17,586 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:17,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:01:17,586 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:17,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:17,586 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-02 10:01:17,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:17,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:01:17,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:01:17,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:01:17,587 INFO L87 Difference]: Start difference. First operand 197 states and 218 transitions. Second operand 6 states. [2018-02-02 10:01:17,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:17,801 INFO L93 Difference]: Finished difference Result 464 states and 518 transitions. [2018-02-02 10:01:17,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:01:17,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-02 10:01:17,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:17,803 INFO L225 Difference]: With dead ends: 464 [2018-02-02 10:01:17,804 INFO L226 Difference]: Without dead ends: 464 [2018-02-02 10:01:17,804 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-02 10:01:17,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-02-02 10:01:17,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 346. [2018-02-02 10:01:17,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-02-02 10:01:17,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 473 transitions. [2018-02-02 10:01:17,811 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 473 transitions. Word has length 23 [2018-02-02 10:01:17,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:17,811 INFO L432 AbstractCegarLoop]: Abstraction has 346 states and 473 transitions. [2018-02-02 10:01:17,811 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:01:17,811 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 473 transitions. [2018-02-02 10:01:17,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:01:17,812 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:17,812 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:17,812 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-02 10:01:17,812 INFO L82 PathProgramCache]: Analyzing trace with hash -81080279, now seen corresponding path program 1 times [2018-02-02 10:01:17,813 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:17,822 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:17,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:17,866 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:17,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:01:17,866 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:17,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:17,867 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-02 10:01:17,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:17,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:01:17,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:01:17,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:01:17,868 INFO L87 Difference]: Start difference. First operand 346 states and 473 transitions. Second operand 4 states. [2018-02-02 10:01:18,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:18,123 INFO L93 Difference]: Finished difference Result 701 states and 998 transitions. [2018-02-02 10:01:18,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:01:18,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-02 10:01:18,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:18,127 INFO L225 Difference]: With dead ends: 701 [2018-02-02 10:01:18,127 INFO L226 Difference]: Without dead ends: 701 [2018-02-02 10:01:18,128 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-02 10:01:18,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-02-02 10:01:18,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 345. [2018-02-02 10:01:18,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-02-02 10:01:18,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 472 transitions. [2018-02-02 10:01:18,136 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 472 transitions. Word has length 23 [2018-02-02 10:01:18,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:18,136 INFO L432 AbstractCegarLoop]: Abstraction has 345 states and 472 transitions. [2018-02-02 10:01:18,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:01:18,136 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 472 transitions. [2018-02-02 10:01:18,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:01:18,137 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:18,137 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:18,137 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-02 10:01:18,137 INFO L82 PathProgramCache]: Analyzing trace with hash -81080280, now seen corresponding path program 1 times [2018-02-02 10:01:18,138 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:18,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:18,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:18,172 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:18,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:01:18,172 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01: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-02 10:01:18,172 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-02 10:01: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-02 10:01:18,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:01:18,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:01:18,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:01:18,173 INFO L87 Difference]: Start difference. First operand 345 states and 472 transitions. Second operand 4 states. [2018-02-02 10:01:18,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:18,418 INFO L93 Difference]: Finished difference Result 861 states and 1188 transitions. [2018-02-02 10:01:18,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:01:18,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-02 10:01:18,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:18,424 INFO L225 Difference]: With dead ends: 861 [2018-02-02 10:01:18,424 INFO L226 Difference]: Without dead ends: 861 [2018-02-02 10:01:18,424 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-02 10:01:18,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-02-02 10:01:18,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 343. [2018-02-02 10:01:18,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-02-02 10:01:18,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 467 transitions. [2018-02-02 10:01:18,433 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 467 transitions. Word has length 23 [2018-02-02 10:01:18,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:18,433 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 467 transitions. [2018-02-02 10:01:18,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:01:18,434 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 467 transitions. [2018-02-02 10:01:18,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:01:18,434 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:18,434 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-02 10:01:18,434 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-02 10:01:18,435 INFO L82 PathProgramCache]: Analyzing trace with hash 771701702, now seen corresponding path program 1 times [2018-02-02 10:01:18,435 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:18,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:18,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:18,472 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:18,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:01:18,473 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:18,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:18,473 INFO L182 omatonBuilderFactory]: Interpolants [7681#true, 7682#false, 7683#(not (= 0 |main_#t~malloc0.base|)), 7684#(not (= 0 main_~tree~0.base))] [2018-02-02 10:01:18,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:18,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:01:18,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:01:18,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:01:18,474 INFO L87 Difference]: Start difference. First operand 343 states and 467 transitions. Second operand 4 states. [2018-02-02 10:01:18,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:18,496 INFO L93 Difference]: Finished difference Result 413 states and 541 transitions. [2018-02-02 10:01:18,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:01:18,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-02-02 10:01:18,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:18,498 INFO L225 Difference]: With dead ends: 413 [2018-02-02 10:01:18,499 INFO L226 Difference]: Without dead ends: 413 [2018-02-02 10:01:18,499 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-02 10:01:18,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-02-02 10:01:18,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 382. [2018-02-02 10:01:18,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-02 10:01:18,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 541 transitions. [2018-02-02 10:01:18,506 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 541 transitions. Word has length 25 [2018-02-02 10:01:18,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:18,506 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 541 transitions. [2018-02-02 10:01:18,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:01:18,506 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 541 transitions. [2018-02-02 10:01:18,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:01:18,507 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:18,507 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-02 10:01:18,507 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-02 10:01:18,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1690982226, now seen corresponding path program 1 times [2018-02-02 10:01:18,508 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:18,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:18,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-02 10:01:18,575 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:18,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:01:18,575 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:18,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-02 10:01:18,576 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-02 10:01:18,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-02 10:01:18,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:01:18,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:01:18,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:01:18,576 INFO L87 Difference]: Start difference. First operand 382 states and 541 transitions. Second operand 9 states. [2018-02-02 10:01:19,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:19,099 INFO L93 Difference]: Finished difference Result 1251 states and 1782 transitions. [2018-02-02 10:01:19,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:01:19,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-02-02 10:01:19,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:19,102 INFO L225 Difference]: With dead ends: 1251 [2018-02-02 10:01:19,102 INFO L226 Difference]: Without dead ends: 1251 [2018-02-02 10:01:19,103 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-02 10:01:19,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2018-02-02 10:01:19,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 381. [2018-02-02 10:01:19,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-02-02 10:01:19,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 540 transitions. [2018-02-02 10:01:19,114 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 540 transitions. Word has length 26 [2018-02-02 10:01:19,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:19,114 INFO L432 AbstractCegarLoop]: Abstraction has 381 states and 540 transitions. [2018-02-02 10:01:19,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:01:19,114 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 540 transitions. [2018-02-02 10:01:19,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:01:19,115 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:19,115 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-02 10:01:19,115 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-02 10:01:19,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1690982225, now seen corresponding path program 1 times [2018-02-02 10:01:19,116 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:19,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:19,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:19,199 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:19,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:01:19,199 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:19,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:19,200 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-02 10:01:19,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:19,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:01:19,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:01:19,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:01:19,201 INFO L87 Difference]: Start difference. First operand 381 states and 540 transitions. Second operand 9 states. [2018-02-02 10:01:19,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:19,709 INFO L93 Difference]: Finished difference Result 1250 states and 1781 transitions. [2018-02-02 10:01:19,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:01:19,710 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-02-02 10:01:19,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:19,712 INFO L225 Difference]: With dead ends: 1250 [2018-02-02 10:01:19,712 INFO L226 Difference]: Without dead ends: 1250 [2018-02-02 10:01:19,713 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-02 10:01:19,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2018-02-02 10:01:19,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 380. [2018-02-02 10:01:19,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-02-02 10:01:19,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 539 transitions. [2018-02-02 10:01:19,719 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 539 transitions. Word has length 26 [2018-02-02 10:01:19,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:19,719 INFO L432 AbstractCegarLoop]: Abstraction has 380 states and 539 transitions. [2018-02-02 10:01:19,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:01:19,719 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 539 transitions. [2018-02-02 10:01:19,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:01:19,720 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:19,720 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:19,720 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-02 10:01:19,720 INFO L82 PathProgramCache]: Analyzing trace with hash -679017658, now seen corresponding path program 1 times [2018-02-02 10:01:19,721 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:19,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:19,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:19,737 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:19,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:01:19,737 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:19,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:19,737 INFO L182 omatonBuilderFactory]: Interpolants [11798#true, 11799#false, 11800#|main_#t~short49|] [2018-02-02 10:01:19,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:19,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:01:19,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:01:19,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:01:19,738 INFO L87 Difference]: Start difference. First operand 380 states and 539 transitions. Second operand 3 states. [2018-02-02 10:01:19,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:19,744 INFO L93 Difference]: Finished difference Result 384 states and 543 transitions. [2018-02-02 10:01:19,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:01:19,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-02-02 10:01:19,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:19,745 INFO L225 Difference]: With dead ends: 384 [2018-02-02 10:01:19,745 INFO L226 Difference]: Without dead ends: 384 [2018-02-02 10:01:19,745 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:01:19,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-02-02 10:01:19,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2018-02-02 10:01:19,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-02-02 10:01:19,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 543 transitions. [2018-02-02 10:01:19,749 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 543 transitions. Word has length 30 [2018-02-02 10:01:19,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:19,749 INFO L432 AbstractCegarLoop]: Abstraction has 384 states and 543 transitions. [2018-02-02 10:01:19,749 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:01:19,750 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 543 transitions. [2018-02-02 10:01:19,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:01:19,750 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:19,750 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-02 10:01:19,750 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-02 10:01:19,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1240786582, now seen corresponding path program 1 times [2018-02-02 10:01:19,751 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:19,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:19,763 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-02 10:01:19,763 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:19,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:01:19,764 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:19,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:19,764 INFO L182 omatonBuilderFactory]: Interpolants [12569#true, 12570#false, 12571#(not |main_#t~short18|)] [2018-02-02 10:01:19,764 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-02 10:01:19,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:01:19,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:01:19,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:01:19,765 INFO L87 Difference]: Start difference. First operand 384 states and 543 transitions. Second operand 3 states. [2018-02-02 10:01:19,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:19,770 INFO L93 Difference]: Finished difference Result 387 states and 546 transitions. [2018-02-02 10:01:19,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:01:19,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-02-02 10:01:19,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:19,771 INFO L225 Difference]: With dead ends: 387 [2018-02-02 10:01:19,771 INFO L226 Difference]: Without dead ends: 387 [2018-02-02 10:01:19,771 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:01:19,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-02-02 10:01:19,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2018-02-02 10:01:19,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-02-02 10:01:19,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 546 transitions. [2018-02-02 10:01:19,775 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 546 transitions. Word has length 31 [2018-02-02 10:01:19,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:19,775 INFO L432 AbstractCegarLoop]: Abstraction has 387 states and 546 transitions. [2018-02-02 10:01:19,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:01:19,775 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 546 transitions. [2018-02-02 10:01:19,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 10:01:19,775 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:19,776 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:19,776 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-02 10:01:19,776 INFO L82 PathProgramCache]: Analyzing trace with hash 348971873, now seen corresponding path program 1 times [2018-02-02 10:01:19,776 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:19,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:19,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:19,791 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:19,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:01:19,791 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:19,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:19,792 INFO L182 omatonBuilderFactory]: Interpolants [13346#true, 13347#false, 13348#(and (= main_~pred~0.base 0) (= main_~pred~0.offset 0))] [2018-02-02 10:01:19,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:19,792 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:01:19,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:01:19,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:01:19,793 INFO L87 Difference]: Start difference. First operand 387 states and 546 transitions. Second operand 3 states. [2018-02-02 10:01:19,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:19,807 INFO L93 Difference]: Finished difference Result 428 states and 574 transitions. [2018-02-02 10:01:19,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:01:19,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-02-02 10:01:19,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:19,809 INFO L225 Difference]: With dead ends: 428 [2018-02-02 10:01:19,809 INFO L226 Difference]: Without dead ends: 428 [2018-02-02 10:01:19,810 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:01:19,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-02-02 10:01:19,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 379. [2018-02-02 10:01:19,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-02-02 10:01:19,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 526 transitions. [2018-02-02 10:01:19,815 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 526 transitions. Word has length 32 [2018-02-02 10:01:19,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:19,815 INFO L432 AbstractCegarLoop]: Abstraction has 379 states and 526 transitions. [2018-02-02 10:01:19,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:01:19,816 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 526 transitions. [2018-02-02 10:01:19,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 10:01:19,816 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:19,816 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-02 10:01:19,816 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-02 10:01:19,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1663635795, now seen corresponding path program 1 times [2018-02-02 10:01:19,817 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:19,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:19,986 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-02 10:01:19,987 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:19,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 10:01:19,987 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:19,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-02 10:01:19,987 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-02 10:01:19,988 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-02 10:01:19,988 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:01:19,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:01:19,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:01:19,988 INFO L87 Difference]: Start difference. First operand 379 states and 526 transitions. Second operand 10 states. [2018-02-02 10:01:20,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:20,477 INFO L93 Difference]: Finished difference Result 605 states and 777 transitions. [2018-02-02 10:01:20,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:01:20,477 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-02-02 10:01:20,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:20,478 INFO L225 Difference]: With dead ends: 605 [2018-02-02 10:01:20,478 INFO L226 Difference]: Without dead ends: 605 [2018-02-02 10:01:20,479 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:01:20,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-02-02 10:01:20,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 396. [2018-02-02 10:01:20,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-02-02 10:01:20,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 548 transitions. [2018-02-02 10:01:20,485 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 548 transitions. Word has length 33 [2018-02-02 10:01:20,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:20,485 INFO L432 AbstractCegarLoop]: Abstraction has 396 states and 548 transitions. [2018-02-02 10:01:20,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:01:20,485 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 548 transitions. [2018-02-02 10:01:20,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:01:20,486 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:20,486 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-02 10:01:20,486 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-02 10:01:20,486 INFO L82 PathProgramCache]: Analyzing trace with hash 768774257, now seen corresponding path program 1 times [2018-02-02 10:01:20,487 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:20,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:20,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:20,716 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:20,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:01:20,716 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:20,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-02 10:01:20,716 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-02 10:01:20,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:20,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:01:20,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:01:20,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:01:20,717 INFO L87 Difference]: Start difference. First operand 396 states and 548 transitions. Second operand 14 states. [2018-02-02 10:01:21,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:21,731 INFO L93 Difference]: Finished difference Result 609 states and 779 transitions. [2018-02-02 10:01:21,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:01:21,732 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-02-02 10:01:21,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:21,733 INFO L225 Difference]: With dead ends: 609 [2018-02-02 10:01:21,733 INFO L226 Difference]: Without dead ends: 609 [2018-02-02 10:01:21,733 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-02 10:01:21,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2018-02-02 10:01:21,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 441. [2018-02-02 10:01:21,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-02-02 10:01:21,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 623 transitions. [2018-02-02 10:01:21,737 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 623 transitions. Word has length 34 [2018-02-02 10:01:21,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:21,738 INFO L432 AbstractCegarLoop]: Abstraction has 441 states and 623 transitions. [2018-02-02 10:01:21,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:01:21,738 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 623 transitions. [2018-02-02 10:01:21,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:01:21,738 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:21,738 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-02 10:01:21,738 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-02 10:01:21,738 INFO L82 PathProgramCache]: Analyzing trace with hash -700463843, now seen corresponding path program 1 times [2018-02-02 10:01:21,739 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:21,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:21,865 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:21,865 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:21,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:01:21,866 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:21,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:21,866 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-02 10:01:21,866 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:21,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:01:21,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:01:21,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:01:21,867 INFO L87 Difference]: Start difference. First operand 441 states and 623 transitions. Second operand 13 states. [2018-02-02 10:01:22,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:22,345 INFO L93 Difference]: Finished difference Result 751 states and 986 transitions. [2018-02-02 10:01:22,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:01:22,345 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-02-02 10:01:22,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:22,346 INFO L225 Difference]: With dead ends: 751 [2018-02-02 10:01:22,346 INFO L226 Difference]: Without dead ends: 751 [2018-02-02 10:01:22,347 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-02 10:01:22,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2018-02-02 10:01:22,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 440. [2018-02-02 10:01:22,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-02-02 10:01:22,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 622 transitions. [2018-02-02 10:01:22,351 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 622 transitions. Word has length 34 [2018-02-02 10:01:22,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:22,351 INFO L432 AbstractCegarLoop]: Abstraction has 440 states and 622 transitions. [2018-02-02 10:01:22,351 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:01:22,351 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 622 transitions. [2018-02-02 10:01:22,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:01:22,351 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:22,352 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-02 10:01:22,352 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-02 10:01:22,352 INFO L82 PathProgramCache]: Analyzing trace with hash -700463842, now seen corresponding path program 1 times [2018-02-02 10:01:22,353 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:22,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:22,564 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:22,565 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:22,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:01:22,565 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:22,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:22,566 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-02 10:01:22,566 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:22,566 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:01:22,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:01:22,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:01:22,566 INFO L87 Difference]: Start difference. First operand 440 states and 622 transitions. Second operand 14 states. [2018-02-02 10:01:23,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:23,356 INFO L93 Difference]: Finished difference Result 750 states and 985 transitions. [2018-02-02 10:01:23,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:01:23,356 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-02-02 10:01:23,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:23,357 INFO L225 Difference]: With dead ends: 750 [2018-02-02 10:01:23,357 INFO L226 Difference]: Without dead ends: 750 [2018-02-02 10:01:23,358 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:01:23,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-02-02 10:01:23,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 435. [2018-02-02 10:01:23,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-02-02 10:01:23,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 617 transitions. [2018-02-02 10:01:23,364 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 617 transitions. Word has length 34 [2018-02-02 10:01:23,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:23,364 INFO L432 AbstractCegarLoop]: Abstraction has 435 states and 617 transitions. [2018-02-02 10:01:23,364 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:01:23,364 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 617 transitions. [2018-02-02 10:01:23,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:01:23,364 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:23,365 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:23,365 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-02 10:01:23,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1878204096, now seen corresponding path program 1 times [2018-02-02 10:01:23,365 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:23,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:23,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:23,480 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:23,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 10:01:23,480 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:23,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:23,480 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-02 10:01:23,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:23,480 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:01:23,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:01:23,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:01:23,481 INFO L87 Difference]: Start difference. First operand 435 states and 617 transitions. Second operand 11 states. [2018-02-02 10:01:23,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:23,881 INFO L93 Difference]: Finished difference Result 670 states and 884 transitions. [2018-02-02 10:01:23,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:01:23,881 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-02-02 10:01:23,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:23,882 INFO L225 Difference]: With dead ends: 670 [2018-02-02 10:01:23,882 INFO L226 Difference]: Without dead ends: 670 [2018-02-02 10:01:23,883 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:01:23,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-02-02 10:01:23,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 445. [2018-02-02 10:01:23,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-02-02 10:01:23,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 629 transitions. [2018-02-02 10:01:23,886 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 629 transitions. Word has length 35 [2018-02-02 10:01:23,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:23,886 INFO L432 AbstractCegarLoop]: Abstraction has 445 states and 629 transitions. [2018-02-02 10:01:23,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:01:23,886 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 629 transitions. [2018-02-02 10:01:23,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:01:23,887 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:23,887 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:23,887 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-02 10:01:23,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1878204095, now seen corresponding path program 1 times [2018-02-02 10:01:23,887 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:23,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:23,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-02 10:01:23,997 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:23,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:01:23,997 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:23,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-02 10:01:23,997 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-02 10:01:23,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-02 10:01:23,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:01:23,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:01:23,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:01:23,997 INFO L87 Difference]: Start difference. First operand 445 states and 629 transitions. Second operand 9 states. [2018-02-02 10:01:24,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:24,580 INFO L93 Difference]: Finished difference Result 855 states and 1135 transitions. [2018-02-02 10:01:24,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:01:24,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-02-02 10:01:24,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:24,582 INFO L225 Difference]: With dead ends: 855 [2018-02-02 10:01:24,582 INFO L226 Difference]: Without dead ends: 855 [2018-02-02 10:01:24,582 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-02 10:01:24,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2018-02-02 10:01:24,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 445. [2018-02-02 10:01:24,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-02-02 10:01:24,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 628 transitions. [2018-02-02 10:01:24,587 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 628 transitions. Word has length 35 [2018-02-02 10:01:24,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:24,587 INFO L432 AbstractCegarLoop]: Abstraction has 445 states and 628 transitions. [2018-02-02 10:01:24,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:01:24,588 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 628 transitions. [2018-02-02 10:01:24,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:01:24,588 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:24,588 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:24,588 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-02 10:01:24,588 INFO L82 PathProgramCache]: Analyzing trace with hash 672897990, now seen corresponding path program 1 times [2018-02-02 10:01:24,589 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:24,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:24,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:24,638 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:24,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:01:24,639 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:24,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:24,639 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-02 10:01:24,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:24,639 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:01:24,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:01:24,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:01:24,639 INFO L87 Difference]: Start difference. First operand 445 states and 628 transitions. Second operand 4 states. [2018-02-02 10:01:24,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:24,850 INFO L93 Difference]: Finished difference Result 1124 states and 1602 transitions. [2018-02-02 10:01:24,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:01:24,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-02-02 10:01:24,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:24,852 INFO L225 Difference]: With dead ends: 1124 [2018-02-02 10:01:24,852 INFO L226 Difference]: Without dead ends: 1124 [2018-02-02 10:01:24,852 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-02 10:01:24,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2018-02-02 10:01:24,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 442. [2018-02-02 10:01:24,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-02-02 10:01:24,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 626 transitions. [2018-02-02 10:01:24,857 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 626 transitions. Word has length 35 [2018-02-02 10:01:24,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:24,857 INFO L432 AbstractCegarLoop]: Abstraction has 442 states and 626 transitions. [2018-02-02 10:01:24,857 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:01:24,857 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 626 transitions. [2018-02-02 10:01:24,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:01:24,858 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:24,858 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:24,858 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-02 10:01:24,858 INFO L82 PathProgramCache]: Analyzing trace with hash 672897991, now seen corresponding path program 1 times [2018-02-02 10:01:24,858 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:24,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:24,884 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:24,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:01:24,884 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:24,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-02 10:01:24,885 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-02 10:01:24,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-02 10:01:24,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:01:24,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:01:24,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:01:24,885 INFO L87 Difference]: Start difference. First operand 442 states and 626 transitions. Second operand 4 states. [2018-02-02 10:01:24,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:24,994 INFO L93 Difference]: Finished difference Result 444 states and 627 transitions. [2018-02-02 10:01:24,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:01:24,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-02-02 10:01:24,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:24,995 INFO L225 Difference]: With dead ends: 444 [2018-02-02 10:01:24,995 INFO L226 Difference]: Without dead ends: 444 [2018-02-02 10:01:24,995 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:01:24,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-02-02 10:01:24,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 443. [2018-02-02 10:01:24,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-02-02 10:01:24,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 626 transitions. [2018-02-02 10:01:24,998 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 626 transitions. Word has length 35 [2018-02-02 10:01:24,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:24,998 INFO L432 AbstractCegarLoop]: Abstraction has 443 states and 626 transitions. [2018-02-02 10:01:24,998 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:01:24,998 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 626 transitions. [2018-02-02 10:01:24,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:01:24,999 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:24,999 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-02 10:01:24,999 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-02 10:01:24,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1767576820, now seen corresponding path program 1 times [2018-02-02 10:01:25,000 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:25,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:25,051 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-02 10:01:25,051 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:25,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:01:25,051 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:25,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:25,052 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-02 10:01:25,052 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-02 10:01:25,052 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:01:25,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:01:25,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:01:25,053 INFO L87 Difference]: Start difference. First operand 443 states and 626 transitions. Second operand 6 states. [2018-02-02 10:01:25,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:25,189 INFO L93 Difference]: Finished difference Result 541 states and 775 transitions. [2018-02-02 10:01:25,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:01:25,190 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-02 10:01:25,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:25,191 INFO L225 Difference]: With dead ends: 541 [2018-02-02 10:01:25,191 INFO L226 Difference]: Without dead ends: 541 [2018-02-02 10:01:25,191 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-02 10:01:25,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-02-02 10:01:25,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 452. [2018-02-02 10:01:25,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-02-02 10:01:25,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 638 transitions. [2018-02-02 10:01:25,194 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 638 transitions. Word has length 36 [2018-02-02 10:01:25,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:25,194 INFO L432 AbstractCegarLoop]: Abstraction has 452 states and 638 transitions. [2018-02-02 10:01:25,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:01:25,194 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 638 transitions. [2018-02-02 10:01:25,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:01:25,194 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:25,194 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-02 10:01:25,194 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-02 10:01:25,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1761851182, now seen corresponding path program 1 times [2018-02-02 10:01:25,195 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:25,202 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:25,507 WARN L146 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 26 DAG size of output 19 [2018-02-02 10:01:25,589 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-02 10:01:25,589 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:25,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 10:01:25,589 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:25,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:25,590 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-02 10:01:25,590 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-02 10:01:25,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:01:25,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:01:25,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:01:25,591 INFO L87 Difference]: Start difference. First operand 452 states and 638 transitions. Second operand 13 states. [2018-02-02 10:01:26,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:26,208 INFO L93 Difference]: Finished difference Result 574 states and 779 transitions. [2018-02-02 10:01:26,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:01:26,208 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-02-02 10:01:26,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:26,209 INFO L225 Difference]: With dead ends: 574 [2018-02-02 10:01:26,209 INFO L226 Difference]: Without dead ends: 574 [2018-02-02 10:01:26,209 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:01:26,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-02-02 10:01:26,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 410. [2018-02-02 10:01:26,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-02 10:01:26,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 565 transitions. [2018-02-02 10:01:26,213 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 565 transitions. Word has length 36 [2018-02-02 10:01:26,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:26,213 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 565 transitions. [2018-02-02 10:01:26,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:01:26,213 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 565 transitions. [2018-02-02 10:01:26,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:01:26,213 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:26,213 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:26,213 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-02 10:01:26,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1255975311, now seen corresponding path program 1 times [2018-02-02 10:01:26,214 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:26,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:26,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:26,333 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:26,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 10:01:26,333 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:26,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:26,334 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-02 10:01:26,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:26,334 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:01:26,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:01:26,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:01:26,334 INFO L87 Difference]: Start difference. First operand 410 states and 565 transitions. Second operand 11 states. [2018-02-02 10:01:26,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:26,710 INFO L93 Difference]: Finished difference Result 610 states and 784 transitions. [2018-02-02 10:01:26,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:01:26,710 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-02-02 10:01:26,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:26,712 INFO L225 Difference]: With dead ends: 610 [2018-02-02 10:01:26,712 INFO L226 Difference]: Without dead ends: 610 [2018-02-02 10:01:26,712 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-02 10:01:26,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-02-02 10:01:26,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 413. [2018-02-02 10:01:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-02-02 10:01:26,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 570 transitions. [2018-02-02 10:01:26,715 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 570 transitions. Word has length 38 [2018-02-02 10:01:26,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:26,716 INFO L432 AbstractCegarLoop]: Abstraction has 413 states and 570 transitions. [2018-02-02 10:01:26,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:01:26,716 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 570 transitions. [2018-02-02 10:01:26,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:01:26,716 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:26,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:26,716 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-02 10:01:26,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1255975312, now seen corresponding path program 1 times [2018-02-02 10:01:26,717 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:26,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:26,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:26,749 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:26,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:01:26,750 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:26,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:26,750 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-02 10:01:26,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:26,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:01:26,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:01:26,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:01:26,751 INFO L87 Difference]: Start difference. First operand 413 states and 570 transitions. Second operand 5 states. [2018-02-02 10:01:26,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:26,908 INFO L93 Difference]: Finished difference Result 412 states and 565 transitions. [2018-02-02 10:01:26,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:01:26,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-02 10:01:26,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:26,909 INFO L225 Difference]: With dead ends: 412 [2018-02-02 10:01:26,909 INFO L226 Difference]: Without dead ends: 412 [2018-02-02 10:01:26,909 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:01:26,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-02-02 10:01:26,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2018-02-02 10:01:26,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-02-02 10:01:26,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 565 transitions. [2018-02-02 10:01:26,912 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 565 transitions. Word has length 38 [2018-02-02 10:01:26,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:26,912 INFO L432 AbstractCegarLoop]: Abstraction has 412 states and 565 transitions. [2018-02-02 10:01:26,912 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:01:26,912 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 565 transitions. [2018-02-02 10:01:26,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:01:26,912 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:26,912 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:26,913 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-02 10:01:26,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1255976497, now seen corresponding path program 1 times [2018-02-02 10:01:26,913 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:26,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:26,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:26,946 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:26,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:01:26,946 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:26,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:26,947 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-02 10:01:26,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:26,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:01:26,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:01:26,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:01:26,947 INFO L87 Difference]: Start difference. First operand 412 states and 565 transitions. Second operand 5 states. [2018-02-02 10:01:27,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:27,072 INFO L93 Difference]: Finished difference Result 411 states and 561 transitions. [2018-02-02 10:01:27,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:01:27,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-02 10:01:27,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:27,073 INFO L225 Difference]: With dead ends: 411 [2018-02-02 10:01:27,073 INFO L226 Difference]: Without dead ends: 411 [2018-02-02 10:01:27,074 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:01:27,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-02-02 10:01:27,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2018-02-02 10:01:27,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-02-02 10:01:27,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 561 transitions. [2018-02-02 10:01:27,076 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 561 transitions. Word has length 38 [2018-02-02 10:01:27,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:27,076 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 561 transitions. [2018-02-02 10:01:27,077 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:01:27,077 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 561 transitions. [2018-02-02 10:01:27,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:01:27,077 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:27,077 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:27,077 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-02 10:01:27,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1255976498, now seen corresponding path program 1 times [2018-02-02 10:01:27,077 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:27,084 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:27,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-02 10:01:27,144 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:27,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:01:27,144 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:27,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-02 10:01:27,145 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-02 10:01:27,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:27,145 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:01:27,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:01:27,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:01:27,145 INFO L87 Difference]: Start difference. First operand 411 states and 561 transitions. Second operand 5 states. [2018-02-02 10:01:27,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:27,279 INFO L93 Difference]: Finished difference Result 410 states and 557 transitions. [2018-02-02 10:01:27,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:01:27,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-02 10:01:27,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:27,280 INFO L225 Difference]: With dead ends: 410 [2018-02-02 10:01:27,280 INFO L226 Difference]: Without dead ends: 410 [2018-02-02 10:01:27,281 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:01:27,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-02-02 10:01:27,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2018-02-02 10:01:27,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-02 10:01:27,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 557 transitions. [2018-02-02 10:01:27,284 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 557 transitions. Word has length 38 [2018-02-02 10:01:27,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:27,285 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 557 transitions. [2018-02-02 10:01:27,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:01:27,285 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 557 transitions. [2018-02-02 10:01:27,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:01:27,285 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:27,285 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:27,285 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-02 10:01:27,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1691774874, now seen corresponding path program 1 times [2018-02-02 10:01:27,286 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:27,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:27,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:27,341 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:27,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:01:27,341 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:27,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:27,342 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-02 10:01:27,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:27,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:01:27,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:01:27,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:01:27,343 INFO L87 Difference]: Start difference. First operand 410 states and 557 transitions. Second operand 6 states. [2018-02-02 10:01:27,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:27,611 INFO L93 Difference]: Finished difference Result 852 states and 1192 transitions. [2018-02-02 10:01:27,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:01:27,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-02-02 10:01:27,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:27,613 INFO L225 Difference]: With dead ends: 852 [2018-02-02 10:01:27,613 INFO L226 Difference]: Without dead ends: 852 [2018-02-02 10:01:27,613 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-02 10:01:27,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2018-02-02 10:01:27,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 414. [2018-02-02 10:01:27,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-02-02 10:01:27,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 561 transitions. [2018-02-02 10:01:27,617 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 561 transitions. Word has length 38 [2018-02-02 10:01:27,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:27,617 INFO L432 AbstractCegarLoop]: Abstraction has 414 states and 561 transitions. [2018-02-02 10:01:27,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:01:27,617 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 561 transitions. [2018-02-02 10:01:27,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:01:27,618 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:27,618 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:27,618 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-02 10:01:27,618 INFO L82 PathProgramCache]: Analyzing trace with hash 156771650, now seen corresponding path program 1 times [2018-02-02 10:01:27,619 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:27,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:27,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:27,653 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:27,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:01:27,653 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:27,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:27,653 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-02 10:01:27,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:27,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:01:27,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:01:27,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:01:27,654 INFO L87 Difference]: Start difference. First operand 414 states and 561 transitions. Second operand 4 states. [2018-02-02 10:01:27,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:27,811 INFO L93 Difference]: Finished difference Result 1097 states and 1518 transitions. [2018-02-02 10:01:27,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:01:27,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-02-02 10:01:27,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:27,814 INFO L225 Difference]: With dead ends: 1097 [2018-02-02 10:01:27,814 INFO L226 Difference]: Without dead ends: 1097 [2018-02-02 10:01:27,814 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-02 10:01:27,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-02-02 10:01:27,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 413. [2018-02-02 10:01:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-02-02 10:01:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 560 transitions. [2018-02-02 10:01:27,818 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 560 transitions. Word has length 39 [2018-02-02 10:01:27,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:27,819 INFO L432 AbstractCegarLoop]: Abstraction has 413 states and 560 transitions. [2018-02-02 10:01:27,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:01:27,819 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 560 transitions. [2018-02-02 10:01:27,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:01:27,819 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:27,819 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:27,819 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-02 10:01:27,819 INFO L82 PathProgramCache]: Analyzing trace with hash 156771651, now seen corresponding path program 1 times [2018-02-02 10:01:27,820 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:27,824 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:27,859 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:27,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:01:27,859 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:27,859 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-02 10:01:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:27,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:01:27,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:01:27,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:01:27,860 INFO L87 Difference]: Start difference. First operand 413 states and 560 transitions. Second operand 4 states. [2018-02-02 10:01:27,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:27,937 INFO L93 Difference]: Finished difference Result 411 states and 558 transitions. [2018-02-02 10:01:27,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:01:27,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-02-02 10:01:27,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:27,938 INFO L225 Difference]: With dead ends: 411 [2018-02-02 10:01:27,938 INFO L226 Difference]: Without dead ends: 411 [2018-02-02 10:01:27,938 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:01:27,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-02-02 10:01:27,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2018-02-02 10:01:27,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-02-02 10:01:27,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 558 transitions. [2018-02-02 10:01:27,941 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 558 transitions. Word has length 39 [2018-02-02 10:01:27,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:27,941 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 558 transitions. [2018-02-02 10:01:27,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:01:27,941 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 558 transitions. [2018-02-02 10:01:27,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:01:27,941 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:27,941 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:27,941 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-02 10:01:27,941 INFO L82 PathProgramCache]: Analyzing trace with hash 106473297, now seen corresponding path program 1 times [2018-02-02 10:01:27,942 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:27,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:28,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:28,100 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:28,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-02 10:01:28,100 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:28,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:28,101 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-02 10:01:28,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:28,101 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:01:28,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:01:28,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:01:28,101 INFO L87 Difference]: Start difference. First operand 411 states and 558 transitions. Second operand 15 states. [2018-02-02 10:01:28,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:28,866 INFO L93 Difference]: Finished difference Result 722 states and 905 transitions. [2018-02-02 10:01:28,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:01:28,866 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-02-02 10:01:28,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:28,868 INFO L225 Difference]: With dead ends: 722 [2018-02-02 10:01:28,868 INFO L226 Difference]: Without dead ends: 722 [2018-02-02 10:01:28,868 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-02 10:01:28,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2018-02-02 10:01:28,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 438. [2018-02-02 10:01:28,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-02-02 10:01:28,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 600 transitions. [2018-02-02 10:01:28,871 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 600 transitions. Word has length 40 [2018-02-02 10:01:28,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:28,871 INFO L432 AbstractCegarLoop]: Abstraction has 438 states and 600 transitions. [2018-02-02 10:01:28,871 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:01:28,871 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 600 transitions. [2018-02-02 10:01:28,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:01:28,872 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:28,872 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-02 10:01:28,872 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-02 10:01:28,872 INFO L82 PathProgramCache]: Analyzing trace with hash -958985529, now seen corresponding path program 1 times [2018-02-02 10:01:28,872 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:28,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:29,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:29,024 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:29,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-02 10:01:29,024 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:29,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:29,024 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-02 10:01:29,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:29,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:01:29,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:01:29,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:01:29,025 INFO L87 Difference]: Start difference. First operand 438 states and 600 transitions. Second operand 16 states. [2018-02-02 10:01:29,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:29,589 INFO L93 Difference]: Finished difference Result 755 states and 959 transitions. [2018-02-02 10:01:29,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:01:29,590 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-02-02 10:01:29,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:29,591 INFO L225 Difference]: With dead ends: 755 [2018-02-02 10:01:29,591 INFO L226 Difference]: Without dead ends: 755 [2018-02-02 10:01:29,591 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-02 10:01:29,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-02-02 10:01:29,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 443. [2018-02-02 10:01:29,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-02-02 10:01:29,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 606 transitions. [2018-02-02 10:01:29,595 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 606 transitions. Word has length 41 [2018-02-02 10:01:29,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:29,595 INFO L432 AbstractCegarLoop]: Abstraction has 443 states and 606 transitions. [2018-02-02 10:01:29,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:01:29,595 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 606 transitions. [2018-02-02 10:01:29,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:01:29,596 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:29,596 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-02 10:01:29,596 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-02 10:01:29,596 INFO L82 PathProgramCache]: Analyzing trace with hash -958985528, now seen corresponding path program 1 times [2018-02-02 10:01:29,596 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:29,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:29,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:29,705 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:29,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 10:01:29,705 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:29,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:29,706 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-02 10:01:29,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:29,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:01:29,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:01:29,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:01:29,706 INFO L87 Difference]: Start difference. First operand 443 states and 606 transitions. Second operand 12 states. [2018-02-02 10:01:30,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:30,113 INFO L93 Difference]: Finished difference Result 593 states and 767 transitions. [2018-02-02 10:01:30,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:01:30,113 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-02-02 10:01:30,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:30,114 INFO L225 Difference]: With dead ends: 593 [2018-02-02 10:01:30,114 INFO L226 Difference]: Without dead ends: 593 [2018-02-02 10:01:30,114 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-02 10:01:30,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2018-02-02 10:01:30,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 438. [2018-02-02 10:01:30,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-02-02 10:01:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 599 transitions. [2018-02-02 10:01:30,117 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 599 transitions. Word has length 41 [2018-02-02 10:01:30,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:30,117 INFO L432 AbstractCegarLoop]: Abstraction has 438 states and 599 transitions. [2018-02-02 10:01:30,117 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:01:30,117 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 599 transitions. [2018-02-02 10:01:30,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:01:30,118 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:30,118 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-02 10:01:30,118 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-02 10:01:30,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1775844849, now seen corresponding path program 1 times [2018-02-02 10:01:30,119 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:30,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:30,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:30,155 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:30,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:01:30,155 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:30,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:30,156 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-02 10:01:30,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:30,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:01:30,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:01:30,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:01:30,156 INFO L87 Difference]: Start difference. First operand 438 states and 599 transitions. Second operand 5 states. [2018-02-02 10:01:30,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:30,293 INFO L93 Difference]: Finished difference Result 653 states and 894 transitions. [2018-02-02 10:01:30,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:01:30,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-02-02 10:01:30,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:30,295 INFO L225 Difference]: With dead ends: 653 [2018-02-02 10:01:30,295 INFO L226 Difference]: Without dead ends: 653 [2018-02-02 10:01:30,295 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-02 10:01:30,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-02-02 10:01:30,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 437. [2018-02-02 10:01:30,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-02-02 10:01:30,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 598 transitions. [2018-02-02 10:01:30,298 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 598 transitions. Word has length 41 [2018-02-02 10:01:30,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:30,298 INFO L432 AbstractCegarLoop]: Abstraction has 437 states and 598 transitions. [2018-02-02 10:01:30,298 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:01:30,298 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 598 transitions. [2018-02-02 10:01:30,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:01:30,299 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:30,299 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:30,299 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-02 10:01:30,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1775844848, now seen corresponding path program 1 times [2018-02-02 10:01:30,299 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:30,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:30,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:30,337 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:30,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:01:30,337 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:30,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-02 10:01:30,337 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-02 10:01:30,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-02 10:01:30,337 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:01:30,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:01:30,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:01:30,337 INFO L87 Difference]: Start difference. First operand 437 states and 598 transitions. Second operand 5 states. [2018-02-02 10:01:30,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:30,513 INFO L93 Difference]: Finished difference Result 668 states and 914 transitions. [2018-02-02 10:01:30,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:01:30,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-02-02 10:01:30,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:30,515 INFO L225 Difference]: With dead ends: 668 [2018-02-02 10:01:30,515 INFO L226 Difference]: Without dead ends: 668 [2018-02-02 10:01:30,515 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-02 10:01:30,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-02-02 10:01:30,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 436. [2018-02-02 10:01:30,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-02-02 10:01:30,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 597 transitions. [2018-02-02 10:01:30,518 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 597 transitions. Word has length 41 [2018-02-02 10:01:30,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:30,518 INFO L432 AbstractCegarLoop]: Abstraction has 436 states and 597 transitions. [2018-02-02 10:01:30,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:01:30,518 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 597 transitions. [2018-02-02 10:01:30,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 10:01:30,518 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:30,518 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-02 10:01:30,518 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-02 10:01:30,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1754899614, now seen corresponding path program 1 times [2018-02-02 10:01:30,519 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:30,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:30,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:30,568 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:30,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:01:30,569 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:30,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:30,569 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-02 10:01:30,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:30,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:01:30,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:01:30,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:01:30,570 INFO L87 Difference]: Start difference. First operand 436 states and 597 transitions. Second operand 5 states. [2018-02-02 10:01:30,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:30,736 INFO L93 Difference]: Finished difference Result 877 states and 1237 transitions. [2018-02-02 10:01:30,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:01:30,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-02-02 10:01:30,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:30,739 INFO L225 Difference]: With dead ends: 877 [2018-02-02 10:01:30,739 INFO L226 Difference]: Without dead ends: 877 [2018-02-02 10:01:30,739 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-02 10:01:30,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2018-02-02 10:01:30,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 427. [2018-02-02 10:01:30,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-02-02 10:01:30,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 588 transitions. [2018-02-02 10:01:30,744 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 588 transitions. Word has length 42 [2018-02-02 10:01:30,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:30,745 INFO L432 AbstractCegarLoop]: Abstraction has 427 states and 588 transitions. [2018-02-02 10:01:30,745 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:01:30,745 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 588 transitions. [2018-02-02 10:01:30,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 10:01:30,745 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:30,745 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-02 10:01:30,745 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-02 10:01:30,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1349100373, now seen corresponding path program 1 times [2018-02-02 10:01:30,746 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:30,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:31,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:31,149 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:31,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:01:31,149 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:31,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-02 10:01:31,149 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-02 10:01:31,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:31,149 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:01:31,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:01:31,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:01:31,150 INFO L87 Difference]: Start difference. First operand 427 states and 588 transitions. Second operand 16 states. [2018-02-02 10:01:32,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:32,128 INFO L93 Difference]: Finished difference Result 509 states and 683 transitions. [2018-02-02 10:01:32,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:01:32,128 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-02-02 10:01:32,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:32,129 INFO L225 Difference]: With dead ends: 509 [2018-02-02 10:01:32,129 INFO L226 Difference]: Without dead ends: 507 [2018-02-02 10:01:32,129 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:01:32,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-02-02 10:01:32,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 431. [2018-02-02 10:01:32,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-02-02 10:01:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 592 transitions. [2018-02-02 10:01:32,132 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 592 transitions. Word has length 44 [2018-02-02 10:01:32,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:32,132 INFO L432 AbstractCegarLoop]: Abstraction has 431 states and 592 transitions. [2018-02-02 10:01:32,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:01:32,132 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 592 transitions. [2018-02-02 10:01:32,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 10:01:32,132 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:32,132 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-02 10:01:32,132 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-02 10:01:32,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1349098584, now seen corresponding path program 1 times [2018-02-02 10:01:32,133 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:32,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:32,149 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-02 10:01:32,149 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:32,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:01:32,149 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:32,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-02 10:01:32,149 INFO L182 omatonBuilderFactory]: Interpolants [40896#(and (= main_~tree~0.base 0) (= main_~tree~0.offset 0)), 40894#true, 40895#false] [2018-02-02 10:01:32,149 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-02 10:01:32,150 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:01:32,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:01:32,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:01:32,150 INFO L87 Difference]: Start difference. First operand 431 states and 592 transitions. Second operand 3 states. [2018-02-02 10:01:32,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:32,160 INFO L93 Difference]: Finished difference Result 419 states and 539 transitions. [2018-02-02 10:01:32,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:01:32,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-02-02 10:01:32,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:32,161 INFO L225 Difference]: With dead ends: 419 [2018-02-02 10:01:32,161 INFO L226 Difference]: Without dead ends: 398 [2018-02-02 10:01:32,161 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:01:32,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-02-02 10:01:32,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 382. [2018-02-02 10:01:32,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-02 10:01:32,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 518 transitions. [2018-02-02 10:01:32,163 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 518 transitions. Word has length 44 [2018-02-02 10:01:32,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:32,164 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 518 transitions. [2018-02-02 10:01:32,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:01:32,164 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 518 transitions. [2018-02-02 10:01:32,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 10:01:32,164 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:32,164 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-02 10:01:32,164 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-02 10:01:32,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1114352130, now seen corresponding path program 1 times [2018-02-02 10:01:32,165 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:32,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:32,359 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-02 10:01:32,359 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:32,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:01:32,359 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:32,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:32,359 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-02 10:01:32,359 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-02 10:01:32,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:01:32,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:01:32,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:01:32,360 INFO L87 Difference]: Start difference. First operand 382 states and 518 transitions. Second operand 13 states. [2018-02-02 10:01:33,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:33,205 INFO L93 Difference]: Finished difference Result 619 states and 785 transitions. [2018-02-02 10:01:33,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:01:33,205 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2018-02-02 10:01:33,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:33,207 INFO L225 Difference]: With dead ends: 619 [2018-02-02 10:01:33,207 INFO L226 Difference]: Without dead ends: 619 [2018-02-02 10:01:33,208 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:01:33,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-02-02 10:01:33,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 399. [2018-02-02 10:01:33,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-02-02 10:01:33,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 540 transitions. [2018-02-02 10:01:33,212 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 540 transitions. Word has length 45 [2018-02-02 10:01:33,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:33,213 INFO L432 AbstractCegarLoop]: Abstraction has 399 states and 540 transitions. [2018-02-02 10:01:33,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:01:33,213 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 540 transitions. [2018-02-02 10:01:33,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:01:33,213 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:33,213 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:33,213 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-02 10:01:33,213 INFO L82 PathProgramCache]: Analyzing trace with hash 550494502, now seen corresponding path program 1 times [2018-02-02 10:01:33,214 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:33,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:33,519 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-02 10:01:33,520 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:33,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:01:33,520 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:33,520 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-02 10:01:33,520 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-02 10:01:33,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:01:33,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:01:33,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:01:33,521 INFO L87 Difference]: Start difference. First operand 399 states and 540 transitions. Second operand 13 states. [2018-02-02 10:01:34,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:34,325 INFO L93 Difference]: Finished difference Result 609 states and 771 transitions. [2018-02-02 10:01:34,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:01:34,326 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-02-02 10:01:34,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:34,327 INFO L225 Difference]: With dead ends: 609 [2018-02-02 10:01:34,327 INFO L226 Difference]: Without dead ends: 609 [2018-02-02 10:01:34,327 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:01:34,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2018-02-02 10:01:34,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 450. [2018-02-02 10:01:34,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-02-02 10:01:34,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 621 transitions. [2018-02-02 10:01:34,330 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 621 transitions. Word has length 46 [2018-02-02 10:01:34,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:34,331 INFO L432 AbstractCegarLoop]: Abstraction has 450 states and 621 transitions. [2018-02-02 10:01:34,331 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:01:34,331 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 621 transitions. [2018-02-02 10:01:34,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:01:34,331 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:34,331 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-02 10:01:34,331 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-02 10:01:34,331 INFO L82 PathProgramCache]: Analyzing trace with hash -54941909, now seen corresponding path program 1 times [2018-02-02 10:01:34,332 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:34,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:34,451 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-02 10:01:34,451 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:34,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:01:34,451 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:34,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:34,451 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-02 10:01:34,452 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-02 10:01:34,452 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:01:34,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:01:34,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:01:34,452 INFO L87 Difference]: Start difference. First operand 450 states and 621 transitions. Second operand 14 states. [2018-02-02 10:01:34,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:34,974 INFO L93 Difference]: Finished difference Result 655 states and 865 transitions. [2018-02-02 10:01:34,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:01:34,974 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2018-02-02 10:01:34,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:34,975 INFO L225 Difference]: With dead ends: 655 [2018-02-02 10:01:34,975 INFO L226 Difference]: Without dead ends: 655 [2018-02-02 10:01:34,976 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:01:34,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2018-02-02 10:01:34,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 455. [2018-02-02 10:01:34,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-02-02 10:01:34,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 627 transitions. [2018-02-02 10:01:34,979 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 627 transitions. Word has length 47 [2018-02-02 10:01:34,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:34,979 INFO L432 AbstractCegarLoop]: Abstraction has 455 states and 627 transitions. [2018-02-02 10:01:34,979 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:01:34,979 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 627 transitions. [2018-02-02 10:01:34,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:01:34,980 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:34,980 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-02 10:01:34,980 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-02 10:01:34,980 INFO L82 PathProgramCache]: Analyzing trace with hash -54941908, now seen corresponding path program 1 times [2018-02-02 10:01:34,980 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:34,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:35,196 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-02 10:01:35,197 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:35,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:01:35,197 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:35,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:35,197 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-02 10:01:35,197 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-02 10:01:35,197 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:01:35,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:01:35,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:01:35,198 INFO L87 Difference]: Start difference. First operand 455 states and 627 transitions. Second operand 14 states. [2018-02-02 10:01:35,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:35,986 INFO L93 Difference]: Finished difference Result 750 states and 981 transitions. [2018-02-02 10:01:35,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:01:35,986 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2018-02-02 10:01:35,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:35,987 INFO L225 Difference]: With dead ends: 750 [2018-02-02 10:01:35,987 INFO L226 Difference]: Without dead ends: 750 [2018-02-02 10:01:35,988 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-02 10:01:35,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-02-02 10:01:35,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 455. [2018-02-02 10:01:35,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-02-02 10:01:35,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 626 transitions. [2018-02-02 10:01:35,991 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 626 transitions. Word has length 47 [2018-02-02 10:01:35,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:35,991 INFO L432 AbstractCegarLoop]: Abstraction has 455 states and 626 transitions. [2018-02-02 10:01:35,991 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:01:35,991 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 626 transitions. [2018-02-02 10:01:35,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:01:35,991 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:35,991 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-02 10:01:35,991 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-02 10:01:35,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1075298233, now seen corresponding path program 1 times [2018-02-02 10:01:35,992 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:35,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:35,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:36,165 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-02 10:01:36,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:36,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:01:36,166 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:36,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:36,166 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-02 10:01:36,166 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-02 10:01:36,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:01:36,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:01:36,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:01:36,167 INFO L87 Difference]: Start difference. First operand 455 states and 626 transitions. Second operand 14 states. [2018-02-02 10:01:36,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:36,811 INFO L93 Difference]: Finished difference Result 562 states and 744 transitions. [2018-02-02 10:01:36,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:01:36,812 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2018-02-02 10:01:36,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:36,813 INFO L225 Difference]: With dead ends: 562 [2018-02-02 10:01:36,813 INFO L226 Difference]: Without dead ends: 562 [2018-02-02 10:01:36,813 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-02 10:01:36,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2018-02-02 10:01:36,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 413. [2018-02-02 10:01:36,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-02-02 10:01:36,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 554 transitions. [2018-02-02 10:01:36,817 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 554 transitions. Word has length 48 [2018-02-02 10:01:36,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:36,817 INFO L432 AbstractCegarLoop]: Abstraction has 413 states and 554 transitions. [2018-02-02 10:01:36,817 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:01:36,817 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 554 transitions. [2018-02-02 10:01:36,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:01:36,817 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:36,817 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-02 10:01:36,818 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-02 10:01:36,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1807586396, now seen corresponding path program 1 times [2018-02-02 10:01:36,818 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:36,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:37,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:37,128 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:37,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 10:01:37,128 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:37,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:37,128 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-02 10:01:37,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:37,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:01:37,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:01:37,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:01:37,129 INFO L87 Difference]: Start difference. First operand 413 states and 554 transitions. Second operand 19 states. [2018-02-02 10:01:38,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:38,493 INFO L93 Difference]: Finished difference Result 844 states and 1081 transitions. [2018-02-02 10:01:38,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:01:38,493 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-02-02 10:01:38,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:38,494 INFO L225 Difference]: With dead ends: 844 [2018-02-02 10:01:38,494 INFO L226 Difference]: Without dead ends: 844 [2018-02-02 10:01:38,495 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-02 10:01:38,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2018-02-02 10:01:38,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 472. [2018-02-02 10:01:38,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-02-02 10:01:38,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 638 transitions. [2018-02-02 10:01:38,498 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 638 transitions. Word has length 49 [2018-02-02 10:01:38,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:38,498 INFO L432 AbstractCegarLoop]: Abstraction has 472 states and 638 transitions. [2018-02-02 10:01:38,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:01:38,498 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 638 transitions. [2018-02-02 10:01:38,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:01:38,499 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:38,499 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:38,499 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-02 10:01:38,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1807586397, now seen corresponding path program 1 times [2018-02-02 10:01:38,499 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:38,507 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:38,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:38,989 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:38,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 10:01:38,989 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:38,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:38,990 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-02 10:01:38,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:38,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:01:38,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:01:38,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:01:38,991 INFO L87 Difference]: Start difference. First operand 472 states and 638 transitions. Second operand 19 states. [2018-02-02 10:01:40,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:40,586 INFO L93 Difference]: Finished difference Result 841 states and 1078 transitions. [2018-02-02 10:01:40,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:01:40,587 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-02-02 10:01:40,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:40,587 INFO L225 Difference]: With dead ends: 841 [2018-02-02 10:01:40,588 INFO L226 Difference]: Without dead ends: 841 [2018-02-02 10:01:40,588 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-02 10:01:40,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2018-02-02 10:01:40,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 472. [2018-02-02 10:01:40,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-02-02 10:01:40,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 637 transitions. [2018-02-02 10:01:40,591 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 637 transitions. Word has length 49 [2018-02-02 10:01:40,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:40,592 INFO L432 AbstractCegarLoop]: Abstraction has 472 states and 637 transitions. [2018-02-02 10:01:40,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:01:40,592 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 637 transitions. [2018-02-02 10:01:40,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:01:40,592 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:40,592 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-02 10:01:40,592 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-02 10:01:40,592 INFO L82 PathProgramCache]: Analyzing trace with hash 26954866, now seen corresponding path program 1 times [2018-02-02 10:01:40,593 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:40,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:40,664 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-02 10:01:40,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:40,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:01:40,665 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:40,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:40,665 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-02 10:01:40,665 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-02 10:01:40,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:01:40,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:01:40,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:01:40,666 INFO L87 Difference]: Start difference. First operand 472 states and 637 transitions. Second operand 8 states. [2018-02-02 10:01:40,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:40,959 INFO L93 Difference]: Finished difference Result 668 states and 842 transitions. [2018-02-02 10:01:40,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:01:40,959 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-02-02 10:01:40,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:40,960 INFO L225 Difference]: With dead ends: 668 [2018-02-02 10:01:40,960 INFO L226 Difference]: Without dead ends: 668 [2018-02-02 10:01:40,960 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:01:40,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-02-02 10:01:40,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 505. [2018-02-02 10:01:40,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-02-02 10:01:40,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 687 transitions. [2018-02-02 10:01:40,964 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 687 transitions. Word has length 50 [2018-02-02 10:01:40,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:40,964 INFO L432 AbstractCegarLoop]: Abstraction has 505 states and 687 transitions. [2018-02-02 10:01:40,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:01:40,964 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 687 transitions. [2018-02-02 10:01:40,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:01:40,965 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:40,965 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-02 10:01:40,965 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-02 10:01:40,965 INFO L82 PathProgramCache]: Analyzing trace with hash 200603590, now seen corresponding path program 1 times [2018-02-02 10:01:40,965 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:40,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:40,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:40,990 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:40,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:01:40,991 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:40,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:40,991 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-02 10:01:40,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:40,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:01:40,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:01:40,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:01:40,992 INFO L87 Difference]: Start difference. First operand 505 states and 687 transitions. Second operand 4 states. [2018-02-02 10:01:41,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:41,124 INFO L93 Difference]: Finished difference Result 900 states and 1217 transitions. [2018-02-02 10:01:41,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:01:41,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-02-02 10:01:41,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:41,125 INFO L225 Difference]: With dead ends: 900 [2018-02-02 10:01:41,125 INFO L226 Difference]: Without dead ends: 900 [2018-02-02 10:01:41,126 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-02 10:01:41,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2018-02-02 10:01:41,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 504. [2018-02-02 10:01:41,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-02-02 10:01:41,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 686 transitions. [2018-02-02 10:01:41,130 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 686 transitions. Word has length 50 [2018-02-02 10:01:41,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:41,130 INFO L432 AbstractCegarLoop]: Abstraction has 504 states and 686 transitions. [2018-02-02 10:01:41,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:01:41,130 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 686 transitions. [2018-02-02 10:01:41,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:01:41,130 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:41,130 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-02 10:01:41,130 INFO L82 PathProgramCache]: Analyzing trace with hash 200603591, now seen corresponding path program 1 times [2018-02-02 10:01:41,131 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:41,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:41,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:41,160 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:41,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:01:41,160 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:41,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:41,160 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-02 10:01:41,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:41,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:01:41,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:01:41,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:01:41,161 INFO L87 Difference]: Start difference. First operand 504 states and 686 transitions. Second operand 4 states. [2018-02-02 10:01:41,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:41,352 INFO L93 Difference]: Finished difference Result 690 states and 892 transitions. [2018-02-02 10:01:41,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:01:41,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-02-02 10:01:41,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:41,353 INFO L225 Difference]: With dead ends: 690 [2018-02-02 10:01:41,354 INFO L226 Difference]: Without dead ends: 690 [2018-02-02 10:01:41,354 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-02 10:01:41,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-02-02 10:01:41,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 503. [2018-02-02 10:01:41,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-02-02 10:01:41,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 685 transitions. [2018-02-02 10:01:41,360 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 685 transitions. Word has length 50 [2018-02-02 10:01:41,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:41,360 INFO L432 AbstractCegarLoop]: Abstraction has 503 states and 685 transitions. [2018-02-02 10:01:41,360 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:01:41,360 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 685 transitions. [2018-02-02 10:01:41,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:01:41,360 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:41,360 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-02 10:01:41,361 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-02 10:01:41,361 INFO L82 PathProgramCache]: Analyzing trace with hash -391604284, now seen corresponding path program 1 times [2018-02-02 10:01:41,361 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:41,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:41,497 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-02 10:01:41,497 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:41,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:01:41,497 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:41,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:41,497 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-02 10:01:41,497 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-02 10:01:41,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:01:41,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:01:41,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:01:41,498 INFO L87 Difference]: Start difference. First operand 503 states and 685 transitions. Second operand 12 states. [2018-02-02 10:01:41,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:41,955 INFO L93 Difference]: Finished difference Result 676 states and 884 transitions. [2018-02-02 10:01:41,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:01:41,956 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2018-02-02 10:01:41,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:41,957 INFO L225 Difference]: With dead ends: 676 [2018-02-02 10:01:41,958 INFO L226 Difference]: Without dead ends: 676 [2018-02-02 10:01:41,958 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:01:41,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-02-02 10:01:41,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 506. [2018-02-02 10:01:41,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-02-02 10:01:41,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 689 transitions. [2018-02-02 10:01:41,964 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 689 transitions. Word has length 50 [2018-02-02 10:01:41,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:41,964 INFO L432 AbstractCegarLoop]: Abstraction has 506 states and 689 transitions. [2018-02-02 10:01:41,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:01:41,964 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 689 transitions. [2018-02-02 10:01:41,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:01:41,965 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:41,965 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-02 10:01:41,965 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-02 10:01:41,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1713231064, now seen corresponding path program 1 times [2018-02-02 10:01:41,966 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:41,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:42,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:42,400 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:42,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 10:01:42,400 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:42,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:42,401 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-02 10:01:42,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:42,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:01:42,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:01:42,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:01:42,402 INFO L87 Difference]: Start difference. First operand 506 states and 689 transitions. Second operand 19 states. [2018-02-02 10:01:43,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:43,811 INFO L93 Difference]: Finished difference Result 921 states and 1198 transitions. [2018-02-02 10:01:43,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:01:43,811 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2018-02-02 10:01:43,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:43,812 INFO L225 Difference]: With dead ends: 921 [2018-02-02 10:01:43,812 INFO L226 Difference]: Without dead ends: 921 [2018-02-02 10:01:43,813 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-02 10:01:43,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2018-02-02 10:01:43,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 571. [2018-02-02 10:01:43,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2018-02-02 10:01:43,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 781 transitions. [2018-02-02 10:01:43,823 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 781 transitions. Word has length 53 [2018-02-02 10:01:43,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:43,823 INFO L432 AbstractCegarLoop]: Abstraction has 571 states and 781 transitions. [2018-02-02 10:01:43,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:01:43,823 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 781 transitions. [2018-02-02 10:01:43,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:01:43,824 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:43,824 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-02 10:01:43,824 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-02 10:01:43,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1713231065, now seen corresponding path program 1 times [2018-02-02 10:01:43,825 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:43,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:44,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:44,320 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:44,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 10:01:44,320 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:44,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:44,320 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-02 10:01:44,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:44,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:01:44,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:01:44,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:01:44,321 INFO L87 Difference]: Start difference. First operand 571 states and 781 transitions. Second operand 19 states. [2018-02-02 10:01:46,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:46,163 INFO L93 Difference]: Finished difference Result 920 states and 1197 transitions. [2018-02-02 10:01:46,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:01:46,163 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2018-02-02 10:01:46,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:46,164 INFO L225 Difference]: With dead ends: 920 [2018-02-02 10:01:46,164 INFO L226 Difference]: Without dead ends: 920 [2018-02-02 10:01:46,164 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=332, Invalid=1074, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:01:46,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2018-02-02 10:01:46,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 567. [2018-02-02 10:01:46,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-02-02 10:01:46,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 776 transitions. [2018-02-02 10:01:46,168 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 776 transitions. Word has length 53 [2018-02-02 10:01:46,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:46,169 INFO L432 AbstractCegarLoop]: Abstraction has 567 states and 776 transitions. [2018-02-02 10:01:46,169 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:01:46,169 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 776 transitions. [2018-02-02 10:01:46,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:01:46,169 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:46,169 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-02 10:01:46,169 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-02 10:01:46,169 INFO L82 PathProgramCache]: Analyzing trace with hash -146453375, now seen corresponding path program 1 times [2018-02-02 10:01:46,170 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:46,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:46,266 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:46,267 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:46,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:01:46,267 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:46,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:46,267 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-02 10:01:46,267 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:46,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:01:46,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:01:46,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:01:46,268 INFO L87 Difference]: Start difference. First operand 567 states and 776 transitions. Second operand 10 states. [2018-02-02 10:01:46,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:46,647 INFO L93 Difference]: Finished difference Result 864 states and 1085 transitions. [2018-02-02 10:01:46,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:01:46,647 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-02-02 10:01:46,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:46,648 INFO L225 Difference]: With dead ends: 864 [2018-02-02 10:01:46,648 INFO L226 Difference]: Without dead ends: 864 [2018-02-02 10:01:46,648 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:01:46,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2018-02-02 10:01:46,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 440. [2018-02-02 10:01:46,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-02-02 10:01:46,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 560 transitions. [2018-02-02 10:01:46,653 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 560 transitions. Word has length 53 [2018-02-02 10:01:46,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:46,653 INFO L432 AbstractCegarLoop]: Abstraction has 440 states and 560 transitions. [2018-02-02 10:01:46,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:01:46,653 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 560 transitions. [2018-02-02 10:01:46,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:01:46,653 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:46,654 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-02 10:01:46,654 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-02 10:01:46,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1882204834, now seen corresponding path program 1 times [2018-02-02 10:01:46,654 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:46,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:46,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:46,784 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:46,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:01:46,784 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:46,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:46,784 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-02 10:01:46,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:46,784 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:01:46,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:01:46,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:01:46,785 INFO L87 Difference]: Start difference. First operand 440 states and 560 transitions. Second operand 10 states. [2018-02-02 10:01:47,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:47,154 INFO L93 Difference]: Finished difference Result 666 states and 827 transitions. [2018-02-02 10:01:47,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:01:47,154 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-02-02 10:01:47,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:47,155 INFO L225 Difference]: With dead ends: 666 [2018-02-02 10:01:47,155 INFO L226 Difference]: Without dead ends: 666 [2018-02-02 10:01:47,155 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:01:47,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-02-02 10:01:47,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 439. [2018-02-02 10:01:47,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-02-02 10:01:47,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 559 transitions. [2018-02-02 10:01:47,159 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 559 transitions. Word has length 53 [2018-02-02 10:01:47,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:47,159 INFO L432 AbstractCegarLoop]: Abstraction has 439 states and 559 transitions. [2018-02-02 10:01:47,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:01:47,159 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 559 transitions. [2018-02-02 10:01:47,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:01:47,160 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:47,160 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-02 10:01:47,160 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-02 10:01:47,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1882204835, now seen corresponding path program 1 times [2018-02-02 10:01:47,161 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:47,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:47,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:47,291 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:47,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:01:47,291 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:47,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:47,292 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-02 10:01:47,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:47,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:01:47,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:01:47,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:01:47,292 INFO L87 Difference]: Start difference. First operand 439 states and 559 transitions. Second operand 10 states. [2018-02-02 10:01:47,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:47,768 INFO L93 Difference]: Finished difference Result 665 states and 826 transitions. [2018-02-02 10:01:47,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:01:47,768 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-02-02 10:01:47,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:47,769 INFO L225 Difference]: With dead ends: 665 [2018-02-02 10:01:47,769 INFO L226 Difference]: Without dead ends: 665 [2018-02-02 10:01:47,769 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-02 10:01:47,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-02-02 10:01:47,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 438. [2018-02-02 10:01:47,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-02-02 10:01:47,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 558 transitions. [2018-02-02 10:01:47,773 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 558 transitions. Word has length 53 [2018-02-02 10:01:47,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:47,773 INFO L432 AbstractCegarLoop]: Abstraction has 438 states and 558 transitions. [2018-02-02 10:01:47,773 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:01:47,773 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 558 transitions. [2018-02-02 10:01:47,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:01:47,774 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:47,774 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-02 10:01:47,774 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-02 10:01:47,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1116441486, now seen corresponding path program 1 times [2018-02-02 10:01:47,774 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:47,783 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:47,924 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-02 10:01:47,925 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:47,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:01:47,925 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:47,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:47,925 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-02 10:01:47,925 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-02 10:01:47,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:01:47,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:01:47,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:01:47,926 INFO L87 Difference]: Start difference. First operand 438 states and 558 transitions. Second operand 15 states. [2018-02-02 10:01:48,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:48,620 INFO L93 Difference]: Finished difference Result 725 states and 869 transitions. [2018-02-02 10:01:48,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:01:48,621 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 53 [2018-02-02 10:01:48,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:48,622 INFO L225 Difference]: With dead ends: 725 [2018-02-02 10:01:48,622 INFO L226 Difference]: Without dead ends: 725 [2018-02-02 10:01:48,622 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=203, Invalid=727, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:01:48,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-02-02 10:01:48,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 443. [2018-02-02 10:01:48,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-02-02 10:01:48,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 564 transitions. [2018-02-02 10:01:48,625 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 564 transitions. Word has length 53 [2018-02-02 10:01:48,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:48,626 INFO L432 AbstractCegarLoop]: Abstraction has 443 states and 564 transitions. [2018-02-02 10:01:48,626 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:01:48,626 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 564 transitions. [2018-02-02 10:01:48,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:01:48,626 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:48,626 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-02 10:01:48,626 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-02 10:01:48,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1116441485, now seen corresponding path program 1 times [2018-02-02 10:01:48,627 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:48,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:48,826 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-02 10:01:48,827 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:48,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:01:48,827 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:48,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:48,827 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-02 10:01:48,827 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-02 10:01:48,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:01:48,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:01:48,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:01:48,828 INFO L87 Difference]: Start difference. First operand 443 states and 564 transitions. Second operand 15 states. [2018-02-02 10:01:49,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:49,481 INFO L93 Difference]: Finished difference Result 582 states and 694 transitions. [2018-02-02 10:01:49,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:01:49,481 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 53 [2018-02-02 10:01:49,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:49,482 INFO L225 Difference]: With dead ends: 582 [2018-02-02 10:01:49,482 INFO L226 Difference]: Without dead ends: 582 [2018-02-02 10:01:49,482 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:01:49,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-02-02 10:01:49,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 446. [2018-02-02 10:01:49,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-02-02 10:01:49,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 568 transitions. [2018-02-02 10:01:49,485 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 568 transitions. Word has length 53 [2018-02-02 10:01:49,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:49,485 INFO L432 AbstractCegarLoop]: Abstraction has 446 states and 568 transitions. [2018-02-02 10:01:49,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:01:49,485 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 568 transitions. [2018-02-02 10:01:49,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 10:01:49,485 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:49,486 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-02 10:01:49,486 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-02 10:01:49,486 INFO L82 PathProgramCache]: Analyzing trace with hash -249947414, now seen corresponding path program 1 times [2018-02-02 10:01:49,486 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:49,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:49,503 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-02 10:01:49,503 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:49,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:01:49,503 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:49,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:49,503 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-02 10:01:49,503 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-02 10:01:49,503 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:01:49,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:01:49,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:01:49,504 INFO L87 Difference]: Start difference. First operand 446 states and 568 transitions. Second operand 5 states. [2018-02-02 10:01:49,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:49,638 INFO L93 Difference]: Finished difference Result 445 states and 564 transitions. [2018-02-02 10:01:49,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:01:49,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-02-02 10:01:49,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:49,639 INFO L225 Difference]: With dead ends: 445 [2018-02-02 10:01:49,639 INFO L226 Difference]: Without dead ends: 445 [2018-02-02 10:01:49,639 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:01:49,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-02-02 10:01:49,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2018-02-02 10:01:49,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-02-02 10:01:49,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 564 transitions. [2018-02-02 10:01:49,641 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 564 transitions. Word has length 54 [2018-02-02 10:01:49,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:49,642 INFO L432 AbstractCegarLoop]: Abstraction has 445 states and 564 transitions. [2018-02-02 10:01:49,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:01:49,642 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 564 transitions. [2018-02-02 10:01:49,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 10:01:49,642 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:49,642 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-02 10:01:49,643 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-02 10:01:49,643 INFO L82 PathProgramCache]: Analyzing trace with hash -249947413, now seen corresponding path program 1 times [2018-02-02 10:01:49,643 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:49,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:49,701 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-02 10:01:49,701 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:49,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:01:49,701 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:49,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:49,702 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-02 10:01:49,702 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-02 10:01:49,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:01:49,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:01:49,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:01:49,702 INFO L87 Difference]: Start difference. First operand 445 states and 564 transitions. Second operand 6 states. [2018-02-02 10:01:49,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:49,896 INFO L93 Difference]: Finished difference Result 444 states and 560 transitions. [2018-02-02 10:01:49,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:01:49,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-02-02 10:01:49,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:49,897 INFO L225 Difference]: With dead ends: 444 [2018-02-02 10:01:49,897 INFO L226 Difference]: Without dead ends: 444 [2018-02-02 10:01:49,897 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-02 10:01:49,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-02-02 10:01:49,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2018-02-02 10:01:49,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-02-02 10:01:49,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 560 transitions. [2018-02-02 10:01:49,899 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 560 transitions. Word has length 54 [2018-02-02 10:01:49,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:49,899 INFO L432 AbstractCegarLoop]: Abstraction has 444 states and 560 transitions. [2018-02-02 10:01:49,899 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:01:49,899 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 560 transitions. [2018-02-02 10:01:49,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:01:49,899 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:49,899 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-02 10:01:49,900 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-02 10:01:49,900 INFO L82 PathProgramCache]: Analyzing trace with hash 682972618, now seen corresponding path program 1 times [2018-02-02 10:01:49,900 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:49,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:50,109 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-02 10:01:50,110 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:50,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:01:50,110 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:50,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:50,110 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-02 10:01:50,110 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-02 10:01:50,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:01:50,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:01:50,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:01:50,111 INFO L87 Difference]: Start difference. First operand 444 states and 560 transitions. Second operand 17 states. [2018-02-02 10:01:50,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:50,947 INFO L93 Difference]: Finished difference Result 548 states and 658 transitions. [2018-02-02 10:01:50,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:01:50,947 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-02-02 10:01:50,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:50,948 INFO L225 Difference]: With dead ends: 548 [2018-02-02 10:01:50,948 INFO L226 Difference]: Without dead ends: 546 [2018-02-02 10:01:50,948 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-02 10:01:50,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-02-02 10:01:50,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 442. [2018-02-02 10:01:50,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-02-02 10:01:50,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 557 transitions. [2018-02-02 10:01:50,950 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 557 transitions. Word has length 56 [2018-02-02 10:01:50,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:50,951 INFO L432 AbstractCegarLoop]: Abstraction has 442 states and 557 transitions. [2018-02-02 10:01:50,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:01:50,951 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 557 transitions. [2018-02-02 10:01:50,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:01:50,951 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:50,951 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-02 10:01:50,951 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-02 10:01:50,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1340433773, now seen corresponding path program 1 times [2018-02-02 10:01:50,952 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:50,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:51,485 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:51,485 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:51,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:01:51,486 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:51,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:51,486 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-02 10:01:51,486 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:51,486 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:01:51,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:01:51,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:01:51,486 INFO L87 Difference]: Start difference. First operand 442 states and 557 transitions. Second operand 23 states. [2018-02-02 10:01:52,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:52,830 INFO L93 Difference]: Finished difference Result 579 states and 690 transitions. [2018-02-02 10:01:52,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:01:52,830 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 58 [2018-02-02 10:01:52,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:52,831 INFO L225 Difference]: With dead ends: 579 [2018-02-02 10:01:52,831 INFO L226 Difference]: Without dead ends: 579 [2018-02-02 10:01:52,831 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=472, Invalid=1978, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 10:01:52,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-02-02 10:01:52,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 442. [2018-02-02 10:01:52,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-02-02 10:01:52,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 557 transitions. [2018-02-02 10:01:52,834 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 557 transitions. Word has length 58 [2018-02-02 10:01:52,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:52,834 INFO L432 AbstractCegarLoop]: Abstraction has 442 states and 557 transitions. [2018-02-02 10:01:52,834 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:01:52,834 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 557 transitions. [2018-02-02 10:01:52,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:01:52,835 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:52,835 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-02 10:01:52,863 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-02 10:01:52,863 INFO L82 PathProgramCache]: Analyzing trace with hash -675463713, now seen corresponding path program 1 times [2018-02-02 10:01:52,863 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:52,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:52,983 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-02 10:01:52,983 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:52,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:01:52,983 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:52,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:52,984 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-02 10:01:52,984 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-02 10:01:52,984 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:01:52,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:01:52,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:01:52,984 INFO L87 Difference]: Start difference. First operand 442 states and 557 transitions. Second operand 15 states. [2018-02-02 10:01:53,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:53,969 INFO L93 Difference]: Finished difference Result 1044 states and 1267 transitions. [2018-02-02 10:01:53,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:01:53,969 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2018-02-02 10:01:53,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:53,970 INFO L225 Difference]: With dead ends: 1044 [2018-02-02 10:01:53,970 INFO L226 Difference]: Without dead ends: 1044 [2018-02-02 10:01:53,970 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-02 10:01:53,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2018-02-02 10:01:53,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 504. [2018-02-02 10:01:53,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-02-02 10:01:53,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 644 transitions. [2018-02-02 10:01:53,974 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 644 transitions. Word has length 60 [2018-02-02 10:01:53,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:53,975 INFO L432 AbstractCegarLoop]: Abstraction has 504 states and 644 transitions. [2018-02-02 10:01:53,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:01:53,975 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 644 transitions. [2018-02-02 10:01:53,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:01:53,975 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:53,975 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-02 10:01:53,975 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-02 10:01:53,976 INFO L82 PathProgramCache]: Analyzing trace with hash -675463712, now seen corresponding path program 1 times [2018-02-02 10:01:53,976 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:53,981 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:54,155 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-02 10:01:54,155 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:54,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:01:54,155 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:54,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:54,155 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-02 10:01:54,156 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-02 10:01:54,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:01:54,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:01:54,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:01:54,156 INFO L87 Difference]: Start difference. First operand 504 states and 644 transitions. Second operand 16 states. [2018-02-02 10:01:55,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:55,631 INFO L93 Difference]: Finished difference Result 976 states and 1188 transitions. [2018-02-02 10:01:55,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:01:55,632 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2018-02-02 10:01:55,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:55,632 INFO L225 Difference]: With dead ends: 976 [2018-02-02 10:01:55,632 INFO L226 Difference]: Without dead ends: 976 [2018-02-02 10:01:55,633 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=252, Invalid=938, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:01:55,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2018-02-02 10:01:55,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 533. [2018-02-02 10:01:55,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-02-02 10:01:55,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 681 transitions. [2018-02-02 10:01:55,636 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 681 transitions. Word has length 60 [2018-02-02 10:01:55,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:55,636 INFO L432 AbstractCegarLoop]: Abstraction has 533 states and 681 transitions. [2018-02-02 10:01:55,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:01:55,637 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 681 transitions. [2018-02-02 10:01:55,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:01:55,637 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:55,637 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-02 10:01:55,637 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-02 10:01:55,637 INFO L82 PathProgramCache]: Analyzing trace with hash -669738075, now seen corresponding path program 1 times [2018-02-02 10:01:55,637 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:55,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:55,695 ERROR L119 erpolLogProxyWrapper]: Could not assert interpolant [2018-02-02 10:01:55,696 ERROR L119 erpolLogProxyWrapper]: Interpolant 32 not inductive: (Check returned sat) [2018-02-02 10:01:55,697 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Asserted terms must be closed at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:654) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:956) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 10:01:55,700 INFO L168 Benchmark]: Toolchain (without parser) took 42189.10 ms. Allocated memory was 405.3 MB in the beginning and 1.1 GB in the end (delta: 724.6 MB). Free memory was 362.2 MB in the beginning and 737.2 MB in the end (delta: -375.0 MB). Peak memory consumption was 349.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:01:55,701 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 405.3 MB. Free memory is still 368.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:01:55,701 INFO L168 Benchmark]: CACSL2BoogieTranslator took 171.43 ms. Allocated memory is still 405.3 MB. Free memory was 362.2 MB in the beginning and 350.3 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:01:55,701 INFO L168 Benchmark]: Boogie Preprocessor took 28.08 ms. Allocated memory is still 405.3 MB. Free memory was 350.3 MB in the beginning and 349.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:01:55,702 INFO L168 Benchmark]: RCFGBuilder took 489.67 ms. Allocated memory is still 405.3 MB. Free memory was 349.0 MB in the beginning and 293.2 MB in the end (delta: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 5.3 GB. [2018-02-02 10:01:55,702 INFO L168 Benchmark]: TraceAbstraction took 41497.05 ms. Allocated memory was 405.3 MB in the beginning and 1.1 GB in the end (delta: 724.6 MB). Free memory was 293.2 MB in the beginning and 737.2 MB in the end (delta: -444.0 MB). Peak memory consumption was 280.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:01:55,703 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 405.3 MB. Free memory is still 368.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 171.43 ms. Allocated memory is still 405.3 MB. Free memory was 362.2 MB in the beginning and 350.3 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.08 ms. Allocated memory is still 405.3 MB. Free memory was 350.3 MB in the beginning and 349.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 489.67 ms. Allocated memory is still 405.3 MB. Free memory was 349.0 MB in the beginning and 293.2 MB in the end (delta: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 41497.05 ms. Allocated memory was 405.3 MB in the beginning and 1.1 GB in the end (delta: 724.6 MB). Free memory was 293.2 MB in the beginning and 737.2 MB in the end (delta: -444.0 MB). Peak memory consumption was 280.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Asserted terms must be closed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Asserted terms must be closed: de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:654) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_of_cslls_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-01-55-709.csv Received shutdown request...