java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:25:46,398 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:25:46,399 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:25:46,412 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:25:46,412 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:25:46,413 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:25:46,413 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:25:46,415 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:25:46,417 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:25:46,418 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:25:46,419 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:25:46,419 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:25:46,420 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:25:46,421 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:25:46,422 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:25:46,424 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:25:46,426 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:25:46,428 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:25:46,429 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:25:46,430 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:25:46,433 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:25:46,433 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:25:46,434 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:25:46,435 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:25:46,435 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:25:46,436 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:25:46,436 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:25:46,437 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:25:46,437 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:25:46,437 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:25:46,437 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:25:46,438 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:25:46,447 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:25:46,448 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:25:46,448 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:25:46,448 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:25:46,448 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:25:46,449 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:25:46,449 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:25:46,449 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:25:46,449 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:25:46,449 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:25:46,449 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:25:46,449 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:25:46,449 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:25:46,449 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:25:46,450 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:25:46,450 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:25:46,450 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:25:46,450 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:25:46,450 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:25:46,450 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:25:46,450 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:25:46,450 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:25:46,450 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:25:46,478 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:25:46,487 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:25:46,490 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:25:46,491 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:25:46,491 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:25:46,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-02-02 10:25:46,621 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:25:46,622 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:25:46,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:25:46,623 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:25:46,629 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:25:46,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:25:46" (1/1) ... [2018-02-02 10:25:46,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3938e7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:25:46, skipping insertion in model container [2018-02-02 10:25:46,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:25:46" (1/1) ... [2018-02-02 10:25:46,647 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:25:46,679 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:25:46,784 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:25:46,799 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:25:46,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:25:46 WrapperNode [2018-02-02 10:25:46,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:25:46,805 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:25:46,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:25:46,806 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:25:46,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:25:46" (1/1) ... [2018-02-02 10:25:46,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:25:46" (1/1) ... [2018-02-02 10:25:46,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:25:46" (1/1) ... [2018-02-02 10:25:46,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:25:46" (1/1) ... [2018-02-02 10:25:46,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:25:46" (1/1) ... [2018-02-02 10:25:46,835 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:25:46" (1/1) ... [2018-02-02 10:25:46,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:25:46" (1/1) ... [2018-02-02 10:25:46,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:25:46,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:25:46,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:25:46,838 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:25:46,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:25:46" (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:25:46,881 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:25:46,881 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:25:46,881 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:25:46,881 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:25:46,881 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:25:46,881 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:25:46,881 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:25:46,882 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:25:46,882 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:25:46,882 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:25:46,882 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:25:46,882 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:25:46,882 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:25:46,882 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 10:25:46,882 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:25:46,883 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:25:46,883 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:25:47,285 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:25:47,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:25:47 BoogieIcfgContainer [2018-02-02 10:25:47,286 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:25:47,287 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:25:47,287 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:25:47,289 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:25:47,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:25:46" (1/3) ... [2018-02-02 10:25:47,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f62faad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:25:47, skipping insertion in model container [2018-02-02 10:25:47,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:25:46" (2/3) ... [2018-02-02 10:25:47,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f62faad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:25:47, skipping insertion in model container [2018-02-02 10:25:47,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:25:47" (3/3) ... [2018-02-02 10:25:47,292 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-02-02 10:25:47,298 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:25:47,304 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-02-02 10:25:47,331 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:25:47,331 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:25:47,331 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:25:47,332 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:25:47,332 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:25:47,332 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:25:47,332 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:25:47,332 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:25:47,333 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:25:47,353 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2018-02-02 10:25:47,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:25:47,364 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:25:47,364 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:25:47,365 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:25:47,369 INFO L82 PathProgramCache]: Analyzing trace with hash 726209746, now seen corresponding path program 1 times [2018-02-02 10:25:47,423 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:25:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:25:47,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:25:47,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:47,512 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:25:47,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:25:47,513 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:25:47,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:47,514 INFO L182 omatonBuilderFactory]: Interpolants [163#true, 164#false, 165#(= 1 (select |#valid| |main_#t~malloc0.base|)), 166#(= 1 (select |#valid| main_~null~0.base))] [2018-02-02 10:25:47,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:47,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:25:47,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:25:47,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:25:47,589 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 4 states. [2018-02-02 10:25:47,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:25:47,818 INFO L93 Difference]: Finished difference Result 181 states and 188 transitions. [2018-02-02 10:25:47,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:25:47,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:25:47,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:25:47,828 INFO L225 Difference]: With dead ends: 181 [2018-02-02 10:25:47,828 INFO L226 Difference]: Without dead ends: 177 [2018-02-02 10:25:47,829 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:25:47,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-02 10:25:47,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 154. [2018-02-02 10:25:47,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-02 10:25:47,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 159 transitions. [2018-02-02 10:25:47,869 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 159 transitions. Word has length 8 [2018-02-02 10:25:47,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:25:47,869 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 159 transitions. [2018-02-02 10:25:47,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:25:47,869 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 159 transitions. [2018-02-02 10:25:47,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:25:47,869 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:25:47,870 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:25:47,870 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:25:47,870 INFO L82 PathProgramCache]: Analyzing trace with hash 726209747, now seen corresponding path program 1 times [2018-02-02 10:25:47,871 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:25:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:25:47,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:25:47,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:47,960 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:25:47,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:25:47,961 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:25:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:47,961 INFO L182 omatonBuilderFactory]: Interpolants [504#true, 505#false, 506#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 507#(and (= (select |#length| main_~null~0.base) 12) (= main_~null~0.offset 0))] [2018-02-02 10:25:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:47,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:25:47,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:25:47,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:25:47,963 INFO L87 Difference]: Start difference. First operand 154 states and 159 transitions. Second operand 4 states. [2018-02-02 10:25:48,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:25:48,057 INFO L93 Difference]: Finished difference Result 151 states and 156 transitions. [2018-02-02 10:25:48,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:25:48,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:25:48,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:25:48,058 INFO L225 Difference]: With dead ends: 151 [2018-02-02 10:25:48,058 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 10:25:48,058 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:25:48,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 10:25:48,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-02-02 10:25:48,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 10:25:48,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 156 transitions. [2018-02-02 10:25:48,065 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 156 transitions. Word has length 8 [2018-02-02 10:25:48,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:25:48,065 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 156 transitions. [2018-02-02 10:25:48,065 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:25:48,065 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 156 transitions. [2018-02-02 10:25:48,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 10:25:48,066 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:25:48,066 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:25:48,066 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:25:48,066 INFO L82 PathProgramCache]: Analyzing trace with hash 3311897, now seen corresponding path program 1 times [2018-02-02 10:25:48,068 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:25:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:25:48,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:25:48,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:48,115 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:25:48,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:25:48,115 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:25:48,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:48,116 INFO L182 omatonBuilderFactory]: Interpolants [812#true, 813#false, 814#(= 1 (select |#valid| |main_#t~malloc4.base|)), 815#(= 1 (select |#valid| main_~list~0.base))] [2018-02-02 10:25:48,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:48,116 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:25:48,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:25:48,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:25:48,117 INFO L87 Difference]: Start difference. First operand 151 states and 156 transitions. Second operand 4 states. [2018-02-02 10:25:48,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:25:48,206 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2018-02-02 10:25:48,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:25:48,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 10:25:48,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:25:48,208 INFO L225 Difference]: With dead ends: 162 [2018-02-02 10:25:48,208 INFO L226 Difference]: Without dead ends: 162 [2018-02-02 10:25:48,209 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:25:48,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-02 10:25:48,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 147. [2018-02-02 10:25:48,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 10:25:48,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 154 transitions. [2018-02-02 10:25:48,215 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 154 transitions. Word has length 13 [2018-02-02 10:25:48,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:25:48,215 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 154 transitions. [2018-02-02 10:25:48,216 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:25:48,216 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 154 transitions. [2018-02-02 10:25:48,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 10:25:48,216 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:25:48,216 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:25:48,216 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:25:48,216 INFO L82 PathProgramCache]: Analyzing trace with hash 3311898, now seen corresponding path program 1 times [2018-02-02 10:25:48,217 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:25:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:25:48,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:25:48,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:48,263 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:25:48,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:25:48,263 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:25:48,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:48,264 INFO L182 omatonBuilderFactory]: Interpolants [1127#true, 1128#false, 1129#(and (= 12 (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 1130#(and (= main_~list~0.offset 0) (= (select |#length| main_~list~0.base) 12))] [2018-02-02 10:25:48,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:48,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:25:48,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:25:48,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:25:48,264 INFO L87 Difference]: Start difference. First operand 147 states and 154 transitions. Second operand 4 states. [2018-02-02 10:25:48,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:25:48,367 INFO L93 Difference]: Finished difference Result 159 states and 165 transitions. [2018-02-02 10:25:48,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:25:48,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 10:25:48,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:25:48,369 INFO L225 Difference]: With dead ends: 159 [2018-02-02 10:25:48,369 INFO L226 Difference]: Without dead ends: 159 [2018-02-02 10:25:48,369 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:25:48,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-02 10:25:48,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2018-02-02 10:25:48,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 10:25:48,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 158 transitions. [2018-02-02 10:25:48,377 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 158 transitions. Word has length 13 [2018-02-02 10:25:48,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:25:48,377 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 158 transitions. [2018-02-02 10:25:48,377 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:25:48,378 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 158 transitions. [2018-02-02 10:25:48,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:25:48,378 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:25:48,378 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:25:48,378 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:25:48,379 INFO L82 PathProgramCache]: Analyzing trace with hash -969711578, now seen corresponding path program 1 times [2018-02-02 10:25:48,380 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:25:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:25:48,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:25:48,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:48,453 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:25:48,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:25:48,453 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:25:48,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:48,454 INFO L182 omatonBuilderFactory]: Interpolants [1443#true, 1444#false, 1445#(= (select |#valid| main_~list~0.base) 1), 1446#(= 1 (select |#valid| main_~end~0.base))] [2018-02-02 10:25:48,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:48,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:25:48,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:25:48,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:25:48,454 INFO L87 Difference]: Start difference. First operand 151 states and 158 transitions. Second operand 4 states. [2018-02-02 10:25:48,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:25:48,548 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2018-02-02 10:25:48,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:25:48,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-02-02 10:25:48,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:25:48,549 INFO L225 Difference]: With dead ends: 154 [2018-02-02 10:25:48,549 INFO L226 Difference]: Without dead ends: 154 [2018-02-02 10:25:48,549 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:25:48,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-02 10:25:48,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 139. [2018-02-02 10:25:48,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-02 10:25:48,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 148 transitions. [2018-02-02 10:25:48,554 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 148 transitions. Word has length 21 [2018-02-02 10:25:48,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:25:48,554 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 148 transitions. [2018-02-02 10:25:48,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:25:48,554 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 148 transitions. [2018-02-02 10:25:48,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:25:48,555 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:25:48,555 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:25:48,555 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:25:48,555 INFO L82 PathProgramCache]: Analyzing trace with hash -969711577, now seen corresponding path program 1 times [2018-02-02 10:25:48,556 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:25:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:25:48,572 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:25:48,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:48,657 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:25:48,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:25:48,658 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:25:48,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:48,658 INFO L182 omatonBuilderFactory]: Interpolants [1744#(and (= 12 (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 1745#(and (= 0 main_~list~0.offset) (= 12 (select |#length| main_~list~0.base))), 1746#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1) (= 12 (select |#length| main_~list~0.base))), 1747#(and (= main_~end~0.offset 0) (= (select |#valid| main_~end~0.base) 1) (= 12 (select |#length| main_~end~0.base))), 1748#(and (= main_~end~0.offset 0) (= (select |#length| main_~end~0.base) 12)), 1742#true, 1743#false] [2018-02-02 10:25:48,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:48,659 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:25:48,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:25:48,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:25:48,659 INFO L87 Difference]: Start difference. First operand 139 states and 148 transitions. Second operand 7 states. [2018-02-02 10:25:48,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:25:48,904 INFO L93 Difference]: Finished difference Result 175 states and 185 transitions. [2018-02-02 10:25:48,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:25:48,904 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-02-02 10:25:48,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:25:48,905 INFO L225 Difference]: With dead ends: 175 [2018-02-02 10:25:48,906 INFO L226 Difference]: Without dead ends: 175 [2018-02-02 10:25:48,906 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:25:48,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-02 10:25:48,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 150. [2018-02-02 10:25:48,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 10:25:48,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2018-02-02 10:25:48,911 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 21 [2018-02-02 10:25:48,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:25:48,912 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2018-02-02 10:25:48,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:25:48,913 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2018-02-02 10:25:48,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:25:48,913 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:25:48,913 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:25:48,913 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:25:48,914 INFO L82 PathProgramCache]: Analyzing trace with hash 115077033, now seen corresponding path program 1 times [2018-02-02 10:25:48,915 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:25:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:25:48,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:25:48,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:48,949 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:25:48,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:25:48,949 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:25:48,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:48,949 INFO L182 omatonBuilderFactory]: Interpolants [2080#true, 2081#false, 2082#(= 1 (select |#valid| |main_#t~malloc9.base|)), 2083#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 2084#(= 1 (select |#valid| |main_#t~mem11.base|))] [2018-02-02 10:25:48,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:48,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:25:48,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:25:48,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:25:48,950 INFO L87 Difference]: Start difference. First operand 150 states and 162 transitions. Second operand 5 states. [2018-02-02 10:25:49,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:25:49,093 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2018-02-02 10:25:49,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:25:49,093 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-02 10:25:49,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:25:49,094 INFO L225 Difference]: With dead ends: 197 [2018-02-02 10:25:49,094 INFO L226 Difference]: Without dead ends: 197 [2018-02-02 10:25:49,094 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:25:49,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-02 10:25:49,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 149. [2018-02-02 10:25:49,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-02 10:25:49,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 160 transitions. [2018-02-02 10:25:49,097 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 160 transitions. Word has length 23 [2018-02-02 10:25:49,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:25:49,097 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 160 transitions. [2018-02-02 10:25:49,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:25:49,098 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2018-02-02 10:25:49,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:25:49,098 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:25:49,098 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:25:49,099 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:25:49,099 INFO L82 PathProgramCache]: Analyzing trace with hash 115077034, now seen corresponding path program 1 times [2018-02-02 10:25:49,100 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:25:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:25:49,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:25:49,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:49,174 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:25:49,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:25:49,174 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:25:49,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:49,174 INFO L182 omatonBuilderFactory]: Interpolants [2435#true, 2436#false, 2437#(and (= 0 |main_#t~malloc9.offset|) (= 12 (select |#length| |main_#t~malloc9.base|))), 2438#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 2439#(and (= |main_#t~mem11.offset| 0) (= (select |#length| |main_#t~mem11.base|) 12))] [2018-02-02 10:25:49,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:49,174 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:25:49,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:25:49,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:25:49,175 INFO L87 Difference]: Start difference. First operand 149 states and 160 transitions. Second operand 5 states. [2018-02-02 10:25:49,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:25:49,325 INFO L93 Difference]: Finished difference Result 219 states and 236 transitions. [2018-02-02 10:25:49,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:25:49,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-02 10:25:49,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:25:49,326 INFO L225 Difference]: With dead ends: 219 [2018-02-02 10:25:49,326 INFO L226 Difference]: Without dead ends: 219 [2018-02-02 10:25:49,327 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:25:49,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-02 10:25:49,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 148. [2018-02-02 10:25:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 10:25:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2018-02-02 10:25:49,329 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 23 [2018-02-02 10:25:49,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:25:49,329 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2018-02-02 10:25:49,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:25:49,329 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2018-02-02 10:25:49,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:25:49,330 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:25:49,330 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:25:49,330 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:25:49,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1386253035, now seen corresponding path program 1 times [2018-02-02 10:25:49,331 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:25:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:25:49,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:25:49,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:49,405 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:25:49,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:25:49,406 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:25:49,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:49,406 INFO L182 omatonBuilderFactory]: Interpolants [2816#(= (select |#valid| main_~end~0.base) 1), 2817#(and (= 1 (select |#valid| |main_#t~malloc9.base|)) (not (= main_~end~0.base |main_#t~malloc9.base|))), 2818#(and (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 2819#(and (not (= main_~end~0.base |main_#t~mem11.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 2820#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 2821#(= 1 (select |#valid| |main_#t~mem13.base|)), 2813#true, 2814#false, 2815#(= (select |#valid| main_~list~0.base) 1)] [2018-02-02 10:25:49,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:49,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:25:49,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:25:49,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:25:49,407 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand 9 states. [2018-02-02 10:25:49,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:25:49,805 INFO L93 Difference]: Finished difference Result 161 states and 171 transitions. [2018-02-02 10:25:49,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:25:49,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-02-02 10:25:49,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:25:49,807 INFO L225 Difference]: With dead ends: 161 [2018-02-02 10:25:49,808 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 10:25:49,808 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:25:49,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 10:25:49,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 147. [2018-02-02 10:25:49,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 10:25:49,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2018-02-02 10:25:49,811 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 27 [2018-02-02 10:25:49,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:25:49,812 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2018-02-02 10:25:49,812 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:25:49,812 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2018-02-02 10:25:49,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:25:49,813 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:25:49,813 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:25:49,813 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:25:49,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1386253036, now seen corresponding path program 1 times [2018-02-02 10:25:49,814 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:25:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:25:49,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:25:49,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:49,958 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:25:49,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:25:49,958 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:25:49,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:49,959 INFO L182 omatonBuilderFactory]: Interpolants [3140#true, 3141#false, 3142#(= (select |#valid| main_~list~0.base) 1), 3143#(= (select |#valid| main_~end~0.base) 1), 3144#(and (= 0 |main_#t~malloc9.offset|) (= 12 (select |#length| |main_#t~malloc9.base|)) (not (= main_~end~0.base |main_#t~malloc9.base|))), 3145#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 3146#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base |main_#t~mem11.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem11.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~end~0.offset)) main_~end~0.base) main_~end~0.offset))), 3147#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 3148#(and (= 12 (select |#length| |main_#t~mem13.base|)) (= 0 |main_#t~mem13.offset|)), 3149#(and (= main_~end~0.offset 0) (= (select |#length| main_~end~0.base) 12))] [2018-02-02 10:25:49,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:49,959 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:25:49,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:25:49,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:25:49,959 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand 10 states. [2018-02-02 10:25:50,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:25:50,525 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2018-02-02 10:25:50,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:25:50,525 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-02-02 10:25:50,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:25:50,526 INFO L225 Difference]: With dead ends: 177 [2018-02-02 10:25:50,526 INFO L226 Difference]: Without dead ends: 177 [2018-02-02 10:25:50,526 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:25:50,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-02 10:25:50,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 152. [2018-02-02 10:25:50,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 10:25:50,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2018-02-02 10:25:50,528 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 27 [2018-02-02 10:25:50,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:25:50,529 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2018-02-02 10:25:50,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:25:50,529 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2018-02-02 10:25:50,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 10:25:50,529 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:25:50,529 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:25:50,529 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:25:50,529 INFO L82 PathProgramCache]: Analyzing trace with hash 78293977, now seen corresponding path program 1 times [2018-02-02 10:25:50,530 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:25:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:25:50,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:25:50,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:50,571 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:25:50,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:25:50,572 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:25:50,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:50,572 INFO L182 omatonBuilderFactory]: Interpolants [3504#(= main_~null~0.offset 0), 3505#(= main_~null~0.offset |main_#t~malloc4.offset|), 3506#(= main_~null~0.offset main_~list~0.offset), 3507#(= main_~null~0.offset main_~end~0.offset), 3508#(not (= main_~end~0.base main_~null~0.base)), 3501#true, 3502#false, 3503#(= 0 |main_#t~malloc0.offset|)] [2018-02-02 10:25:50,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:50,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:25:50,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:25:50,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:25:50,573 INFO L87 Difference]: Start difference. First operand 152 states and 162 transitions. Second operand 8 states. [2018-02-02 10:25:50,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:25:50,752 INFO L93 Difference]: Finished difference Result 180 states and 191 transitions. [2018-02-02 10:25:50,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:25:50,752 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-02-02 10:25:50,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:25:50,753 INFO L225 Difference]: With dead ends: 180 [2018-02-02 10:25:50,753 INFO L226 Difference]: Without dead ends: 180 [2018-02-02 10:25:50,754 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:25:50,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-02 10:25:50,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 152. [2018-02-02 10:25:50,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 10:25:50,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 161 transitions. [2018-02-02 10:25:50,757 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 161 transitions. Word has length 33 [2018-02-02 10:25:50,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:25:50,757 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 161 transitions. [2018-02-02 10:25:50,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:25:50,757 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2018-02-02 10:25:50,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:25:50,758 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:25:50,758 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:25:50,758 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:25:50,759 INFO L82 PathProgramCache]: Analyzing trace with hash -133974448, now seen corresponding path program 1 times [2018-02-02 10:25:50,759 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:25:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:25:50,770 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:25:50,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:50,810 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:25:50,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:25:50,810 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:25:50,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:50,811 INFO L182 omatonBuilderFactory]: Interpolants [3856#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 3857#(= 1 (select |#valid| |main_#t~mem20.base|)), 3853#true, 3854#false, 3855#(= 1 (select |#valid| |main_#t~malloc18.base|))] [2018-02-02 10:25:50,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:50,811 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:25:50,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:25:50,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:25:50,812 INFO L87 Difference]: Start difference. First operand 152 states and 161 transitions. Second operand 5 states. [2018-02-02 10:25:50,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:25:50,952 INFO L93 Difference]: Finished difference Result 226 states and 241 transitions. [2018-02-02 10:25:50,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:25:50,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-02-02 10:25:50,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:25:50,953 INFO L225 Difference]: With dead ends: 226 [2018-02-02 10:25:50,953 INFO L226 Difference]: Without dead ends: 226 [2018-02-02 10:25:50,953 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:25:50,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-02 10:25:50,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 151. [2018-02-02 10:25:50,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 10:25:50,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-02-02 10:25:50,960 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 34 [2018-02-02 10:25:50,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:25:50,960 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-02-02 10:25:50,960 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:25:50,960 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-02-02 10:25:50,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:25:50,961 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:25:50,961 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:25:50,961 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:25:50,961 INFO L82 PathProgramCache]: Analyzing trace with hash -133974447, now seen corresponding path program 1 times [2018-02-02 10:25:50,962 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:25:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:25:50,977 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:25:51,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:25:51,025 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:25:51,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:25:51,025 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:25:51,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:51,026 INFO L182 omatonBuilderFactory]: Interpolants [4240#false, 4241#(and (= 12 (select |#length| |main_#t~malloc18.base|)) (= 0 |main_#t~malloc18.offset|)), 4242#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 4243#(and (= (select |#length| |main_#t~mem20.base|) 12) (= |main_#t~mem20.offset| 0)), 4239#true] [2018-02-02 10:25:51,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:51,026 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:25:51,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:25:51,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:25:51,027 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 5 states. [2018-02-02 10:25:51,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:25:51,226 INFO L93 Difference]: Finished difference Result 248 states and 265 transitions. [2018-02-02 10:25:51,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:25:51,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-02-02 10:25:51,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:25:51,227 INFO L225 Difference]: With dead ends: 248 [2018-02-02 10:25:51,227 INFO L226 Difference]: Without dead ends: 248 [2018-02-02 10:25:51,227 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:25:51,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-02 10:25:51,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 150. [2018-02-02 10:25:51,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 10:25:51,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2018-02-02 10:25:51,230 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 34 [2018-02-02 10:25:51,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:25:51,230 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2018-02-02 10:25:51,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:25:51,231 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2018-02-02 10:25:51,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:25:51,231 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:25:51,231 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:25:51,232 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:25:51,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1586747252, now seen corresponding path program 1 times [2018-02-02 10:25:51,233 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:25:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:25:51,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:25:51,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:51,301 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:25:51,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:25:51,301 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:25:51,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:51,301 INFO L182 omatonBuilderFactory]: Interpolants [4648#true, 4649#false, 4650#(and (= main_~null~0.offset (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) main_~null~0.offset) main_~list~0.offset)) (= main_~null~0.base (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) main_~null~0.base) main_~list~0.offset))), 4651#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 4652#(and (= main_~null~0.offset |main_#t~mem31.offset|) (= main_~null~0.base |main_#t~mem31.base|)), 4653#(and (= main_~end~0.base main_~null~0.base) (= main_~null~0.offset main_~end~0.offset))] [2018-02-02 10:25:51,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:51,301 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:25:51,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:25:51,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:25:51,302 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand 6 states. [2018-02-02 10:25:51,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:25:51,496 INFO L93 Difference]: Finished difference Result 215 states and 228 transitions. [2018-02-02 10:25:51,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:25:51,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-02 10:25:51,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:25:51,497 INFO L225 Difference]: With dead ends: 215 [2018-02-02 10:25:51,497 INFO L226 Difference]: Without dead ends: 215 [2018-02-02 10:25:51,497 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:25:51,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-02 10:25:51,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 169. [2018-02-02 10:25:51,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-02 10:25:51,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 180 transitions. [2018-02-02 10:25:51,500 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 180 transitions. Word has length 36 [2018-02-02 10:25:51,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:25:51,501 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 180 transitions. [2018-02-02 10:25:51,501 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:25:51,501 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 180 transitions. [2018-02-02 10:25:51,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:25:51,502 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:25:51,502 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:25:51,502 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:25:51,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1203027346, now seen corresponding path program 1 times [2018-02-02 10:25:51,503 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:25:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:25:51,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:25:51,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:51,637 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:25:51,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 10:25:51,638 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:25:51,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:25:51,638 INFO L182 omatonBuilderFactory]: Interpolants [5056#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 5057#(= 1 (select |#valid| |main_#t~mem22.base|)), 5046#true, 5047#false, 5048#(= (select |#valid| main_~list~0.base) 1), 5049#(= (select |#valid| main_~end~0.base) 1), 5050#(not (= main_~end~0.base |main_#t~malloc9.base|)), 5051#(not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 5052#(and (not (= main_~end~0.base |main_#t~mem11.base|)) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 5053#(and (= 1 (select |#valid| |main_#t~malloc18.base|)) (not (= main_~end~0.base |main_#t~malloc18.base|))), 5054#(and (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 5055#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base |main_#t~mem20.base|)))] [2018-02-02 10:25:51,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:25:51,639 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:25:51,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:25:51,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:25:51,639 INFO L87 Difference]: Start difference. First operand 169 states and 180 transitions. Second operand 12 states. [2018-02-02 10:25:51,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:25:51,942 INFO L93 Difference]: Finished difference Result 171 states and 181 transitions. [2018-02-02 10:25:51,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:25:51,942 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-02-02 10:25:51,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:25:51,943 INFO L225 Difference]: With dead ends: 171 [2018-02-02 10:25:51,943 INFO L226 Difference]: Without dead ends: 171 [2018-02-02 10:25:51,943 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:25:51,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-02 10:25:51,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2018-02-02 10:25:51,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-02 10:25:51,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 179 transitions. [2018-02-02 10:25:51,945 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 179 transitions. Word has length 38 [2018-02-02 10:25:51,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:25:51,945 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 179 transitions. [2018-02-02 10:25:51,945 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:25:51,946 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 179 transitions. [2018-02-02 10:25:51,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:25:51,946 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:25:51,946 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:25:51,946 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:25:51,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1203027347, now seen corresponding path program 1 times [2018-02-02 10:25:51,947 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:25:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:25:51,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:25:52,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:52,092 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:25:52,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 10:25:52,092 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:25:52,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:52,093 INFO L182 omatonBuilderFactory]: Interpolants [5418#true, 5419#false, 5420#(= (select |#valid| main_~list~0.base) 1), 5421#(= (select |#valid| main_~end~0.base) 1), 5422#(not (= main_~end~0.base |main_#t~malloc9.base|)), 5423#(not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 5424#(and (not (= main_~end~0.base |main_#t~mem11.base|)) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 5425#(and (= 12 (select |#length| |main_#t~malloc18.base|)) (= 0 |main_#t~malloc18.offset|) (not (= main_~end~0.base |main_#t~malloc18.base|))), 5426#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 5427#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base |main_#t~mem20.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem20.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.offset)) main_~end~0.base) main_~end~0.offset))), 5428#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 5429#(and (= 12 (select |#length| |main_#t~mem22.base|)) (= 0 |main_#t~mem22.offset|)), 5430#(and (= main_~end~0.offset 0) (= (select |#length| main_~end~0.base) 12))] [2018-02-02 10:25:52,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:52,093 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:25:52,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:25:52,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:25:52,093 INFO L87 Difference]: Start difference. First operand 168 states and 179 transitions. Second operand 13 states. [2018-02-02 10:25:52,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:25:52,546 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions. [2018-02-02 10:25:52,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:25:52,546 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-02-02 10:25:52,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:25:52,547 INFO L225 Difference]: With dead ends: 166 [2018-02-02 10:25:52,547 INFO L226 Difference]: Without dead ends: 166 [2018-02-02 10:25:52,547 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:25:52,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-02 10:25:52,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 141. [2018-02-02 10:25:52,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-02 10:25:52,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2018-02-02 10:25:52,549 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 38 [2018-02-02 10:25:52,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:25:52,549 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2018-02-02 10:25:52,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:25:52,550 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2018-02-02 10:25:52,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:25:52,550 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:25:52,550 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:25:52,550 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:25:52,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1775732296, now seen corresponding path program 1 times [2018-02-02 10:25:52,551 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:25:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:25:52,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:25:52,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:52,619 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:25:52,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:25:52,619 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:25:52,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:52,619 INFO L182 omatonBuilderFactory]: Interpolants [5768#true, 5769#false, 5770#(= |main_#t~mem27| (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))), 5771#(= ~unnamed0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))), 5772#(= ~unnamed0~BLACK |main_#t~mem28|)] [2018-02-02 10:25:52,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:52,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:25:52,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:25:52,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:25:52,620 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand 5 states. [2018-02-02 10:25:52,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:25:52,690 INFO L93 Difference]: Finished difference Result 145 states and 153 transitions. [2018-02-02 10:25:52,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:25:52,690 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-02 10:25:52,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:25:52,691 INFO L225 Difference]: With dead ends: 145 [2018-02-02 10:25:52,691 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 10:25:52,691 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:25:52,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 10:25:52,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 140. [2018-02-02 10:25:52,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 10:25:52,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2018-02-02 10:25:52,692 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 38 [2018-02-02 10:25:52,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:25:52,693 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2018-02-02 10:25:52,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:25:52,693 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2018-02-02 10:25:52,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:25:52,693 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:25:52,693 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] [2018-02-02 10:25:52,693 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:25:52,693 INFO L82 PathProgramCache]: Analyzing trace with hash 377492563, now seen corresponding path program 1 times [2018-02-02 10:25:52,694 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:25:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:25:52,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:25:52,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:25:52,726 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:25:52,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:25:52,726 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:25:52,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:52,726 INFO L182 omatonBuilderFactory]: Interpolants [6064#(= main_~null~0.offset |main_#t~malloc4.offset|), 6065#(= main_~null~0.offset main_~list~0.offset), 6066#(and (= main_~end~0.base main_~list~0.base) (= main_~null~0.offset main_~end~0.offset)), 6067#(not (= main_~list~0.base main_~null~0.base)), 6060#true, 6061#false, 6062#(= 0 |main_#t~malloc0.offset|), 6063#(= main_~null~0.offset 0)] [2018-02-02 10:25:52,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:25:52,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:25:52,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:25:52,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:25:52,727 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand 8 states. [2018-02-02 10:25:52,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:25:52,844 INFO L93 Difference]: Finished difference Result 153 states and 160 transitions. [2018-02-02 10:25:52,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:25:52,844 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-02-02 10:25:52,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:25:52,845 INFO L225 Difference]: With dead ends: 153 [2018-02-02 10:25:52,845 INFO L226 Difference]: Without dead ends: 153 [2018-02-02 10:25:52,845 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:25:52,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-02 10:25:52,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 140. [2018-02-02 10:25:52,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 10:25:52,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 147 transitions. [2018-02-02 10:25:52,847 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 147 transitions. Word has length 39 [2018-02-02 10:25:52,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:25:52,848 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 147 transitions. [2018-02-02 10:25:52,848 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:25:52,848 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 147 transitions. [2018-02-02 10:25:52,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:25:52,848 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:25:52,848 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:25:52,848 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:25:52,849 INFO L82 PathProgramCache]: Analyzing trace with hash 595067423, now seen corresponding path program 1 times [2018-02-02 10:25:52,849 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:25:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:25:52,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:25:52,912 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:25:52,912 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:25:52,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:25:52,912 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:25:52,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:52,913 INFO L182 omatonBuilderFactory]: Interpolants [6373#true, 6374#false, 6375#(= ~unnamed0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))), 6376#(and (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)) |main_#t~mem27|) (= ~unnamed0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8)))), 6377#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)) (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))), 6378#(= |main_#t~mem28| (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))), 6379#(not (= ~unnamed0~RED (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8)))), 6380#(not (= ~unnamed0~RED |main_#t~mem32|))] [2018-02-02 10:25:52,913 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:25:52,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:25:52,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:25:52,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:25:52,914 INFO L87 Difference]: Start difference. First operand 140 states and 147 transitions. Second operand 8 states. [2018-02-02 10:25:53,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:25:53,106 INFO L93 Difference]: Finished difference Result 164 states and 171 transitions. [2018-02-02 10:25:53,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:25:53,106 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-02-02 10:25:53,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:25:53,107 INFO L225 Difference]: With dead ends: 164 [2018-02-02 10:25:53,107 INFO L226 Difference]: Without dead ends: 164 [2018-02-02 10:25:53,107 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:25:53,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-02-02 10:25:53,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 137. [2018-02-02 10:25:53,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 10:25:53,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 143 transitions. [2018-02-02 10:25:53,110 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 143 transitions. Word has length 43 [2018-02-02 10:25:53,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:25:53,110 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 143 transitions. [2018-02-02 10:25:53,110 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:25:53,110 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 143 transitions. [2018-02-02 10:25:53,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:25:53,111 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:25:53,111 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:25:53,111 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:25:53,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1932461330, now seen corresponding path program 1 times [2018-02-02 10:25:53,112 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:25:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:25:53,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:25:53,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:53,191 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:25:53,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:25:53,191 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:25:53,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:53,192 INFO L182 omatonBuilderFactory]: Interpolants [6704#(and (= main_~null~0.base main_~list~0.base) (= main_~list~0.offset main_~null~0.offset)), 6696#true, 6697#false, 6698#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset)), 6699#(and (= |main_#t~mem31.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem31.base|)), 6700#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 6701#(and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 6702#(and (= main_~null~0.base |main_#t~mem35.base|) (= main_~null~0.offset |main_#t~mem35.offset|)), 6703#(and (= main_~null~0.base main_~end~0.base) (= main_~null~0.offset main_~end~0.offset))] [2018-02-02 10:25:53,192 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:25:53,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:25:53,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:25:53,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:25:53,193 INFO L87 Difference]: Start difference. First operand 137 states and 143 transitions. Second operand 9 states. [2018-02-02 10:25:53,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:25:53,483 INFO L93 Difference]: Finished difference Result 182 states and 191 transitions. [2018-02-02 10:25:53,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:25:53,484 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-02-02 10:25:53,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:25:53,485 INFO L225 Difference]: With dead ends: 182 [2018-02-02 10:25:53,485 INFO L226 Difference]: Without dead ends: 182 [2018-02-02 10:25:53,485 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:25:53,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-02 10:25:53,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 150. [2018-02-02 10:25:53,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 10:25:53,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 157 transitions. [2018-02-02 10:25:53,488 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 157 transitions. Word has length 46 [2018-02-02 10:25:53,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:25:53,488 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 157 transitions. [2018-02-02 10:25:53,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:25:53,488 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 157 transitions. [2018-02-02 10:25:53,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:25:53,489 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:25:53,489 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:25:53,489 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:25:53,489 INFO L82 PathProgramCache]: Analyzing trace with hash -223241516, now seen corresponding path program 1 times [2018-02-02 10:25:53,490 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:25:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 10:25:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 10:25:53,532 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-02 10:25:53,548 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-02 10:25:53,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:25:53 BoogieIcfgContainer [2018-02-02 10:25:53,566 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:25:53,567 INFO L168 Benchmark]: Toolchain (without parser) took 6945.06 ms. Allocated memory was 397.9 MB in the beginning and 753.4 MB in the end (delta: 355.5 MB). Free memory was 354.8 MB in the beginning and 697.9 MB in the end (delta: -343.1 MB). Peak memory consumption was 12.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:25:53,568 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 397.9 MB. Free memory is still 361.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:25:53,568 INFO L168 Benchmark]: CACSL2BoogieTranslator took 182.33 ms. Allocated memory is still 397.9 MB. Free memory was 354.8 MB in the beginning and 342.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:25:53,568 INFO L168 Benchmark]: Boogie Preprocessor took 32.49 ms. Allocated memory is still 397.9 MB. Free memory was 342.8 MB in the beginning and 340.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:25:53,568 INFO L168 Benchmark]: RCFGBuilder took 447.99 ms. Allocated memory is still 397.9 MB. Free memory was 340.2 MB in the beginning and 298.3 MB in the end (delta: 41.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:25:53,568 INFO L168 Benchmark]: TraceAbstraction took 6279.10 ms. Allocated memory was 397.9 MB in the beginning and 753.4 MB in the end (delta: 355.5 MB). Free memory was 298.3 MB in the beginning and 697.9 MB in the end (delta: -399.6 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:25:53,569 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 397.9 MB. Free memory is still 361.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 182.33 ms. Allocated memory is still 397.9 MB. Free memory was 354.8 MB in the beginning and 342.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.49 ms. Allocated memory is still 397.9 MB. Free memory was 342.8 MB in the beginning and 340.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 447.99 ms. Allocated memory is still 397.9 MB. Free memory was 340.2 MB in the beginning and 298.3 MB in the end (delta: 41.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6279.10 ms. Allocated memory was 397.9 MB in the beginning and 753.4 MB in the end (delta: 355.5 MB). Free memory was 298.3 MB in the beginning and 697.9 MB in the end (delta: -399.6 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 985. Possible FailurePath: [L987] EXPR, FCALL malloc(sizeof(struct TSLL)) VAL [malloc(sizeof(struct TSLL))={16:0}] [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); VAL [malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L988] FCALL null->next = ((void*)0) VAL [malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L989] FCALL null->prev = ((void*)0) VAL [malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L990] FCALL null->colour = BLACK VAL [malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L992] EXPR, FCALL malloc(sizeof(struct TSLL)) VAL [malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); VAL [list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L993] FCALL list->next = null VAL [list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L994] FCALL list->prev = null VAL [list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L995] FCALL list->colour = BLACK VAL [list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L997] struct TSLL* end = list; VAL [end={21:0}, list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={21:0}, list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={21:0}, list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1030] COND FALSE !(0) VAL [end={21:0}, list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1031] EXPR, FCALL end->colour VAL [end={21:0}, end->colour=1, list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1031] COND FALSE !(0) VAL [end={21:0}, list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1032] COND TRUE null != end VAL [end={21:0}, list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1034] EXPR, FCALL end->colour VAL [end={21:0}, end->colour=1, list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR, FCALL end->next VAL [end={21:0}, end->next={16:0}, list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1041] end = end->next [L1032] COND FALSE !(null != end) VAL [end={16:0}, list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1045] COND TRUE null != list VAL [end={16:0}, list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1047] EXPR, FCALL list->colour VAL [end={16:0}, list={21:0}, list->colour=1, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1047] COND FALSE !(RED == list->colour) [L1056] EXPR, FCALL list->next VAL [end={16:0}, list={21:0}, list->next={16:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1056] end = list->next [L1057] FCALL free(list) VAL [end={16:0}, list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1058] list = end VAL [end={16:0}, list={16:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1045] COND FALSE !(null != list) VAL [end={16:0}, list={16:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1062] return 0; VAL [\result=0, end={16:0}, list={16:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 160 locations, 67 error locations. UNSAFE Result, 6.2s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 4.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1916 SDtfs, 4400 SDslu, 4147 SDs, 0 SdLazy, 5356 SolverSat, 280 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 237 GetRequests, 47 SyntacticMatches, 8 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 4/12 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 596 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 610 NumberOfCodeBlocks, 610 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 543 ConstructedInterpolants, 0 QuantifiedInterpolants, 79542 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 4/12 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-25-53-575.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-25-53-575.csv Received shutdown request...