java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 03:59:12,490 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 03:59:12,491 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 03:59:12,504 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 03:59:12,504 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 03:59:12,505 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 03:59:12,505 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 03:59:12,507 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 03:59:12,509 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 03:59:12,509 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 03:59:12,510 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 03:59:12,510 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 03:59:12,511 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 03:59:12,512 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 03:59:12,512 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 03:59:12,514 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 03:59:12,516 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 03:59:12,517 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 03:59:12,518 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 03:59:12,519 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 03:59:12,521 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 03:59:12,521 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 03:59:12,521 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 03:59:12,522 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 03:59:12,522 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 03:59:12,523 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 03:59:12,523 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 03:59:12,524 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 03:59:12,524 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 03:59:12,524 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 03:59:12,525 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 03:59:12,525 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 03:59:12,534 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 03:59:12,535 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 03:59:12,536 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 03:59:12,536 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 03:59:12,536 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 03:59:12,536 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 03:59:12,536 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 03:59:12,536 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 03:59:12,537 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 03:59:12,537 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 03:59:12,537 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 03:59:12,537 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 03:59:12,537 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 03:59:12,537 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 03:59:12,537 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 03:59:12,538 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 03:59:12,538 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 03:59:12,538 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 03:59:12,538 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 03:59:12,538 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 03:59:12,538 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:59:12,539 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 03:59:12,539 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 03:59:12,567 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 03:59:12,576 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 03:59:12,579 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 03:59:12,580 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 03:59:12,580 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 03:59:12,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-02-04 03:59:12,728 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 03:59:12,729 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 03:59:12,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 03:59:12,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 03:59:12,736 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 03:59:12,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:59:12" (1/1) ... [2018-02-04 03:59:12,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ddcc363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:59:12, skipping insertion in model container [2018-02-04 03:59:12,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:59:12" (1/1) ... [2018-02-04 03:59:12,752 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:59:12,779 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:59:12,867 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:59:12,883 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:59:12,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:59:12 WrapperNode [2018-02-04 03:59:12,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 03:59:12,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 03:59:12,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 03:59:12,891 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 03:59:12,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:59:12" (1/1) ... [2018-02-04 03:59:12,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:59:12" (1/1) ... [2018-02-04 03:59:12,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:59:12" (1/1) ... [2018-02-04 03:59:12,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:59:12" (1/1) ... [2018-02-04 03:59:12,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:59:12" (1/1) ... [2018-02-04 03:59:12,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:59:12" (1/1) ... [2018-02-04 03:59:12,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:59:12" (1/1) ... [2018-02-04 03:59:12,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 03:59:12,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 03:59:12,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 03:59:12,921 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 03:59:12,922 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:59:12" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:59:12,963 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 03:59:12,964 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 03:59:12,964 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 03:59:12,964 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 03:59:12,964 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 03:59:12,964 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 03:59:12,964 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 03:59:12,964 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 03:59:12,964 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 03:59:12,964 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 03:59:12,964 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 03:59:12,964 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 03:59:12,964 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 03:59:12,965 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 03:59:12,965 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 03:59:12,965 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 03:59:12,965 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 03:59:13,292 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 03:59:13,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:59:13 BoogieIcfgContainer [2018-02-04 03:59:13,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 03:59:13,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 03:59:13,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 03:59:13,296 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 03:59:13,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:59:12" (1/3) ... [2018-02-04 03:59:13,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4fb2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:59:13, skipping insertion in model container [2018-02-04 03:59:13,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:59:12" (2/3) ... [2018-02-04 03:59:13,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4fb2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:59:13, skipping insertion in model container [2018-02-04 03:59:13,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:59:13" (3/3) ... [2018-02-04 03:59:13,299 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-02-04 03:59:13,307 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 03:59:13,313 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 49 error locations. [2018-02-04 03:59:13,339 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 03:59:13,339 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 03:59:13,340 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 03:59:13,340 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 03:59:13,340 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 03:59:13,340 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 03:59:13,340 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 03:59:13,340 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 03:59:13,341 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 03:59:13,351 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states. [2018-02-04 03:59:13,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 03:59:13,358 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:59:13,359 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:59:13,359 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:59:13,362 INFO L82 PathProgramCache]: Analyzing trace with hash -610536619, now seen corresponding path program 1 times [2018-02-04 03:59:13,401 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:59:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:59:13,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:59:13,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:13,471 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:59:13,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 03:59:13,472 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:59:13,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:13,473 INFO L182 omatonBuilderFactory]: Interpolants [121#true, 122#false, 123#(= 1 (select |#valid| |main_#t~malloc0.base|)), 124#(= 1 (select |#valid| main_~list~0.base))] [2018-02-04 03:59:13,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:13,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:59:13,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:59:13,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:59:13,484 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 4 states. [2018-02-04 03:59:13,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:59:13,724 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2018-02-04 03:59:13,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:59:13,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 03:59:13,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:59:13,734 INFO L225 Difference]: With dead ends: 131 [2018-02-04 03:59:13,735 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 03:59:13,736 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:59:13,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 03:59:13,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 112. [2018-02-04 03:59:13,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 03:59:13,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2018-02-04 03:59:13,772 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 8 [2018-02-04 03:59:13,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:59:13,773 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2018-02-04 03:59:13,773 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:59:13,773 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-02-04 03:59:13,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 03:59:13,773 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:59:13,774 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:59:13,774 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:59:13,774 INFO L82 PathProgramCache]: Analyzing trace with hash -610536618, now seen corresponding path program 1 times [2018-02-04 03:59:13,775 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:59:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:59:13,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:59:13,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:13,838 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:59:13,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 03:59:13,838 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:59:13,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:13,839 INFO L182 omatonBuilderFactory]: Interpolants [370#true, 371#false, 372#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 373#(and (= main_~list~0.offset 0) (= (select |#length| main_~list~0.base) 8))] [2018-02-04 03:59:13,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:13,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:59:13,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:59:13,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:59:13,841 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 4 states. [2018-02-04 03:59:13,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:59:13,925 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2018-02-04 03:59:13,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 03:59:13,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 03:59:13,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:59:13,927 INFO L225 Difference]: With dead ends: 125 [2018-02-04 03:59:13,927 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 03:59:13,928 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:59:13,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 03:59:13,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2018-02-04 03:59:13,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 03:59:13,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2018-02-04 03:59:13,935 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 8 [2018-02-04 03:59:13,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:59:13,936 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2018-02-04 03:59:13,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:59:13,936 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2018-02-04 03:59:13,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 03:59:13,937 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:59:13,937 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:59:13,937 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:59:13,937 INFO L82 PathProgramCache]: Analyzing trace with hash -631958404, now seen corresponding path program 1 times [2018-02-04 03:59:13,938 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:59:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:59:13,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:59:14,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:14,003 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:59:14,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 03:59:14,004 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:59:14,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:14,004 INFO L182 omatonBuilderFactory]: Interpolants [618#true, 619#false, 620#(= (select |#valid| main_~list~0.base) 1), 621#(= 1 (select |#valid| main_~end~0.base))] [2018-02-04 03:59:14,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:14,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:59:14,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:59:14,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:59:14,005 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 4 states. [2018-02-04 03:59:14,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:59:14,136 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2018-02-04 03:59:14,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:59:14,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 03:59:14,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:59:14,137 INFO L225 Difference]: With dead ends: 127 [2018-02-04 03:59:14,137 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 03:59:14,138 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:59:14,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 03:59:14,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 111. [2018-02-04 03:59:14,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 03:59:14,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2018-02-04 03:59:14,143 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 15 [2018-02-04 03:59:14,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:59:14,143 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2018-02-04 03:59:14,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:59:14,144 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2018-02-04 03:59:14,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 03:59:14,144 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:59:14,144 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:59:14,144 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:59:14,144 INFO L82 PathProgramCache]: Analyzing trace with hash -631958403, now seen corresponding path program 1 times [2018-02-04 03:59:14,146 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:59:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:59:14,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:59:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:14,231 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:59:14,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:59:14,231 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:59:14,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:14,231 INFO L182 omatonBuilderFactory]: Interpolants [864#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 865#(and (= 0 main_~list~0.offset) (= 8 (select |#length| main_~list~0.base))), 866#(and (= 0 main_~list~0.offset) (= 8 (select |#length| main_~list~0.base)) (= (select |#valid| main_~list~0.base) 1)), 867#(and (= main_~end~0.offset 0) (= (select |#valid| main_~end~0.base) 1) (= 8 (select |#length| main_~end~0.base))), 868#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0)), 862#true, 863#false] [2018-02-04 03:59:14,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:14,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:59:14,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:59:14,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:59:14,232 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand 7 states. [2018-02-04 03:59:14,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:59:14,434 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2018-02-04 03:59:14,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:59:14,434 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-02-04 03:59:14,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:59:14,435 INFO L225 Difference]: With dead ends: 146 [2018-02-04 03:59:14,436 INFO L226 Difference]: Without dead ends: 146 [2018-02-04 03:59:14,436 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 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-04 03:59:14,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-04 03:59:14,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 123. [2018-02-04 03:59:14,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 03:59:14,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2018-02-04 03:59:14,443 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 15 [2018-02-04 03:59:14,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:59:14,443 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2018-02-04 03:59:14,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:59:14,444 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2018-02-04 03:59:14,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 03:59:14,444 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:59:14,444 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:59:14,444 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:59:14,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1831161057, now seen corresponding path program 1 times [2018-02-04 03:59:14,445 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:59:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:59:14,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:59:14,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:14,481 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:59:14,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:59:14,481 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:59:14,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:14,482 INFO L182 omatonBuilderFactory]: Interpolants [1144#true, 1145#false, 1146#(= 1 (select |#valid| |main_#t~malloc4.base|)), 1147#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 1148#(= 1 (select |#valid| |main_#t~mem6.base|)), 1149#(= 1 (select |#valid| main_~end~0.base))] [2018-02-04 03:59:14,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:14,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:59:14,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:59:14,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:59:14,482 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand 6 states. [2018-02-04 03:59:14,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:59:14,668 INFO L93 Difference]: Finished difference Result 201 states and 218 transitions. [2018-02-04 03:59:14,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:59:14,668 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-04 03:59:14,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:59:14,669 INFO L225 Difference]: With dead ends: 201 [2018-02-04 03:59:14,669 INFO L226 Difference]: Without dead ends: 201 [2018-02-04 03:59:14,669 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:59:14,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-02-04 03:59:14,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 122. [2018-02-04 03:59:14,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 03:59:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2018-02-04 03:59:14,673 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 18 [2018-02-04 03:59:14,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:59:14,673 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2018-02-04 03:59:14,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:59:14,673 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2018-02-04 03:59:14,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 03:59:14,674 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:59:14,674 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:59:14,674 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:59:14,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1831161056, now seen corresponding path program 1 times [2018-02-04 03:59:14,675 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:59:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:59:14,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:59:14,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:14,753 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:59:14,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:59:14,753 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:59:14,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:14,754 INFO L182 omatonBuilderFactory]: Interpolants [1480#true, 1481#false, 1482#(and (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 1483#(and (= 8 (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))), 1484#(and (= 0 |main_#t~mem6.offset|) (= 8 (select |#length| |main_#t~mem6.base|))), 1485#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0))] [2018-02-04 03:59:14,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:14,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:59:14,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:59:14,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:59:14,755 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand 6 states. [2018-02-04 03:59:14,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:59:14,937 INFO L93 Difference]: Finished difference Result 203 states and 223 transitions. [2018-02-04 03:59:14,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:59:14,937 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-04 03:59:14,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:59:14,938 INFO L225 Difference]: With dead ends: 203 [2018-02-04 03:59:14,938 INFO L226 Difference]: Without dead ends: 203 [2018-02-04 03:59:14,938 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:59:14,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-04 03:59:14,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 117. [2018-02-04 03:59:14,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 03:59:14,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2018-02-04 03:59:14,942 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 18 [2018-02-04 03:59:14,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:59:14,942 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2018-02-04 03:59:14,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:59:14,943 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2018-02-04 03:59:14,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 03:59:14,943 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:59:14,943 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:59:14,943 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:59:14,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1015590286, now seen corresponding path program 1 times [2018-02-04 03:59:14,945 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:59:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:59:14,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:59:14,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:14,992 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:59:14,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:59:14,993 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:59:14,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:14,993 INFO L182 omatonBuilderFactory]: Interpolants [1817#true, 1818#false, 1819#(= 1 (select |#valid| |main_#t~malloc11.base|)), 1820#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 1821#(= 1 (select |#valid| |main_#t~mem13.base|)), 1822#(= 1 (select |#valid| main_~end~0.base))] [2018-02-04 03:59:14,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:14,993 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:59:14,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:59:14,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:59:14,994 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand 6 states. [2018-02-04 03:59:15,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:59:15,155 INFO L93 Difference]: Finished difference Result 214 states and 234 transitions. [2018-02-04 03:59:15,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:59:15,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 03:59:15,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:59:15,156 INFO L225 Difference]: With dead ends: 214 [2018-02-04 03:59:15,156 INFO L226 Difference]: Without dead ends: 214 [2018-02-04 03:59:15,156 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:59:15,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-02-04 03:59:15,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 116. [2018-02-04 03:59:15,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 03:59:15,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2018-02-04 03:59:15,160 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 26 [2018-02-04 03:59:15,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:59:15,160 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2018-02-04 03:59:15,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:59:15,160 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2018-02-04 03:59:15,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 03:59:15,161 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:59:15,161 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:59:15,161 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:59:15,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1015590287, now seen corresponding path program 1 times [2018-02-04 03:59:15,162 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:59:15,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:59:15,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:59:15,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:15,236 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:59:15,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:59:15,237 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:59:15,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:15,237 INFO L182 omatonBuilderFactory]: Interpolants [2160#true, 2161#false, 2162#(and (= 0 |main_#t~malloc11.offset|) (= 8 (select |#length| |main_#t~malloc11.base|))), 2163#(and (= 8 (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))), 2164#(and (= 8 (select |#length| |main_#t~mem13.base|)) (= 0 |main_#t~mem13.offset|)), 2165#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0))] [2018-02-04 03:59:15,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:15,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:59:15,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:59:15,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:59:15,238 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand 6 states. [2018-02-04 03:59:15,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:59:15,434 INFO L93 Difference]: Finished difference Result 205 states and 226 transitions. [2018-02-04 03:59:15,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:59:15,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 03:59:15,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:59:15,435 INFO L225 Difference]: With dead ends: 205 [2018-02-04 03:59:15,435 INFO L226 Difference]: Without dead ends: 205 [2018-02-04 03:59:15,435 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:59:15,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-04 03:59:15,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 106. [2018-02-04 03:59:15,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 03:59:15,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2018-02-04 03:59:15,438 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 26 [2018-02-04 03:59:15,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:59:15,438 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2018-02-04 03:59:15,438 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:59:15,438 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2018-02-04 03:59:15,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 03:59:15,439 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:59:15,439 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:59:15,439 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:59:15,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1810127631, now seen corresponding path program 1 times [2018-02-04 03:59:15,440 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:59:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:59:15,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:59:15,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:15,475 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:59:15,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:59:15,476 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:59:15,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:15,476 INFO L182 omatonBuilderFactory]: Interpolants [2484#true, 2485#false, 2486#(not (= 0 |main_#t~malloc0.base|)), 2487#(not (= 0 main_~list~0.base)), 2488#(not (= 0 main_~end~0.base))] [2018-02-04 03:59:15,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:15,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:59:15,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:59:15,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:59:15,476 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 5 states. [2018-02-04 03:59:15,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:59:15,540 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2018-02-04 03:59:15,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:59:15,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-02-04 03:59:15,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:59:15,541 INFO L225 Difference]: With dead ends: 121 [2018-02-04 03:59:15,541 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 03:59:15,541 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:59:15,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 03:59:15,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 106. [2018-02-04 03:59:15,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 03:59:15,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2018-02-04 03:59:15,544 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 27 [2018-02-04 03:59:15,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:59:15,544 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2018-02-04 03:59:15,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:59:15,544 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2018-02-04 03:59:15,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 03:59:15,545 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:59:15,545 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] [2018-02-04 03:59:15,546 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:59:15,546 INFO L82 PathProgramCache]: Analyzing trace with hash 292737253, now seen corresponding path program 1 times [2018-02-04 03:59:15,547 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:59:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:59:15,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:59:15,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:15,611 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:59:15,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:59:15,612 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:59:15,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:15,612 INFO L182 omatonBuilderFactory]: Interpolants [2720#true, 2721#false, 2722#(= |main_#t~mem16| (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4))), 2723#(= ~unnamed0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4))), 2724#(= ~unnamed0~BLACK |main_#t~mem17|)] [2018-02-04 03:59:15,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:15,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:59:15,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:59:15,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:59:15,612 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand 5 states. [2018-02-04 03:59:15,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:59:15,715 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-02-04 03:59:15,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:59:15,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-04 03:59:15,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:59:15,716 INFO L225 Difference]: With dead ends: 114 [2018-02-04 03:59:15,716 INFO L226 Difference]: Without dead ends: 114 [2018-02-04 03:59:15,717 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-04 03:59:15,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-04 03:59:15,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 105. [2018-02-04 03:59:15,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 03:59:15,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2018-02-04 03:59:15,719 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 28 [2018-02-04 03:59:15,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:59:15,719 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2018-02-04 03:59:15,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:59:15,719 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2018-02-04 03:59:15,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 03:59:15,720 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:59:15,720 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] [2018-02-04 03:59:15,720 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:59:15,721 INFO L82 PathProgramCache]: Analyzing trace with hash -458774714, now seen corresponding path program 1 times [2018-02-04 03:59:15,721 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:59:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:59:15,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:59:15,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:15,806 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:59:15,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:59:15,806 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:59:15,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:15,807 INFO L182 omatonBuilderFactory]: Interpolants [2946#true, 2947#false, 2948#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 2949#(and (= 0 (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))), 2950#(and (= 0 |main_#t~mem20.offset|) (= |main_#t~mem20.base| 0))] [2018-02-04 03:59:15,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:15,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:59:15,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:59:15,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:59:15,808 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 5 states. [2018-02-04 03:59:15,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:59:15,916 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2018-02-04 03:59:15,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:59:15,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-02-04 03:59:15,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:59:15,917 INFO L225 Difference]: With dead ends: 125 [2018-02-04 03:59:15,917 INFO L226 Difference]: Without dead ends: 110 [2018-02-04 03:59:15,918 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:59:15,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-04 03:59:15,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-02-04 03:59:15,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 03:59:15,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2018-02-04 03:59:15,920 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 34 [2018-02-04 03:59:15,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:59:15,920 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2018-02-04 03:59:15,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:59:15,921 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2018-02-04 03:59:15,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 03:59:15,921 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:59:15,922 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:59:15,922 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:59:15,922 INFO L82 PathProgramCache]: Analyzing trace with hash -799027183, now seen corresponding path program 1 times [2018-02-04 03:59:15,923 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:59:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:59:15,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:59:16,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:16,071 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:59:16,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:59:16,071 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:59:16,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:16,072 INFO L182 omatonBuilderFactory]: Interpolants [3200#(= 1 (select |#valid| main_~end~0.base)), 3188#true, 3189#false, 3190#(= (select |#valid| main_~list~0.base) 1), 3191#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 3192#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset)), 3193#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 3194#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|))), 3195#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset))), 3196#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1)), 3197#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 3198#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 3199#(= 1 (select |#valid| |main_#t~mem21.base|))] [2018-02-04 03:59:16,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:16,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:59:16,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:59:16,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:59:16,073 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 13 states. [2018-02-04 03:59:16,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:59:16,533 INFO L93 Difference]: Finished difference Result 197 states and 210 transitions. [2018-02-04 03:59:16,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:59:16,533 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2018-02-04 03:59:16,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:59:16,534 INFO L225 Difference]: With dead ends: 197 [2018-02-04 03:59:16,534 INFO L226 Difference]: Without dead ends: 197 [2018-02-04 03:59:16,534 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2018-02-04 03:59:16,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-04 03:59:16,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 140. [2018-02-04 03:59:16,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 03:59:16,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 151 transitions. [2018-02-04 03:59:16,538 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 151 transitions. Word has length 45 [2018-02-04 03:59:16,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:59:16,538 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 151 transitions. [2018-02-04 03:59:16,538 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:59:16,538 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 151 transitions. [2018-02-04 03:59:16,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 03:59:16,541 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:59:16,542 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:59:16,542 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:59:16,542 INFO L82 PathProgramCache]: Analyzing trace with hash -799027182, now seen corresponding path program 1 times [2018-02-04 03:59:16,543 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:59:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:59:16,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:59:16,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:16,738 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:59:16,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 03:59:16,738 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:59:16,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:16,739 INFO L182 omatonBuilderFactory]: Interpolants [3568#(and (= 0 |main_#t~mem21.offset|) (= 8 (select |#length| |main_#t~mem21.base|))), 3569#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0)), 3558#true, 3559#false, 3560#(= (select |#valid| main_~list~0.base) 1), 3561#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 3562#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 3563#(and (= main_~end~0.base main_~list~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 3564#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem6.base|))), 3565#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset))) (not (= main_~end~0.base main_~list~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset))), 3566#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 3567#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))] [2018-02-04 03:59:16,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:16,739 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 03:59:16,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 03:59:16,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:59:16,740 INFO L87 Difference]: Start difference. First operand 140 states and 151 transitions. Second operand 12 states. [2018-02-04 03:59:17,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:59:17,128 INFO L93 Difference]: Finished difference Result 208 states and 224 transitions. [2018-02-04 03:59:17,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 03:59:17,129 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-02-04 03:59:17,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:59:17,129 INFO L225 Difference]: With dead ends: 208 [2018-02-04 03:59:17,129 INFO L226 Difference]: Without dead ends: 208 [2018-02-04 03:59:17,130 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:59:17,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-04 03:59:17,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 142. [2018-02-04 03:59:17,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-04 03:59:17,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2018-02-04 03:59:17,133 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 45 [2018-02-04 03:59:17,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:59:17,133 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2018-02-04 03:59:17,133 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 03:59:17,134 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2018-02-04 03:59:17,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 03:59:17,134 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:59:17,134 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:59:17,134 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:59:17,134 INFO L82 PathProgramCache]: Analyzing trace with hash -49358637, now seen corresponding path program 1 times [2018-02-04 03:59:17,135 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:59:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:59:17,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:59:17,610 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:17,610 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:59:17,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 03:59:17,610 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:59:17,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:17,610 INFO L182 omatonBuilderFactory]: Interpolants [3936#true, 3937#false, 3938#(= ~unnamed0~RED (select |#valid| 0)), 3939#(and (= 0 |main_#t~malloc0.offset|) (= ~unnamed0~RED (select |#valid| 0))), 3940#(and (= main_~list~0.offset 0) (= ~unnamed0~RED (select |#valid| 0))), 3941#(and (= main_~list~0.offset 0) (= ~unnamed0~RED (select |#valid| 0)) (= (select |#valid| main_~list~0.base) 1)), 3942#(and (= main_~list~0.offset 0) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (= ~unnamed0~RED (select |#valid| 0))), 3943#(and (= main_~list~0.offset 0) (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset) (= ~unnamed0~RED (select |#valid| 0)) (= 0 |main_#t~malloc4.offset|)), 3944#(and (= main_~list~0.offset 0) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= ~unnamed0~RED (select |#valid| 0)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 3945#(and (= main_~list~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.offset|) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= ~unnamed0~RED (select |#valid| 0)) (= 0 |main_#t~mem6.offset|) (not (= main_~list~0.base |main_#t~mem6.base|))), 3946#(and (= main_~list~0.offset 0) (= main_~list~0.offset main_~end~0.offset) (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= ~unnamed0~RED (select |#valid| 0)) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset))), 3947#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset 0) (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= ~unnamed0~RED (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 3948#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~list~0.offset 4))) (= ~unnamed0~RED (select |#valid| 0))), 3949#(and (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (= ~unnamed0~RED (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 3950#(and (= 0 |main_#t~mem21.offset|) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) |main_#t~mem21.offset|)) (= ~unnamed0~RED (select |#valid| 0)) (= 1 (select (select |#memory_int| |main_#t~mem21.base|) (+ 0 4)))), 3951#(and (= 1 (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4))) (= ~unnamed0~RED (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 3952#(and (= ~unnamed0~RED (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 1 |main_#t~mem17|)), 3953#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 1 (select |#valid| 0))), 3954#(and (= 0 |main_#t~mem18.base|) (= 1 (select |#valid| 0))), 3955#(= (select |#valid| main_~end~0.base) 1)] [2018-02-04 03:59:17,611 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:17,611 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 03:59:17,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 03:59:17,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:59:17,611 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 20 states. [2018-02-04 03:59:18,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:59:18,466 INFO L93 Difference]: Finished difference Result 206 states and 219 transitions. [2018-02-04 03:59:18,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 03:59:18,466 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2018-02-04 03:59:18,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:59:18,467 INFO L225 Difference]: With dead ends: 206 [2018-02-04 03:59:18,467 INFO L226 Difference]: Without dead ends: 206 [2018-02-04 03:59:18,468 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=366, Invalid=1356, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 03:59:18,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-04 03:59:18,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 139. [2018-02-04 03:59:18,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-04 03:59:18,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 149 transitions. [2018-02-04 03:59:18,471 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 149 transitions. Word has length 49 [2018-02-04 03:59:18,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:59:18,471 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 149 transitions. [2018-02-04 03:59:18,471 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 03:59:18,471 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 149 transitions. [2018-02-04 03:59:18,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 03:59:18,472 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:59:18,472 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:59:18,472 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:59:18,473 INFO L82 PathProgramCache]: Analyzing trace with hash -384702824, now seen corresponding path program 1 times [2018-02-04 03:59:18,473 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:59:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:59:18,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:59:18,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:18,676 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:59:18,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 03:59:18,676 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:59:18,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:18,677 INFO L182 omatonBuilderFactory]: Interpolants [4352#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 4353#(and (not (= main_~list~0.base |main_#t~malloc11.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc11.base|)) main_~list~0.base) main_~list~0.offset))), 4354#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 1 (select |#valid| main_~end~0.base))), 4355#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem13.base|))), 4356#(and (not (= main_~end~0.base main_~list~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)))), 4357#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 4358#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 4359#(= 1 (select |#valid| |main_#t~mem21.base|)), 4360#(= 1 (select |#valid| main_~end~0.base)), 4345#true, 4346#false, 4347#(= (select |#valid| main_~list~0.base) 1), 4348#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 4349#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset)), 4350#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 4351#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1))] [2018-02-04 03:59:18,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:18,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 03:59:18,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 03:59:18,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:59:18,677 INFO L87 Difference]: Start difference. First operand 139 states and 149 transitions. Second operand 16 states. [2018-02-04 03:59:19,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:59:19,170 INFO L93 Difference]: Finished difference Result 232 states and 247 transitions. [2018-02-04 03:59:19,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 03:59:19,171 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2018-02-04 03:59:19,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:59:19,171 INFO L225 Difference]: With dead ends: 232 [2018-02-04 03:59:19,171 INFO L226 Difference]: Without dead ends: 232 [2018-02-04 03:59:19,172 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=783, Unknown=0, NotChecked=0, Total=992 [2018-02-04 03:59:19,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-04 03:59:19,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 170. [2018-02-04 03:59:19,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-04 03:59:19,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 183 transitions. [2018-02-04 03:59:19,175 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 183 transitions. Word has length 51 [2018-02-04 03:59:19,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:59:19,175 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 183 transitions. [2018-02-04 03:59:19,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 03:59:19,175 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 183 transitions. [2018-02-04 03:59:19,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 03:59:19,176 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:59:19,176 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:59:19,176 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:59:19,176 INFO L82 PathProgramCache]: Analyzing trace with hash -384702823, now seen corresponding path program 1 times [2018-02-04 03:59:19,177 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:59:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:59:19,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:59:19,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:19,436 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:59:19,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 03:59:19,436 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:59:19,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:19,437 INFO L182 omatonBuilderFactory]: Interpolants [4800#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 4801#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1) (= 8 (select |#length| |main_#t~mem6.base|))), 4802#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= 8 (select |#length| main_~end~0.base))), 4803#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= 8 (select |#length| main_~end~0.base))), 4804#(and (not (= main_~list~0.base |main_#t~malloc11.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc11.base|)) main_~list~0.base) main_~list~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc11.offset|)) main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| main_~end~0.base))), 4805#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| main_~end~0.base))), 4806#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem13.base|))), 4807#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset))) (not (= main_~end~0.base main_~list~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset))), 4808#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 4809#(and (= 8 (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))), 4810#(and (= 0 |main_#t~mem21.offset|) (= 8 (select |#length| |main_#t~mem21.base|))), 4811#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0)), 4795#true, 4796#false, 4797#(= (select |#valid| main_~list~0.base) 1), 4798#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 4799#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|)))] [2018-02-04 03:59:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:19,437 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 03:59:19,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 03:59:19,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:59:19,437 INFO L87 Difference]: Start difference. First operand 170 states and 183 transitions. Second operand 17 states. [2018-02-04 03:59:20,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:59:20,054 INFO L93 Difference]: Finished difference Result 243 states and 261 transitions. [2018-02-04 03:59:20,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 03:59:20,054 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 51 [2018-02-04 03:59:20,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:59:20,055 INFO L225 Difference]: With dead ends: 243 [2018-02-04 03:59:20,055 INFO L226 Difference]: Without dead ends: 243 [2018-02-04 03:59:20,055 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=648, Unknown=0, NotChecked=0, Total=812 [2018-02-04 03:59:20,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-04 03:59:20,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 172. [2018-02-04 03:59:20,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-04 03:59:20,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 185 transitions. [2018-02-04 03:59:20,058 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 185 transitions. Word has length 51 [2018-02-04 03:59:20,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:59:20,058 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 185 transitions. [2018-02-04 03:59:20,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 03:59:20,058 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 185 transitions. [2018-02-04 03:59:20,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 03:59:20,058 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:59:20,058 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:59:20,058 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:59:20,059 INFO L82 PathProgramCache]: Analyzing trace with hash 770888557, now seen corresponding path program 1 times [2018-02-04 03:59:20,059 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:59:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:59:20,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:59:20,095 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:59:20,095 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:59:20,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:59:20,095 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:59:20,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:20,096 INFO L182 omatonBuilderFactory]: Interpolants [5251#true, 5252#false, 5253#(and (= |main_#t~mem20.offset| (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 5254#(or (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))), 5255#(or (not (= 0 |main_#t~mem21.offset|)) (not (= |main_#t~mem21.base| 0))), 5256#(or (not (= main_~end~0.base 0)) (not (= 0 main_~end~0.offset)))] [2018-02-04 03:59:20,096 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 03:59:20,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:59:20,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:59:20,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:59:20,096 INFO L87 Difference]: Start difference. First operand 172 states and 185 transitions. Second operand 6 states. [2018-02-04 03:59:20,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:59:20,204 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2018-02-04 03:59:20,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:59:20,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-02-04 03:59:20,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:59:20,205 INFO L225 Difference]: With dead ends: 142 [2018-02-04 03:59:20,205 INFO L226 Difference]: Without dead ends: 142 [2018-02-04 03:59:20,205 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:59:20,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-04 03:59:20,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2018-02-04 03:59:20,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-04 03:59:20,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2018-02-04 03:59:20,207 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 52 [2018-02-04 03:59:20,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:59:20,207 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2018-02-04 03:59:20,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:59:20,207 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2018-02-04 03:59:20,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 03:59:20,208 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:59:20,208 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:59:20,208 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:59:20,208 INFO L82 PathProgramCache]: Analyzing trace with hash 619545780, now seen corresponding path program 2 times [2018-02-04 03:59:20,209 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:59:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:59:20,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:59:20,407 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:20,407 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:59:20,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:59:20,407 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:59:20,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:20,407 INFO L182 omatonBuilderFactory]: Interpolants [5541#true, 5542#false, 5543#(= (select |#valid| main_~list~0.base) 1), 5544#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 5545#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset)), 5546#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 5547#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.offset|) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|))), 5548#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset))), 5549#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 0 (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)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 5550#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))), 5551#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))), 5552#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) |main_#t~mem21.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) |main_#t~mem21.offset|))), 5553#(and (= 0 (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))), 5554#(and (= 0 |main_#t~mem20.offset|) (= |main_#t~mem20.base| 0))] [2018-02-04 03:59:20,408 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:20,408 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:59:20,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:59:20,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:59:20,408 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 14 states. [2018-02-04 03:59:20,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:59:20,694 INFO L93 Difference]: Finished difference Result 151 states and 158 transitions. [2018-02-04 03:59:20,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 03:59:20,695 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-02-04 03:59:20,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:59:20,695 INFO L225 Difference]: With dead ends: 151 [2018-02-04 03:59:20,695 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 03:59:20,696 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:59:20,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 03:59:20,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2018-02-04 03:59:20,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 03:59:20,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-02-04 03:59:20,698 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 55 [2018-02-04 03:59:20,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:59:20,698 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-02-04 03:59:20,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:59:20,699 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-02-04 03:59:20,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 03:59:20,699 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:59:20,699 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:59:20,699 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:59:20,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1439411238, now seen corresponding path program 1 times [2018-02-04 03:59:20,700 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:59:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:59:20,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:59:20,960 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:20,961 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:59:20,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 03:59:20,961 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:59:20,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-04 03:59:20,961 INFO L182 omatonBuilderFactory]: Interpolants [5856#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))), 5857#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))), 5858#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) |main_#t~mem21.offset|))), 5859#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 5860#(= 1 (select |#valid| |main_#t~mem18.base|)), 5861#(= 1 (select |#valid| main_~end~0.base)), 5842#true, 5843#false, 5844#(= (select |#valid| main_~list~0.base) 1), 5845#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 5846#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset)), 5847#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 5848#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|) (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 5849#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 5850#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 5851#(and (not (= main_~list~0.base |main_#t~malloc11.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc11.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc11.base|)) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc11.offset|)) main_~list~0.base) main_~list~0.offset))), 5852#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 5853#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem13.base|)) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem13.base|))), 5854#(and (not (= main_~end~0.base main_~list~0.base)) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset))) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)))), 5855#(and (not (= main_~end~0.base main_~list~0.base)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= 1 (select |#valid| main_~end~0.base)))] [2018-02-04 03:59:20,961 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:20,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 03:59:20,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 03:59:20,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:59:20,962 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 20 states. [2018-02-04 03:59:21,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:59:21,508 INFO L93 Difference]: Finished difference Result 161 states and 168 transitions. [2018-02-04 03:59:21,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 03:59:21,508 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-02-04 03:59:21,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:59:21,508 INFO L225 Difference]: With dead ends: 161 [2018-02-04 03:59:21,508 INFO L226 Difference]: Without dead ends: 161 [2018-02-04 03:59:21,509 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=1070, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 03:59:21,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-04 03:59:21,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 118. [2018-02-04 03:59:21,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 03:59:21,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-02-04 03:59:21,510 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 55 [2018-02-04 03:59:21,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:59:21,510 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-02-04 03:59:21,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 03:59:21,510 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-02-04 03:59:21,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 03:59:21,511 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:59:21,511 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:59:21,511 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:59:21,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1439411237, now seen corresponding path program 1 times [2018-02-04 03:59:21,511 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:59:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:59:21,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:59:21,769 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:21,769 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:59:21,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:59:21,769 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:59:21,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:21,770 INFO L182 omatonBuilderFactory]: Interpolants [6176#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 6177#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset)), 6178#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 6179#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|) (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 6180#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 6181#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 6182#(and (not (= main_~list~0.base |main_#t~malloc11.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc11.base|)) main_~list~0.base) main_~list~0.offset)) (= 0 |main_#t~malloc11.offset|) (not (= main_~end~0.base |main_#t~malloc11.base|)) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc11.offset|)) main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| |main_#t~malloc11.base|))), 6183#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))))), 6184#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem13.base|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem13.base|))), 6185#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)))) (not (= main_~end~0.base main_~list~0.base)) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)))), 6186#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))), 6187#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))), 6188#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) |main_#t~mem21.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) |main_#t~mem21.offset|)))), 6189#(and (= 8 (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))), 6190#(and (= 8 (select |#length| |main_#t~mem18.base|)) (= 0 |main_#t~mem18.offset|)), 6191#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0)), 6173#true, 6174#false, 6175#(= (select |#valid| main_~list~0.base) 1)] [2018-02-04 03:59:21,770 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:21,770 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:59:21,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:59:21,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:59:21,770 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 19 states. [2018-02-04 03:59:22,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:59:22,430 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2018-02-04 03:59:22,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 03:59:22,431 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-02-04 03:59:22,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:59:22,431 INFO L225 Difference]: With dead ends: 159 [2018-02-04 03:59:22,431 INFO L226 Difference]: Without dead ends: 159 [2018-02-04 03:59:22,431 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2018-02-04 03:59:22,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-04 03:59:22,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 118. [2018-02-04 03:59:22,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 03:59:22,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-02-04 03:59:22,433 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 55 [2018-02-04 03:59:22,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:59:22,433 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-02-04 03:59:22,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:59:22,433 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-02-04 03:59:22,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 03:59:22,434 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:59:22,434 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:59:22,434 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:59:22,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1117992346, now seen corresponding path program 3 times [2018-02-04 03:59:22,434 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:59:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:59:22,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:59:22,597 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:22,597 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:59:22,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 03:59:22,597 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:59:22,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:22,597 INFO L182 omatonBuilderFactory]: Interpolants [6496#false, 6497#(= (select |#valid| main_~list~0.base) 1), 6498#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 6499#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset)), 6500#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 6501#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 6502#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 6503#(and (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc4.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc4.base|))), 6504#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1)), 6505#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem6.base|))), 6506#(and (not (= main_~end~0.base main_~list~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)))), 6507#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 6508#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 6509#(= 1 (select |#valid| |main_#t~mem21.base|)), 6510#(= 1 (select |#valid| main_~end~0.base)), 6495#true] [2018-02-04 03:59:22,597 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:22,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 03:59:22,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 03:59:22,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:59:22,598 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 16 states. [2018-02-04 03:59:23,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:59:23,107 INFO L93 Difference]: Finished difference Result 194 states and 203 transitions. [2018-02-04 03:59:23,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 03:59:23,108 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2018-02-04 03:59:23,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:59:23,108 INFO L225 Difference]: With dead ends: 194 [2018-02-04 03:59:23,109 INFO L226 Difference]: Without dead ends: 194 [2018-02-04 03:59:23,109 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2018-02-04 03:59:23,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-02-04 03:59:23,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 150. [2018-02-04 03:59:23,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-04 03:59:23,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2018-02-04 03:59:23,112 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 56 [2018-02-04 03:59:23,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:59:23,112 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2018-02-04 03:59:23,112 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 03:59:23,112 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2018-02-04 03:59:23,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 03:59:23,113 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:59:23,113 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:59:23,113 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:59:23,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1117992345, now seen corresponding path program 2 times [2018-02-04 03:59:23,114 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:59:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:59:23,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:59:23,394 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:23,394 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:59:23,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 03:59:23,394 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:59:23,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:23,395 INFO L182 omatonBuilderFactory]: Interpolants [6883#true, 6884#false, 6885#(= (select |#valid| main_~list~0.base) 1), 6886#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 6887#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 6888#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 6889#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1) (= 8 (select |#length| |main_#t~mem6.base|))), 6890#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= 8 (select |#length| main_~end~0.base))), 6891#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= 8 (select |#length| main_~end~0.base))), 6892#(and (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc4.base|)) main_~list~0.base) main_~list~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc4.offset|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc4.base|)) (= 8 (select |#length| main_~end~0.base))), 6893#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| main_~end~0.base))), 6894#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem6.base|))), 6895#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset))) (not (= main_~end~0.base main_~list~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset))), 6896#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 6897#(and (= 8 (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))), 6898#(and (= 0 |main_#t~mem21.offset|) (= 8 (select |#length| |main_#t~mem21.base|))), 6899#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0))] [2018-02-04 03:59:23,395 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:59:23,395 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 03:59:23,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 03:59:23,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:59:23,396 INFO L87 Difference]: Start difference. First operand 150 states and 160 transitions. Second operand 17 states. [2018-02-04 03:59:23,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:59:23,927 INFO L93 Difference]: Finished difference Result 200 states and 212 transitions. [2018-02-04 03:59:23,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 03:59:23,927 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-02-04 03:59:23,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:59:23,928 INFO L225 Difference]: With dead ends: 200 [2018-02-04 03:59:23,928 INFO L226 Difference]: Without dead ends: 200 [2018-02-04 03:59:23,929 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2018-02-04 03:59:23,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-02-04 03:59:23,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 152. [2018-02-04 03:59:23,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-04 03:59:23,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2018-02-04 03:59:23,930 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 56 [2018-02-04 03:59:23,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:59:23,930 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2018-02-04 03:59:23,931 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 03:59:23,931 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2018-02-04 03:59:23,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 03:59:23,931 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:59:23,931 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:59:23,931 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr48EnsuresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:59:23,931 INFO L82 PathProgramCache]: Analyzing trace with hash -546616445, now seen corresponding path program 1 times [2018-02-04 03:59:23,932 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:59:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 03:59:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 03:59:23,975 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 03:59:24,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:59:24 BoogieIcfgContainer [2018-02-04 03:59:24,008 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 03:59:24,009 INFO L168 Benchmark]: Toolchain (without parser) took 11280.60 ms. Allocated memory was 402.1 MB in the beginning and 804.3 MB in the end (delta: 402.1 MB). Free memory was 359.0 MB in the beginning and 624.2 MB in the end (delta: -265.2 MB). Peak memory consumption was 136.9 MB. Max. memory is 5.3 GB. [2018-02-04 03:59:24,010 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 402.1 MB. Free memory is still 364.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:59:24,011 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.88 ms. Allocated memory is still 402.1 MB. Free memory was 359.0 MB in the beginning and 345.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 03:59:24,011 INFO L168 Benchmark]: Boogie Preprocessor took 29.38 ms. Allocated memory is still 402.1 MB. Free memory is still 345.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:59:24,011 INFO L168 Benchmark]: RCFGBuilder took 371.64 ms. Allocated memory is still 402.1 MB. Free memory was 343.2 MB in the beginning and 310.6 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 5.3 GB. [2018-02-04 03:59:24,011 INFO L168 Benchmark]: TraceAbstraction took 10715.46 ms. Allocated memory was 402.1 MB in the beginning and 804.3 MB in the end (delta: 402.1 MB). Free memory was 310.6 MB in the beginning and 624.2 MB in the end (delta: -313.7 MB). Peak memory consumption was 88.5 MB. Max. memory is 5.3 GB. [2018-02-04 03:59:24,012 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.13 ms. Allocated memory is still 402.1 MB. Free memory is still 364.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 160.88 ms. Allocated memory is still 402.1 MB. Free memory was 359.0 MB in the beginning and 345.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.38 ms. Allocated memory is still 402.1 MB. Free memory is still 345.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 371.64 ms. Allocated memory is still 402.1 MB. Free memory was 343.2 MB in the beginning and 310.6 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10715.46 ms. Allocated memory was 402.1 MB in the beginning and 804.3 MB in the end (delta: 402.1 MB). Free memory was 310.6 MB in the beginning and 624.2 MB in the end (delta: -313.7 MB). Peak memory consumption was 88.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L995] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={23:0}] [L995] SLL* list = malloc(sizeof(SLL)); VAL [list={23:0}, malloc(sizeof(SLL))={23:0}] [L996] FCALL list->next = ((void*)0) VAL [list={23:0}, malloc(sizeof(SLL))={23:0}] [L997] FCALL list->colour = BLACK VAL [list={23:0}, malloc(sizeof(SLL))={23:0}] [L999] SLL* end = list; VAL [end={23:0}, list={23:0}, malloc(sizeof(SLL))={23:0}] [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={23:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={24:0}] [L1005] FCALL end->next = malloc(sizeof(SLL)) VAL [end={23:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={24:0}] [L1006] EXPR, FCALL end->next VAL [end={23:0}, end->next={24:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={24:0}] [L1006] end = end->next [L1007] FCALL end->next = ((void*)0) VAL [end={24:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={24:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1015] FCALL end->colour = RED VAL [end={24:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={24:0}] [L1016] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={24:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}] [L1016] FCALL end->next = malloc(sizeof(SLL)) VAL [end={24:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}] [L1017] EXPR, FCALL end->next VAL [end={24:0}, end->next={21:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}] [L1017] end = end->next [L1018] FCALL end->next = ((void*)0) VAL [end={21:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}] [L1019] FCALL end->colour = BLACK VAL [end={21:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list VAL [end={23:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}] [L1027] COND FALSE !(!(((void*)0) != end)) VAL [end={23:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}] [L1027] COND FALSE !(0) VAL [end={23:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}] [L1028] EXPR, FCALL end->colour VAL [end={23:0}, end->colour=1, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}] [L1028] COND FALSE !(!(BLACK == end->colour)) [L1028] COND FALSE !(0) VAL [end={23:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}] [L1030] COND TRUE ((void*)0) != end VAL [end={23:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}] [L1032] EXPR, FCALL end->colour VAL [end={23:0}, end->colour=1, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}] [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR, FCALL end->next VAL [end={23:0}, end->next={24:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}] [L1038] COND FALSE !(!(end->next)) [L1038] COND FALSE !(0) VAL [end={23:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}] [L1039] EXPR, FCALL end->next VAL [end={23:0}, end->next={24:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}] [L1039] end = end->next [L1030] COND TRUE ((void*)0) != end VAL [end={24:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}] [L1032] EXPR, FCALL end->colour VAL [end={24:0}, end->colour=0, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}] [L1032] COND TRUE RED == end->colour [L1034] EXPR, FCALL end->next VAL [end={24:0}, end->next={21:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}] [L1034] end = end->next [L1035] EXPR, FCALL end->next VAL [end={21:0}, end->next={0:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}] [L1035] end = end->next [L1038] FCALL end->next VAL [end={0:0}, list={23:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 118 locations, 49 error locations. UNSAFE Result, 10.6s OverallTime, 23 OverallIterations, 3 TraceHistogramMax, 7.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1473 SDtfs, 5042 SDslu, 5893 SDs, 0 SdLazy, 9219 SolverSat, 772 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 406 GetRequests, 40 SyntacticMatches, 20 SemanticMatches, 346 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1487 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 17/112 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, 22 MinimizatonAttempts, 967 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 851 NumberOfCodeBlocks, 851 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 771 ConstructedInterpolants, 0 QuantifiedInterpolants, 477172 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 12 PerfectInterpolantSequences, 17/112 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_03-59-24-017.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_03-59-24-017.csv Received shutdown request...