java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-queue_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:27:29,689 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:27:29,691 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:27:29,704 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:27:29,704 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:27:29,705 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:27:29,706 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:27:29,707 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:27:29,709 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:27:29,710 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:27:29,711 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:27:29,711 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:27:29,712 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:27:29,713 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:27:29,714 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:27:29,715 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:27:29,717 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:27:29,719 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:27:29,720 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:27:29,721 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:27:29,723 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:27:29,723 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:27:29,724 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:27:29,725 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:27:29,725 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:27:29,726 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:27:29,726 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:27:29,727 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:27:29,727 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:27:29,727 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:27:29,727 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:27:29,728 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 10:27:29,737 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:27:29,737 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:27:29,738 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:27:29,738 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:27:29,738 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:27:29,739 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:27:29,739 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:27:29,739 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:27:29,739 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:27:29,739 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:27:29,739 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:27:29,739 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:27:29,740 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:27:29,740 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:27:29,740 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:27:29,740 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:27:29,740 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:27:29,740 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:27:29,740 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:27:29,740 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:27:29,740 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:27:29,741 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:27:29,741 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:27:29,770 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:27:29,778 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:27:29,781 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:27:29,782 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:27:29,782 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:27:29,783 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-queue_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:27:29,919 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:27:29,920 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:27:29,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:27:29,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:27:29,924 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:27:29,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:27:29" (1/1) ... [2018-02-02 10:27:29,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36af2533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:27:29, skipping insertion in model container [2018-02-02 10:27:29,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:27:29" (1/1) ... [2018-02-02 10:27:29,937 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:27:29,966 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:27:30,065 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:27:30,085 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:27:30,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:27:30 WrapperNode [2018-02-02 10:27:30,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:27:30,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:27:30,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:27:30,094 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:27:30,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:27:30" (1/1) ... [2018-02-02 10:27:30,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:27:30" (1/1) ... [2018-02-02 10:27:30,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:27:30" (1/1) ... [2018-02-02 10:27:30,112 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:27:30" (1/1) ... [2018-02-02 10:27:30,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:27:30" (1/1) ... [2018-02-02 10:27:30,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:27:30" (1/1) ... [2018-02-02 10:27:30,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:27:30" (1/1) ... [2018-02-02 10:27:30,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:27:30,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:27:30,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:27:30,128 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:27:30,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:27:30" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:27:30,169 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:27:30,169 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:27:30,170 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:27:30,170 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:27:30,170 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:27:30,170 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:27:30,170 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:27:30,170 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:27:30,170 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:27:30,170 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:27:30,170 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:27:30,170 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:27:30,170 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:27:30,171 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 10:27:30,171 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:27:30,171 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:27:30,171 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:27:30,574 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:27:30,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:27:30 BoogieIcfgContainer [2018-02-02 10:27:30,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:27:30,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:27:30,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:27:30,578 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:27:30,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:27:29" (1/3) ... [2018-02-02 10:27:30,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@531f87fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:27:30, skipping insertion in model container [2018-02-02 10:27:30,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:27:30" (2/3) ... [2018-02-02 10:27:30,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@531f87fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:27:30, skipping insertion in model container [2018-02-02 10:27:30,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:27:30" (3/3) ... [2018-02-02 10:27:30,582 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-queue_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:27:30,590 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:27:30,597 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 61 error locations. [2018-02-02 10:27:30,629 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:27:30,629 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:27:30,630 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:27:30,630 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:27:30,630 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:27:30,630 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:27:30,630 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:27:30,630 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:27:30,631 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:27:30,652 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states. [2018-02-02 10:27:30,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:27:30,664 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:30,665 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:30,665 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:30,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1694878026, now seen corresponding path program 1 times [2018-02-02 10:27:30,721 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:30,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:30,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:30,831 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:30,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:27:30,833 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:30,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:30,834 INFO L182 omatonBuilderFactory]: Interpolants [176#false, 177#(= 1 (select |#valid| |main_#t~malloc0.base|)), 178#(= 1 (select |#valid| main_~head~0.base)), 175#true] [2018-02-02 10:27:30,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:30,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:27:30,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:27:30,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:27:30,915 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 4 states. [2018-02-02 10:27:31,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:31,069 INFO L93 Difference]: Finished difference Result 173 states and 184 transitions. [2018-02-02 10:27:31,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:27:31,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:27:31,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:31,081 INFO L225 Difference]: With dead ends: 173 [2018-02-02 10:27:31,081 INFO L226 Difference]: Without dead ends: 169 [2018-02-02 10:27:31,082 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:27:31,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-02-02 10:27:31,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 161. [2018-02-02 10:27:31,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-02 10:27:31,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 173 transitions. [2018-02-02 10:27:31,118 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 173 transitions. Word has length 8 [2018-02-02 10:27:31,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:31,118 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 173 transitions. [2018-02-02 10:27:31,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:27:31,118 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions. [2018-02-02 10:27:31,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:27:31,119 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:31,119 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:31,119 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:31,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1694878027, now seen corresponding path program 1 times [2018-02-02 10:27:31,120 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:31,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:31,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:31,180 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:31,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:27:31,180 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:31,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:31,181 INFO L182 omatonBuilderFactory]: Interpolants [515#true, 516#false, 517#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 518#(and (= (select |#length| main_~head~0.base) 12) (= main_~head~0.offset 0))] [2018-02-02 10:27:31,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:31,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:27:31,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:27:31,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:27:31,182 INFO L87 Difference]: Start difference. First operand 161 states and 173 transitions. Second operand 4 states. [2018-02-02 10:27:31,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:31,276 INFO L93 Difference]: Finished difference Result 154 states and 164 transitions. [2018-02-02 10:27:31,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:27:31,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:27:31,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:31,278 INFO L225 Difference]: With dead ends: 154 [2018-02-02 10:27:31,278 INFO L226 Difference]: Without dead ends: 154 [2018-02-02 10:27:31,279 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:27:31,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-02 10:27:31,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2018-02-02 10:27:31,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 10:27:31,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 161 transitions. [2018-02-02 10:27:31,287 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 161 transitions. Word has length 8 [2018-02-02 10:27:31,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:31,287 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 161 transitions. [2018-02-02 10:27:31,287 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:27:31,287 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 161 transitions. [2018-02-02 10:27:31,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 10:27:31,288 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:31,288 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:31,288 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:31,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1424550359, now seen corresponding path program 1 times [2018-02-02 10:27:31,289 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:31,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:31,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:31,353 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:31,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:27:31,353 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:31,353 INFO L182 omatonBuilderFactory]: Interpolants [825#true, 826#false, 827#(= (select |#valid| main_~head~0.base) 1), 828#(= 1 (select |#valid| main_~item~0.base))] [2018-02-02 10:27:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:31,353 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:27:31,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:27:31,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:27:31,354 INFO L87 Difference]: Start difference. First operand 150 states and 161 transitions. Second operand 4 states. [2018-02-02 10:27:31,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:31,444 INFO L93 Difference]: Finished difference Result 154 states and 164 transitions. [2018-02-02 10:27:31,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:27:31,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 10:27:31,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:31,446 INFO L225 Difference]: With dead ends: 154 [2018-02-02 10:27:31,446 INFO L226 Difference]: Without dead ends: 154 [2018-02-02 10:27:31,446 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:27:31,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-02 10:27:31,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 149. [2018-02-02 10:27:31,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-02 10:27:31,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 162 transitions. [2018-02-02 10:27:31,451 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 162 transitions. Word has length 16 [2018-02-02 10:27:31,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:31,451 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 162 transitions. [2018-02-02 10:27:31,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:27:31,452 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 162 transitions. [2018-02-02 10:27:31,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 10:27:31,452 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:31,452 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:31,452 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:31,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1424550360, now seen corresponding path program 1 times [2018-02-02 10:27:31,453 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:31,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:31,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:31,533 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:31,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:27:31,533 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:31,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:31,534 INFO L182 omatonBuilderFactory]: Interpolants [1136#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 1137#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base))), 1138#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 1139#(and (= 12 (select |#length| main_~item~0.base)) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.offset 0)), 1140#(and (= (select |#length| main_~item~0.base) 12) (= main_~item~0.offset 0)), 1134#true, 1135#false] [2018-02-02 10:27:31,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:31,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:27:31,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:27:31,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:27:31,535 INFO L87 Difference]: Start difference. First operand 149 states and 162 transitions. Second operand 7 states. [2018-02-02 10:27:31,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:31,790 INFO L93 Difference]: Finished difference Result 235 states and 250 transitions. [2018-02-02 10:27:31,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:27:31,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-02-02 10:27:31,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:31,791 INFO L225 Difference]: With dead ends: 235 [2018-02-02 10:27:31,791 INFO L226 Difference]: Without dead ends: 235 [2018-02-02 10:27:31,791 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:27:31,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-02-02 10:27:31,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 158. [2018-02-02 10:27:31,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 10:27:31,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 173 transitions. [2018-02-02 10:27:31,799 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 173 transitions. Word has length 16 [2018-02-02 10:27:31,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:31,799 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 173 transitions. [2018-02-02 10:27:31,799 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:27:31,799 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 173 transitions. [2018-02-02 10:27:31,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:27:31,799 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:31,800 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-02 10:27:31,800 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:31,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1101672517, now seen corresponding path program 1 times [2018-02-02 10:27:31,800 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:31,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:31,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:31,859 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:31,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:27:31,860 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:31,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:31,860 INFO L182 omatonBuilderFactory]: Interpolants [1544#true, 1545#false, 1546#(and (= 0 |main_#t~malloc5.offset|) (= 12 (select |#length| |main_#t~malloc5.base|))), 1547#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))), 1548#(and (= (select |#length| |main_#t~mem7.base|) 12) (= |main_#t~mem7.offset| 0))] [2018-02-02 10:27:31,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:31,860 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:27:31,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:27:31,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:27:31,861 INFO L87 Difference]: Start difference. First operand 158 states and 173 transitions. Second operand 5 states. [2018-02-02 10:27:32,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:32,036 INFO L93 Difference]: Finished difference Result 259 states and 281 transitions. [2018-02-02 10:27:32,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:27:32,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 10:27:32,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:32,037 INFO L225 Difference]: With dead ends: 259 [2018-02-02 10:27:32,037 INFO L226 Difference]: Without dead ends: 259 [2018-02-02 10:27:32,038 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:27:32,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-02-02 10:27:32,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 157. [2018-02-02 10:27:32,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-02 10:27:32,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 171 transitions. [2018-02-02 10:27:32,044 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 171 transitions. Word has length 18 [2018-02-02 10:27:32,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:32,044 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 171 transitions. [2018-02-02 10:27:32,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:27:32,045 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 171 transitions. [2018-02-02 10:27:32,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:27:32,045 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:32,045 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-02 10:27:32,045 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:32,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1101672518, now seen corresponding path program 1 times [2018-02-02 10:27:32,046 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:32,055 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:32,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:32,076 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:32,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:27:32,077 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:32,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:32,077 INFO L182 omatonBuilderFactory]: Interpolants [1971#true, 1972#false, 1973#(= 1 (select |#valid| |main_#t~malloc5.base|)), 1974#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))), 1975#(= 1 (select |#valid| |main_#t~mem7.base|))] [2018-02-02 10:27:32,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:32,077 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:27:32,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:27:32,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:27:32,077 INFO L87 Difference]: Start difference. First operand 157 states and 171 transitions. Second operand 5 states. [2018-02-02 10:27:32,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:32,188 INFO L93 Difference]: Finished difference Result 249 states and 269 transitions. [2018-02-02 10:27:32,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:27:32,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 10:27:32,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:32,189 INFO L225 Difference]: With dead ends: 249 [2018-02-02 10:27:32,189 INFO L226 Difference]: Without dead ends: 249 [2018-02-02 10:27:32,190 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:27:32,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-02-02 10:27:32,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 156. [2018-02-02 10:27:32,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 10:27:32,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 169 transitions. [2018-02-02 10:27:32,193 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 169 transitions. Word has length 18 [2018-02-02 10:27:32,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:32,194 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 169 transitions. [2018-02-02 10:27:32,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:27:32,194 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 169 transitions. [2018-02-02 10:27:32,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:27:32,194 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:32,194 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:32,194 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:32,195 INFO L82 PathProgramCache]: Analyzing trace with hash -82522180, now seen corresponding path program 1 times [2018-02-02 10:27:32,195 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:32,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:32,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:32,270 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:32,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:27:32,270 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:32,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:32,271 INFO L182 omatonBuilderFactory]: Interpolants [2385#true, 2386#false, 2387#(= (select |#valid| main_~head~0.base) 1), 2388#(= (select |#valid| main_~item~0.base) 1), 2389#(and (= 1 (select |#valid| |main_#t~malloc5.base|)) (not (= main_~item~0.base |main_#t~malloc5.base|))), 2390#(and (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))), 2391#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~item~0.base) main_~item~0.offset))) (not (= main_~item~0.base |main_#t~mem7.base|))), 2392#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))), 2393#(= 1 (select |#valid| |main_#t~mem9.base|))] [2018-02-02 10:27:32,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:32,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:27:32,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:27:32,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:27:32,272 INFO L87 Difference]: Start difference. First operand 156 states and 169 transitions. Second operand 9 states. [2018-02-02 10:27:32,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:32,515 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2018-02-02 10:27:32,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:27:32,515 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-02 10:27:32,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:32,516 INFO L225 Difference]: With dead ends: 159 [2018-02-02 10:27:32,516 INFO L226 Difference]: Without dead ends: 159 [2018-02-02 10:27:32,516 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:27:32,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-02 10:27:32,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2018-02-02 10:27:32,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 10:27:32,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 168 transitions. [2018-02-02 10:27:32,519 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 168 transitions. Word has length 22 [2018-02-02 10:27:32,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:32,520 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 168 transitions. [2018-02-02 10:27:32,520 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:27:32,520 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 168 transitions. [2018-02-02 10:27:32,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:27:32,520 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:32,521 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:32,521 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:32,521 INFO L82 PathProgramCache]: Analyzing trace with hash -82522179, now seen corresponding path program 1 times [2018-02-02 10:27:32,522 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:32,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:32,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:32,638 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:32,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:27:32,638 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:32,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:32,638 INFO L182 omatonBuilderFactory]: Interpolants [2720#(= (select |#valid| main_~head~0.base) 1), 2721#(= (select |#valid| main_~item~0.base) 1), 2722#(and (= 0 |main_#t~malloc5.offset|) (= 12 (select |#length| |main_#t~malloc5.base|)) (not (= main_~item~0.base |main_#t~malloc5.base|))), 2723#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))), 2724#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~item~0.base) main_~item~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (not (= main_~item~0.base |main_#t~mem7.base|))), 2725#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))), 2726#(and (= 0 |main_#t~mem9.offset|) (= 12 (select |#length| |main_#t~mem9.base|))), 2727#(and (= (select |#length| main_~item~0.base) 12) (= main_~item~0.offset 0)), 2718#true, 2719#false] [2018-02-02 10:27:32,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:32,639 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:27:32,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:27:32,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:27:32,639 INFO L87 Difference]: Start difference. First operand 155 states and 168 transitions. Second operand 10 states. [2018-02-02 10:27:33,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:33,163 INFO L93 Difference]: Finished difference Result 219 states and 233 transitions. [2018-02-02 10:27:33,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:27:33,163 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-02 10:27:33,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:33,164 INFO L225 Difference]: With dead ends: 219 [2018-02-02 10:27:33,164 INFO L226 Difference]: Without dead ends: 219 [2018-02-02 10:27:33,165 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:27:33,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-02 10:27:33,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 139. [2018-02-02 10:27:33,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-02 10:27:33,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 151 transitions. [2018-02-02 10:27:33,167 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 151 transitions. Word has length 22 [2018-02-02 10:27:33,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:33,167 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 151 transitions. [2018-02-02 10:27:33,168 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:27:33,168 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 151 transitions. [2018-02-02 10:27:33,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:27:33,169 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:33,169 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:33,169 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:33,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1060471439, now seen corresponding path program 1 times [2018-02-02 10:27:33,170 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:33,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:33,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:33,234 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:33,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:27:33,234 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:33,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:33,235 INFO L182 omatonBuilderFactory]: Interpolants [3108#true, 3109#false, 3110#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset))), 3111#(and (= 0 |main_#t~mem28.offset|) (= 0 |main_#t~mem28.base|)), 3112#(and (= 0 main_~item~0.base) (= main_~item~0.offset 0)), 3113#(not |main_#t~short30|)] [2018-02-02 10:27:33,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:33,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:27:33,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:27:33,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:27:33,236 INFO L87 Difference]: Start difference. First operand 139 states and 151 transitions. Second operand 6 states. [2018-02-02 10:27:33,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:33,346 INFO L93 Difference]: Finished difference Result 222 states and 238 transitions. [2018-02-02 10:27:33,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:27:33,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-02-02 10:27:33,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:33,348 INFO L225 Difference]: With dead ends: 222 [2018-02-02 10:27:33,348 INFO L226 Difference]: Without dead ends: 222 [2018-02-02 10:27:33,348 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:27:33,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-02 10:27:33,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 198. [2018-02-02 10:27:33,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-02 10:27:33,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 228 transitions. [2018-02-02 10:27:33,351 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 228 transitions. Word has length 29 [2018-02-02 10:27:33,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:33,352 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 228 transitions. [2018-02-02 10:27:33,352 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:27:33,352 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 228 transitions. [2018-02-02 10:27:33,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:27:33,353 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:33,353 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:33,353 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:33,353 INFO L82 PathProgramCache]: Analyzing trace with hash 109889057, now seen corresponding path program 1 times [2018-02-02 10:27:33,354 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:33,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:33,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:33,375 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:33,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:27:33,375 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:33,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:33,376 INFO L182 omatonBuilderFactory]: Interpolants [3540#true, 3541#false, 3542#(= 0 main_~status~0)] [2018-02-02 10:27:33,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:33,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:27:33,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:27:33,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:27:33,376 INFO L87 Difference]: Start difference. First operand 198 states and 228 transitions. Second operand 3 states. [2018-02-02 10:27:33,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:33,389 INFO L93 Difference]: Finished difference Result 181 states and 195 transitions. [2018-02-02 10:27:33,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:27:33,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-02-02 10:27:33,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:33,390 INFO L225 Difference]: With dead ends: 181 [2018-02-02 10:27:33,391 INFO L226 Difference]: Without dead ends: 181 [2018-02-02 10:27:33,391 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:27:33,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-02 10:27:33,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2018-02-02 10:27:33,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 10:27:33,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 176 transitions. [2018-02-02 10:27:33,393 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 176 transitions. Word has length 29 [2018-02-02 10:27:33,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:33,393 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 176 transitions. [2018-02-02 10:27:33,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:27:33,393 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 176 transitions. [2018-02-02 10:27:33,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:27:33,394 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:33,394 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:33,394 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:33,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1428666095, now seen corresponding path program 1 times [2018-02-02 10:27:33,395 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:33,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:33,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:33,418 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:33,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:27:33,418 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:33,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:33,419 INFO L182 omatonBuilderFactory]: Interpolants [3888#false, 3889#(not (= 0 |main_#t~malloc0.base|)), 3890#(not (= 0 main_~head~0.base)), 3887#true] [2018-02-02 10:27:33,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:33,419 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:27:33,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:27:33,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:27:33,419 INFO L87 Difference]: Start difference. First operand 163 states and 176 transitions. Second operand 4 states. [2018-02-02 10:27:33,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:33,441 INFO L93 Difference]: Finished difference Result 163 states and 175 transitions. [2018-02-02 10:27:33,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:27:33,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-02-02 10:27:33,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:33,443 INFO L225 Difference]: With dead ends: 163 [2018-02-02 10:27:33,443 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 10:27:33,443 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:27:33,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 10:27:33,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-02-02 10:27:33,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 10:27:33,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 175 transitions. [2018-02-02 10:27:33,446 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 175 transitions. Word has length 30 [2018-02-02 10:27:33,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:33,447 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 175 transitions. [2018-02-02 10:27:33,447 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:27:33,447 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 175 transitions. [2018-02-02 10:27:33,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:27:33,448 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:33,448 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-02 10:27:33,448 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:33,448 INFO L82 PathProgramCache]: Analyzing trace with hash -578814549, now seen corresponding path program 1 times [2018-02-02 10:27:33,449 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:33,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:33,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:33,503 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:33,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:27:33,503 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:33,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:33,504 INFO L182 omatonBuilderFactory]: Interpolants [4224#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4225#(and (= 0 |main_#t~mem34.base|) (= 0 |main_#t~mem34.offset|)), 4226#(and (= 0 main_~head~0.base) (= main_~head~0.offset 0)), 4219#true, 4220#false, 4221#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem28.base|) (= |main_#t~mem28.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4222#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~item~0.base) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4223#(or |main_#t~short30| (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))] [2018-02-02 10:27:33,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:33,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:27:33,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:27:33,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:27:33,504 INFO L87 Difference]: Start difference. First operand 163 states and 175 transitions. Second operand 8 states. [2018-02-02 10:27:33,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:33,660 INFO L93 Difference]: Finished difference Result 192 states and 208 transitions. [2018-02-02 10:27:33,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:27:33,660 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-02-02 10:27:33,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:33,661 INFO L225 Difference]: With dead ends: 192 [2018-02-02 10:27:33,661 INFO L226 Difference]: Without dead ends: 192 [2018-02-02 10:27:33,662 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:27:33,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-02 10:27:33,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 174. [2018-02-02 10:27:33,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 10:27:33,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 187 transitions. [2018-02-02 10:27:33,665 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 187 transitions. Word has length 34 [2018-02-02 10:27:33,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:33,665 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 187 transitions. [2018-02-02 10:27:33,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:27:33,665 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 187 transitions. [2018-02-02 10:27:33,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:27:33,665 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:33,666 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:33,666 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:33,666 INFO L82 PathProgramCache]: Analyzing trace with hash -763383045, now seen corresponding path program 1 times [2018-02-02 10:27:33,667 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:33,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:33,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:33,755 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:33,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:27:33,756 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:33,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:33,756 INFO L182 omatonBuilderFactory]: Interpolants [4601#true, 4602#false, 4603#(= |#valid| |old(#valid)|), 4604#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|))), 4605#(and (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|)), 4606#(and (= (store |#valid| main_~item~0.base 0) |old(#valid)|) (not (= 0 main_~item~0.base)))] [2018-02-02 10:27:33,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:33,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:27:33,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:27:33,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:27:33,757 INFO L87 Difference]: Start difference. First operand 174 states and 187 transitions. Second operand 6 states. [2018-02-02 10:27:33,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:33,891 INFO L93 Difference]: Finished difference Result 184 states and 196 transitions. [2018-02-02 10:27:33,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:27:33,891 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-02 10:27:33,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:33,892 INFO L225 Difference]: With dead ends: 184 [2018-02-02 10:27:33,892 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 10:27:33,892 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:27:33,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 10:27:33,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-02-02 10:27:33,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 10:27:33,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 175 transitions. [2018-02-02 10:27:33,894 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 175 transitions. Word has length 35 [2018-02-02 10:27:33,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:33,895 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 175 transitions. [2018-02-02 10:27:33,895 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:27:33,895 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 175 transitions. [2018-02-02 10:27:33,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:27:33,896 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:33,896 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:33,896 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:33,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1792864916, now seen corresponding path program 1 times [2018-02-02 10:27:33,897 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:33,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:33,925 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-02 10:27:33,925 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:33,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:27:33,925 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:33,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:33,926 INFO L182 omatonBuilderFactory]: Interpolants [4962#true, 4963#false, 4964#(= main_~status~0 1)] [2018-02-02 10:27:33,926 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-02 10:27:33,926 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:27:33,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:27:33,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:27:33,926 INFO L87 Difference]: Start difference. First operand 163 states and 175 transitions. Second operand 3 states. [2018-02-02 10:27:33,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:33,946 INFO L93 Difference]: Finished difference Result 238 states and 256 transitions. [2018-02-02 10:27:33,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:27:33,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-02-02 10:27:33,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:33,947 INFO L225 Difference]: With dead ends: 238 [2018-02-02 10:27:33,947 INFO L226 Difference]: Without dead ends: 238 [2018-02-02 10:27:33,947 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:27:33,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-02-02 10:27:33,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 188. [2018-02-02 10:27:33,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-02 10:27:33,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 201 transitions. [2018-02-02 10:27:33,951 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 201 transitions. Word has length 49 [2018-02-02 10:27:33,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:33,951 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 201 transitions. [2018-02-02 10:27:33,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:27:33,952 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 201 transitions. [2018-02-02 10:27:33,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:27:33,952 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:33,952 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:33,953 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:33,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1072296632, now seen corresponding path program 1 times [2018-02-02 10:27:33,953 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:33,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:34,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:34,315 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:34,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:27:34,315 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:34,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:34,316 INFO L182 omatonBuilderFactory]: Interpolants [5408#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 0)), 5409#(or (= 1 (select |#valid| |main_#t~mem28.base|)) (= main_~status~0 0)), 5410#(or (= main_~status~0 0) (= 1 (select |#valid| main_~item~0.base))), 5411#(or (= 1 (select |#valid| main_~item~0.base)) |main_#t~short32|), 5412#(= 1 (select |#valid| main_~item~0.base)), 5391#true, 5392#false, 5393#(= |main_#t~malloc0.offset| 0), 5394#(= main_~head~0.offset 0), 5395#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 5396#(and (= main_~item~0.offset main_~head~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset 0)), 5397#(and (= main_~item~0.offset main_~head~0.offset) (= main_~head~0.offset |main_#t~malloc5.offset|) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~malloc5.base|))), 5398#(and (= main_~item~0.offset main_~head~0.offset) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset))), 5399#(and (= main_~item~0.offset main_~head~0.offset) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~mem7.base|)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset))), 5400#(and (= main_~item~0.offset main_~head~0.offset) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset))), 5401#(and (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset |main_#t~mem9.offset|)), 5402#(or (and (= main_~item~0.offset main_~head~0.offset) (= main_~item~0.base main_~head~0.base)) (and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)))), 5403#(or (and (= main_~item~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base main_~head~0.base)) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base)))), 5404#(or (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~item~0.base))) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 5405#(or (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~item~0.base))) (= main_~status~0 0) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 5406#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 0) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 5407#(or (and (= |main_#t~mem14.base| 0) (= |main_#t~mem14.offset| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 0))] [2018-02-02 10:27:34,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:34,316 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:27:34,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:27:34,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:27:34,317 INFO L87 Difference]: Start difference. First operand 188 states and 201 transitions. Second operand 22 states. [2018-02-02 10:27:35,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:35,495 INFO L93 Difference]: Finished difference Result 267 states and 286 transitions. [2018-02-02 10:27:35,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:27:35,496 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2018-02-02 10:27:35,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:35,497 INFO L225 Difference]: With dead ends: 267 [2018-02-02 10:27:35,497 INFO L226 Difference]: Without dead ends: 267 [2018-02-02 10:27:35,498 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=588, Invalid=1962, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 10:27:35,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-02-02 10:27:35,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 221. [2018-02-02 10:27:35,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-02 10:27:35,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 239 transitions. [2018-02-02 10:27:35,503 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 239 transitions. Word has length 56 [2018-02-02 10:27:35,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:35,503 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 239 transitions. [2018-02-02 10:27:35,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:27:35,503 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 239 transitions. [2018-02-02 10:27:35,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:27:35,504 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:35,504 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:35,504 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:35,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1072296631, now seen corresponding path program 1 times [2018-02-02 10:27:35,505 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:35,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:35,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:35,907 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:35,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:27:35,907 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:35,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:35,908 INFO L182 omatonBuilderFactory]: Interpolants [5959#true, 5960#false, 5961#(= |main_#t~malloc0.offset| 0), 5962#(= main_~head~0.offset 0), 5963#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 5964#(and (= main_~item~0.offset main_~head~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset 0)), 5965#(and (= 0 |main_#t~malloc5.offset|) (= main_~item~0.offset main_~head~0.offset) (= main_~head~0.offset |main_#t~malloc5.offset|) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~malloc5.base|))), 5966#(and (= main_~item~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~head~0.offset)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset))), 5967#(and (= main_~item~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~head~0.offset)) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~mem7.base|)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset))), 5968#(and (= main_~item~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~head~0.offset)) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset))), 5969#(and (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset |main_#t~mem9.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 5970#(or (and (= main_~item~0.offset main_~head~0.offset) (= main_~item~0.base main_~head~0.base)) (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)))), 5971#(or (and (= main_~item~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base main_~head~0.base)) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (<= 0 main_~item~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 5972#(or (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (<= 12 (select |#length| main_~item~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 5973#(or (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (<= 12 (select |#length| main_~item~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 0) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 5974#(or (and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 0) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 5975#(or (and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= |main_#t~mem14.base| 0) (= |main_#t~mem14.offset| 0)) (= main_~status~0 0)), 5976#(or (and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 0)), 5977#(or (and (= 0 |main_#t~mem28.offset|) (<= 12 (select |#length| |main_#t~mem28.base|))) (= main_~status~0 0)), 5978#(or (and (<= 12 (select |#length| main_~item~0.base)) (= main_~item~0.offset 0)) (= main_~status~0 0)), 5979#(or (and (<= 12 (select |#length| main_~item~0.base)) (= main_~item~0.offset 0)) |main_#t~short32|), 5980#(and (<= 12 (select |#length| main_~item~0.base)) (= main_~item~0.offset 0))] [2018-02-02 10:27:35,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:35,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:27:35,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:27:35,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:27:35,909 INFO L87 Difference]: Start difference. First operand 221 states and 239 transitions. Second operand 22 states. [2018-02-02 10:27:37,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:37,303 INFO L93 Difference]: Finished difference Result 267 states and 288 transitions. [2018-02-02 10:27:37,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:27:37,304 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2018-02-02 10:27:37,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:37,304 INFO L225 Difference]: With dead ends: 267 [2018-02-02 10:27:37,304 INFO L226 Difference]: Without dead ends: 267 [2018-02-02 10:27:37,305 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=454, Invalid=1802, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 10:27:37,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-02-02 10:27:37,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 225. [2018-02-02 10:27:37,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-02 10:27:37,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 242 transitions. [2018-02-02 10:27:37,308 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 242 transitions. Word has length 56 [2018-02-02 10:27:37,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:37,309 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 242 transitions. [2018-02-02 10:27:37,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:27:37,309 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 242 transitions. [2018-02-02 10:27:37,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:27:37,309 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:37,309 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:37,309 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:37,310 INFO L82 PathProgramCache]: Analyzing trace with hash 315048569, now seen corresponding path program 1 times [2018-02-02 10:27:37,310 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:37,317 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:37,334 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-02 10:27:37,334 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:37,334 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:27:37,334 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:37,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:37,334 INFO L182 omatonBuilderFactory]: Interpolants [6528#(not |main_#t~short32|), 6525#true, 6526#false, 6527#(= main_~status~0 1)] [2018-02-02 10:27:37,335 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-02 10:27:37,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:27:37,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:27:37,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:27:37,335 INFO L87 Difference]: Start difference. First operand 225 states and 242 transitions. Second operand 4 states. [2018-02-02 10:27:37,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:37,354 INFO L93 Difference]: Finished difference Result 271 states and 290 transitions. [2018-02-02 10:27:37,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:27:37,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-02-02 10:27:37,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:37,355 INFO L225 Difference]: With dead ends: 271 [2018-02-02 10:27:37,355 INFO L226 Difference]: Without dead ends: 271 [2018-02-02 10:27:37,356 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:27:37,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-02-02 10:27:37,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 242. [2018-02-02 10:27:37,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-02 10:27:37,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 264 transitions. [2018-02-02 10:27:37,358 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 264 transitions. Word has length 58 [2018-02-02 10:27:37,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:37,359 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 264 transitions. [2018-02-02 10:27:37,359 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:27:37,359 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 264 transitions. [2018-02-02 10:27:37,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:27:37,359 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:37,359 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:37,359 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:37,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1199350700, now seen corresponding path program 1 times [2018-02-02 10:27:37,360 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:37,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:37,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:37,810 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:37,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:27:37,810 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:37,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:37,811 INFO L182 omatonBuilderFactory]: Interpolants [7044#true, 7045#false, 7046#(and (not (= 0 |main_#t~malloc0.base|)) (= |main_#t~malloc0.offset| 0)), 7047#(and (not (= 0 main_~head~0.base)) (= main_~head~0.offset 0)), 7048#(and (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base)) (= main_~head~0.offset 0)), 7049#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (not (= 0 main_~head~0.base)) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset 0)), 7050#(and (= main_~head~0.offset |main_#t~malloc5.offset|) (= main_~head~0.offset main_~item~0.offset) (not (= 0 main_~head~0.base)) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~malloc5.base|))), 7051#(and (= main_~head~0.offset main_~item~0.offset) (not (= 0 main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset))), 7052#(and (= main_~head~0.offset main_~item~0.offset) (not (= 0 main_~head~0.base)) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~mem7.base|)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset))), 7053#(and (= main_~head~0.offset main_~item~0.offset) (not (= 0 main_~head~0.base)) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset))), 7054#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (= main_~head~0.offset |main_#t~mem9.offset|) (not (= 0 main_~head~0.base))), 7055#(or (and (= main_~item~0.offset main_~head~0.offset) (= main_~item~0.base main_~head~0.base)) (and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (not (= 0 main_~head~0.base)))), 7056#(or (and (= main_~item~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base main_~head~0.base)) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base)) (not (= 0 main_~head~0.base)))), 7057#(or (and (not (= main_~head~0.base main_~item~0.base)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~item~0.base)) (not (= 0 main_~head~0.base))) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 7058#(or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base))) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 7059#(or (and (not (= 0 main_~item~0.base)) (= 1 (select (store |#valid| main_~item~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 7060#(or (and (= 1 (select (store |#valid| main_~item~0.base 0) |main_#t~mem34.base|)) (not (= 0 main_~item~0.base))) (and (= 0 |main_#t~mem34.base|) (= 0 |main_#t~mem34.offset|))), 7061#(or (and (= 1 (select (store |#valid| main_~item~0.base 0) main_~head~0.base)) (not (= 0 main_~item~0.base))) (and (= 0 main_~head~0.base) (= main_~head~0.offset 0))), 7062#(or (= (select |#valid| main_~head~0.base) 1) (and (= 0 main_~head~0.base) (= main_~head~0.offset 0))), 7063#(= (select |#valid| main_~head~0.base) 1)] [2018-02-02 10:27:37,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:37,811 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:27:37,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:27:37,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:27:37,812 INFO L87 Difference]: Start difference. First operand 242 states and 264 transitions. Second operand 20 states. [2018-02-02 10:27:38,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:38,657 INFO L93 Difference]: Finished difference Result 282 states and 307 transitions. [2018-02-02 10:27:38,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:27:38,657 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2018-02-02 10:27:38,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:38,658 INFO L225 Difference]: With dead ends: 282 [2018-02-02 10:27:38,658 INFO L226 Difference]: Without dead ends: 282 [2018-02-02 10:27:38,659 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=300, Invalid=1032, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:27:38,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-02-02 10:27:38,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 263. [2018-02-02 10:27:38,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-02-02 10:27:38,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 292 transitions. [2018-02-02 10:27:38,663 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 292 transitions. Word has length 61 [2018-02-02 10:27:38,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:38,663 INFO L432 AbstractCegarLoop]: Abstraction has 263 states and 292 transitions. [2018-02-02 10:27:38,663 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:27:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 292 transitions. [2018-02-02 10:27:38,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:27:38,664 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:38,664 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:38,664 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:38,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1199350699, now seen corresponding path program 1 times [2018-02-02 10:27:38,665 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:38,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:38,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:38,997 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:38,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:27:38,997 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:38,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:38,997 INFO L182 omatonBuilderFactory]: Interpolants [7648#(and (= main_~item~0.offset main_~head~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset 0)), 7649#(and (= 0 |main_#t~malloc5.offset|) (= main_~item~0.offset main_~head~0.offset) (= main_~head~0.offset |main_#t~malloc5.offset|) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~malloc5.base|))), 7650#(and (= main_~item~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~head~0.offset)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset))), 7651#(and (= main_~item~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~head~0.offset)) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~mem7.base|)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset))), 7652#(and (= main_~item~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~head~0.offset)) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset))), 7653#(and (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset |main_#t~mem9.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 7654#(or (and (= main_~item~0.offset main_~head~0.offset) (= main_~item~0.base main_~head~0.base)) (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)))), 7655#(or (and (= main_~item~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base main_~head~0.base)) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (<= 0 main_~item~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 7656#(or (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (<= 12 (select |#length| main_~item~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 7657#(or (and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 7658#(or (and (= 0 |main_#t~mem34.base|) (= 0 |main_#t~mem34.offset|)) (and (= 0 |main_#t~mem34.offset|) (<= 12 (select |#length| |main_#t~mem34.base|)))), 7659#(or (and (<= 12 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)) (and (= 0 main_~head~0.base) (= main_~head~0.offset 0))), 7660#(and (<= 12 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 7643#true, 7644#false, 7645#(= |main_#t~malloc0.offset| 0), 7646#(= main_~head~0.offset 0), 7647#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0))] [2018-02-02 10:27:38,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:38,998 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:27:38,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:27:38,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:27:38,998 INFO L87 Difference]: Start difference. First operand 263 states and 292 transitions. Second operand 18 states. [2018-02-02 10:27:39,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:39,722 INFO L93 Difference]: Finished difference Result 279 states and 304 transitions. [2018-02-02 10:27:39,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:27:39,722 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 61 [2018-02-02 10:27:39,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:39,723 INFO L225 Difference]: With dead ends: 279 [2018-02-02 10:27:39,723 INFO L226 Difference]: Without dead ends: 279 [2018-02-02 10:27:39,723 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=304, Invalid=956, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:27:39,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-02-02 10:27:39,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2018-02-02 10:27:39,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-02-02 10:27:39,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 291 transitions. [2018-02-02 10:27:39,728 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 291 transitions. Word has length 61 [2018-02-02 10:27:39,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:39,728 INFO L432 AbstractCegarLoop]: Abstraction has 263 states and 291 transitions. [2018-02-02 10:27:39,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:27:39,728 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 291 transitions. [2018-02-02 10:27:39,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:27:39,729 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:39,729 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:39,729 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:39,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1474832754, now seen corresponding path program 1 times [2018-02-02 10:27:39,730 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:39,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:39,786 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:27:39,786 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:39,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:27:39,787 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:39,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:39,787 INFO L182 omatonBuilderFactory]: Interpolants [8240#false, 8241#(and (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 8242#(or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0))), 8243#(or (not (= |main_#t~mem34.base| 0)) (not (= |main_#t~mem34.offset| 0))), 8244#(or (not (= main_~head~0.base 0)) (not (= main_~head~0.offset 0))), 8239#true] [2018-02-02 10:27:39,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:27:39,787 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:27:39,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:27:39,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:27:39,788 INFO L87 Difference]: Start difference. First operand 263 states and 291 transitions. Second operand 6 states. [2018-02-02 10:27:39,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:39,911 INFO L93 Difference]: Finished difference Result 282 states and 305 transitions. [2018-02-02 10:27:39,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:27:39,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-02-02 10:27:39,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:39,912 INFO L225 Difference]: With dead ends: 282 [2018-02-02 10:27:39,912 INFO L226 Difference]: Without dead ends: 274 [2018-02-02 10:27:39,913 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-02 10:27:39,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-02-02 10:27:39,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2018-02-02 10:27:39,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-02-02 10:27:39,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 296 transitions. [2018-02-02 10:27:39,916 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 296 transitions. Word has length 62 [2018-02-02 10:27:39,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:39,917 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 296 transitions. [2018-02-02 10:27:39,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:27:39,917 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 296 transitions. [2018-02-02 10:27:39,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:27:39,917 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:39,918 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:39,918 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:39,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1524774763, now seen corresponding path program 1 times [2018-02-02 10:27:39,918 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:39,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:40,151 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:40,151 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:40,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:27:40,151 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:40,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:40,152 INFO L182 omatonBuilderFactory]: Interpolants [8804#true, 8805#false, 8806#(= |main_#t~malloc0.offset| 0), 8807#(= main_~head~0.offset 0), 8808#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 8809#(and (= main_~item~0.offset main_~head~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset 0)), 8810#(and (= 0 |main_#t~malloc5.offset|) (= main_~item~0.offset main_~head~0.offset) (= main_~head~0.offset |main_#t~malloc5.offset|) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~malloc5.base|))), 8811#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~head~0.offset)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset))), 8812#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~head~0.offset)) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~mem7.base|)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset))), 8813#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~head~0.offset)) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset))), 8814#(and (= main_~head~0.offset |main_#t~mem9.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8815#(or (and (= main_~item~0.offset main_~head~0.offset) (= main_~item~0.base main_~head~0.base)) (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)))), 8816#(or (and (= main_~item~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base main_~head~0.base)) (and (not (= main_~item~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 8817#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 8818#(= 0 |main_#t~mem34.offset|), 8819#(= main_~item~0.offset 0)] [2018-02-02 10:27:40,152 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:40,152 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:27:40,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:27:40,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:27:40,152 INFO L87 Difference]: Start difference. First operand 271 states and 296 transitions. Second operand 16 states. [2018-02-02 10:27:40,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:40,758 INFO L93 Difference]: Finished difference Result 284 states and 306 transitions. [2018-02-02 10:27:40,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:27:40,758 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 63 [2018-02-02 10:27:40,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:40,759 INFO L225 Difference]: With dead ends: 284 [2018-02-02 10:27:40,759 INFO L226 Difference]: Without dead ends: 284 [2018-02-02 10:27:40,759 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=298, Invalid=758, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:27:40,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-02-02 10:27:40,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 273. [2018-02-02 10:27:40,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-02-02 10:27:40,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 299 transitions. [2018-02-02 10:27:40,764 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 299 transitions. Word has length 63 [2018-02-02 10:27:40,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:40,764 INFO L432 AbstractCegarLoop]: Abstraction has 273 states and 299 transitions. [2018-02-02 10:27:40,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:27:40,764 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 299 transitions. [2018-02-02 10:27:40,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:27:40,765 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:40,765 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:40,765 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:40,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1524774762, now seen corresponding path program 1 times [2018-02-02 10:27:40,766 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:40,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:40,801 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:27:40,801 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:40,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:27:40,802 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:40,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:40,802 INFO L182 omatonBuilderFactory]: Interpolants [9411#true, 9412#false, 9413#(= main_~head~0.base main_~item~0.base), 9414#(= 1 (select |#valid| main_~item~0.base))] [2018-02-02 10:27:40,802 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:27:40,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:27:40,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:27:40,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:27:40,803 INFO L87 Difference]: Start difference. First operand 273 states and 299 transitions. Second operand 4 states. [2018-02-02 10:27:40,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:40,867 INFO L93 Difference]: Finished difference Result 273 states and 297 transitions. [2018-02-02 10:27:40,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:27:40,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-02-02 10:27:40,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:40,868 INFO L225 Difference]: With dead ends: 273 [2018-02-02 10:27:40,868 INFO L226 Difference]: Without dead ends: 273 [2018-02-02 10:27:40,869 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:27:40,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-02-02 10:27:40,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 267. [2018-02-02 10:27:40,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-02-02 10:27:40,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 292 transitions. [2018-02-02 10:27:40,873 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 292 transitions. Word has length 63 [2018-02-02 10:27:40,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:40,873 INFO L432 AbstractCegarLoop]: Abstraction has 267 states and 292 transitions. [2018-02-02 10:27:40,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:27:40,873 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 292 transitions. [2018-02-02 10:27:40,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:27:40,874 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:40,874 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:40,874 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:40,874 INFO L82 PathProgramCache]: Analyzing trace with hash -990460532, now seen corresponding path program 2 times [2018-02-02 10:27:40,875 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:40,886 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:41,365 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:41,365 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:41,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:27:41,366 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:41,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:41,366 INFO L182 omatonBuilderFactory]: Interpolants [9957#true, 9958#false, 9959#(= |main_#t~malloc0.offset| 0), 9960#(= main_~head~0.offset 0), 9961#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 9962#(and (= main_~item~0.offset main_~head~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset 0)), 9963#(and (= 0 |main_#t~malloc5.offset|) (= main_~item~0.offset main_~head~0.offset) (= main_~head~0.offset |main_#t~malloc5.offset|) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~malloc5.base|))), 9964#(and (= main_~item~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset))), 9965#(and (= main_~item~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~mem7.base|)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset))), 9966#(and (= main_~item~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset))), 9967#(and (= 0 |main_#t~mem9.offset|) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset |main_#t~mem9.offset|)), 9968#(or (and (= main_~item~0.offset main_~head~0.offset) (= main_~item~0.base main_~head~0.base)) (and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= main_~item~0.offset 0))), 9969#(or (and (= main_~item~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base main_~head~0.base)) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= main_~item~0.offset 0))), 9970#(or (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.offset 0))), 9971#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 9972#(or (= 0 |main_#t~mem34.base|) (and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem34.base|) 0)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem34.base|) 0)))), 9973#(or (not (= 0 main_~head~0.offset)) (= 0 main_~head~0.base) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 9974#(or (not (= main_~item~0.offset 0)) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 9975#(or (not (= main_~item~0.offset 0)) (and (= 0 |main_#t~mem34.base|) (= 0 |main_#t~mem34.offset|))), 9976#(or (not (= main_~item~0.offset 0)) (and (= 0 main_~head~0.base) (= main_~head~0.offset 0))), 9977#(and (= 0 main_~head~0.base) (= main_~head~0.offset 0))] [2018-02-02 10:27:41,366 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:41,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:27:41,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:27:41,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:27:41,367 INFO L87 Difference]: Start difference. First operand 267 states and 292 transitions. Second operand 21 states. [2018-02-02 10:27:42,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:42,175 INFO L93 Difference]: Finished difference Result 284 states and 306 transitions. [2018-02-02 10:27:42,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:27:42,175 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2018-02-02 10:27:42,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:42,176 INFO L225 Difference]: With dead ends: 284 [2018-02-02 10:27:42,176 INFO L226 Difference]: Without dead ends: 284 [2018-02-02 10:27:42,177 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=294, Invalid=1428, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 10:27:42,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-02-02 10:27:42,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 267. [2018-02-02 10:27:42,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-02-02 10:27:42,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 292 transitions. [2018-02-02 10:27:42,181 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 292 transitions. Word has length 66 [2018-02-02 10:27:42,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:42,181 INFO L432 AbstractCegarLoop]: Abstraction has 267 states and 292 transitions. [2018-02-02 10:27:42,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:27:42,182 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 292 transitions. [2018-02-02 10:27:42,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:27:42,182 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:42,183 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:42,183 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:42,183 INFO L82 PathProgramCache]: Analyzing trace with hash -639506630, now seen corresponding path program 2 times [2018-02-02 10:27:42,183 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:42,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:42,743 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:42,743 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:42,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:27:42,743 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:42,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:42,743 INFO L182 omatonBuilderFactory]: Interpolants [10571#true, 10572#false, 10573#(= |#valid| |old(#valid)|), 10574#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|)) (= |main_#t~malloc0.offset| 0)), 10575#(and (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|) (= main_~head~0.offset 0)), 10576#(and (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|) (= main_~head~0.offset 0)), 10577#(and (= main_~item~0.offset main_~head~0.offset) (= (select |#valid| main_~item~0.base) 1) (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset 0)), 10578#(and (= main_~item~0.offset main_~head~0.offset) (= main_~head~0.offset |main_#t~malloc5.offset|) (not (= 0 main_~head~0.base)) (= (store (store |#valid| main_~head~0.base 0) |main_#t~malloc5.base| 0) |old(#valid)|) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~malloc5.base|))), 10579#(and (= main_~item~0.offset main_~head~0.offset) (= (store (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~head~0.offset) 0) |old(#valid)|) (not (= 0 main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset))), 10580#(and (= main_~item~0.offset main_~head~0.offset) (= |old(#valid)| (store (store |#valid| main_~head~0.base 0) (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~item~0.base) main_~head~0.offset) 0)) (not (= 0 main_~head~0.base)) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (not (= main_~item~0.base |main_#t~mem7.base|))), 10581#(and (= main_~item~0.offset main_~head~0.offset) (= (store (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~head~0.offset) 0) |old(#valid)|) (not (= 0 main_~head~0.base)) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset))), 10582#(and (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset |main_#t~mem9.offset|) (not (= 0 main_~head~0.base)) (= (store (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) |old(#valid)|)), 10583#(or (and (= main_~item~0.offset main_~head~0.offset) (= main_~item~0.base main_~head~0.base)) (and (= |old(#valid)| (store (store |#valid| main_~head~0.base 0) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset) 0)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (not (= 0 main_~head~0.base)))), 10584#(or (and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (not (= 0 main_~head~0.base)) (= (store (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) |old(#valid)|)) (and (= main_~item~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base main_~head~0.base))), 10585#(or (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base)) (= (store (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) |old(#valid)|))), 10586#(or (and (= (store (store |#valid| main_~item~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) |old(#valid)|) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~item~0.base))) (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 10587#(or (= 0 |main_#t~mem34.base|) (and (not (= main_~item~0.base |main_#t~mem34.base|)) (= |old(#valid)| (store (store |#valid| main_~item~0.base 0) |main_#t~mem34.base| 0)) (not (= 0 main_~item~0.base)))), 10588#(or (= 0 main_~head~0.base) (and (= (store (store |#valid| main_~item~0.base 0) main_~head~0.base 0) |old(#valid)|) (not (= main_~item~0.base main_~head~0.base)) (not (= 0 main_~item~0.base)))), 10589#(or (= 0 main_~head~0.base) (= (store |#valid| main_~head~0.base 0) |old(#valid)|)), 10590#(or (not (= main_~item~0.offset 0)) (and (= (store |#valid| main_~item~0.base 0) |old(#valid)|) (not (= 0 main_~item~0.base))))] [2018-02-02 10:27:42,744 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:42,744 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:27:42,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:27:42,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:27:42,744 INFO L87 Difference]: Start difference. First operand 267 states and 292 transitions. Second operand 20 states. [2018-02-02 10:27:43,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:43,542 INFO L93 Difference]: Finished difference Result 280 states and 301 transitions. [2018-02-02 10:27:43,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:27:43,542 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2018-02-02 10:27:43,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:43,543 INFO L225 Difference]: With dead ends: 280 [2018-02-02 10:27:43,543 INFO L226 Difference]: Without dead ends: 265 [2018-02-02 10:27:43,543 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:27:43,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-02-02 10:27:43,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 261. [2018-02-02 10:27:43,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-02-02 10:27:43,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 283 transitions. [2018-02-02 10:27:43,546 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 283 transitions. Word has length 67 [2018-02-02 10:27:43,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:43,546 INFO L432 AbstractCegarLoop]: Abstraction has 261 states and 283 transitions. [2018-02-02 10:27:43,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:27:43,546 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 283 transitions. [2018-02-02 10:27:43,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 10:27:43,547 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:43,547 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:43,547 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:43,547 INFO L82 PathProgramCache]: Analyzing trace with hash -294831441, now seen corresponding path program 1 times [2018-02-02 10:27:43,548 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:43,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:44,162 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:44,162 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:44,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:27:44,162 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:44,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:44,163 INFO L182 omatonBuilderFactory]: Interpolants [11156#true, 11157#false, 11158#(= |main_#t~malloc0.offset| 0), 11159#(= main_~head~0.offset 0), 11160#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 11161#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset 0)), 11162#(and (= main_~head~0.offset |main_#t~malloc5.offset|) (= main_~head~0.offset main_~item~0.offset) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~malloc5.base|))), 11163#(and (= main_~head~0.offset main_~item~0.offset) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset))), 11164#(and (= main_~head~0.offset main_~item~0.offset) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~mem7.base|)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset))), 11165#(and (= main_~head~0.offset main_~item~0.offset) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset))), 11166#(and (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.offset|) (= main_~head~0.offset |main_#t~mem9.offset|)), 11167#(or (and (= main_~item~0.offset main_~head~0.offset) (= main_~item~0.base main_~head~0.base)) (and (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)))), 11168#(or (and (= main_~item~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base main_~head~0.base)) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 11169#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 11170#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 0) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 11171#(or (= main_~status~0 0) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 11172#(or (and (= |main_#t~mem14.base| 0) (= |main_#t~mem14.offset| 0)) (= main_~status~0 0) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 11173#(or (= main_~status~0 0) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 11174#(or (and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem28.base|) |main_#t~mem28.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem28.base|) |main_#t~mem28.offset|))) (= main_~status~0 0)), 11175#(or (= main_~status~0 0) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))), 11176#(or (and (= main_~status~0 0) |main_#t~short32|) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))), 11177#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))), 11178#(and (= 0 |main_#t~mem33.offset|) (= 0 |main_#t~mem33.base|)), 11179#(and (= 0 main_~item~0.base) (= main_~item~0.offset 0)), 11180#(not |main_#t~short30|)] [2018-02-02 10:27:44,163 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:44,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:27:44,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:27:44,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:27:44,163 INFO L87 Difference]: Start difference. First operand 261 states and 283 transitions. Second operand 25 states. [2018-02-02 10:27:45,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:45,216 INFO L93 Difference]: Finished difference Result 260 states and 278 transitions. [2018-02-02 10:27:45,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:27:45,217 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 68 [2018-02-02 10:27:45,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:45,217 INFO L225 Difference]: With dead ends: 260 [2018-02-02 10:27:45,217 INFO L226 Difference]: Without dead ends: 230 [2018-02-02 10:27:45,218 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=420, Invalid=1932, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 10:27:45,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-02-02 10:27:45,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 223. [2018-02-02 10:27:45,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-02 10:27:45,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 241 transitions. [2018-02-02 10:27:45,220 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 241 transitions. Word has length 68 [2018-02-02 10:27:45,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:45,220 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 241 transitions. [2018-02-02 10:27:45,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:27:45,220 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 241 transitions. [2018-02-02 10:27:45,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 10:27:45,221 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:45,221 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:45,221 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:45,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1210896029, now seen corresponding path program 1 times [2018-02-02 10:27:45,221 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:45,228 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:45,282 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:27:45,282 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:45,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:27:45,282 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:45,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:45,283 INFO L182 omatonBuilderFactory]: Interpolants [11712#true, 11713#false, 11714#(= main_~status~0 2)] [2018-02-02 10:27:45,283 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:27:45,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:27:45,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:27:45,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:27:45,284 INFO L87 Difference]: Start difference. First operand 223 states and 241 transitions. Second operand 3 states. [2018-02-02 10:27:45,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:45,304 INFO L93 Difference]: Finished difference Result 300 states and 324 transitions. [2018-02-02 10:27:45,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:27:45,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-02-02 10:27:45,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:45,306 INFO L225 Difference]: With dead ends: 300 [2018-02-02 10:27:45,306 INFO L226 Difference]: Without dead ends: 300 [2018-02-02 10:27:45,306 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:27:45,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-02-02 10:27:45,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 249. [2018-02-02 10:27:45,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-02-02 10:27:45,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 268 transitions. [2018-02-02 10:27:45,309 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 268 transitions. Word has length 70 [2018-02-02 10:27:45,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:45,309 INFO L432 AbstractCegarLoop]: Abstraction has 249 states and 268 transitions. [2018-02-02 10:27:45,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:27:45,309 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 268 transitions. [2018-02-02 10:27:45,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 10:27:45,310 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:45,310 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:45,310 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:45,310 INFO L82 PathProgramCache]: Analyzing trace with hash 260313647, now seen corresponding path program 1 times [2018-02-02 10:27:45,311 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:45,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:45,646 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:45,647 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:45,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:27:45,647 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:45,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:45,647 INFO L182 omatonBuilderFactory]: Interpolants [12264#true, 12265#false, 12266#(= (select |#valid| main_~head~0.base) 1), 12267#(and (= main_~item~0.offset main_~head~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 12268#(and (= main_~item~0.offset main_~head~0.offset) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~malloc5.base|))), 12269#(and (= main_~item~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base)), 12270#(and (= main_~item~0.offset main_~head~0.offset) (= (select |#valid| main_~item~0.base) 1) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~mem7.base|))), 12271#(and (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1)), 12272#(and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 12273#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 12274#(or (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base))) (= main_~status~0 0)), 12275#(or (= main_~status~0 0) (and (not (= main_~head~0.base |main_#t~malloc5.base|)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base |main_#t~malloc5.base|)))), 12276#(or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))))), 12277#(or (and (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~item~0.base) main_~item~0.offset))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base |main_#t~mem7.base|))) (= main_~status~0 0)), 12278#(or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))) (= main_~status~0 0)), 12279#(or (and (not (= main_~head~0.base |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (= main_~status~0 0)), 12280#(or (= main_~status~0 0) (and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)))), 12281#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base))), 12282#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 12283#(= 1 (select |#valid| |main_#t~mem16.base|))] [2018-02-02 10:27:45,648 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:45,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:27:45,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:27:45,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:27:45,648 INFO L87 Difference]: Start difference. First operand 249 states and 268 transitions. Second operand 20 states. [2018-02-02 10:27:46,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:46,671 INFO L93 Difference]: Finished difference Result 327 states and 352 transitions. [2018-02-02 10:27:46,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:27:46,671 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 70 [2018-02-02 10:27:46,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:46,672 INFO L225 Difference]: With dead ends: 327 [2018-02-02 10:27:46,672 INFO L226 Difference]: Without dead ends: 327 [2018-02-02 10:27:46,672 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=378, Invalid=1344, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 10:27:46,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-02-02 10:27:46,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 285. [2018-02-02 10:27:46,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-02-02 10:27:46,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 306 transitions. [2018-02-02 10:27:46,675 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 306 transitions. Word has length 70 [2018-02-02 10:27:46,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:46,675 INFO L432 AbstractCegarLoop]: Abstraction has 285 states and 306 transitions. [2018-02-02 10:27:46,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:27:46,675 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 306 transitions. [2018-02-02 10:27:46,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 10:27:46,675 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:46,675 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:46,676 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:46,676 INFO L82 PathProgramCache]: Analyzing trace with hash 260313648, now seen corresponding path program 1 times [2018-02-02 10:27:46,676 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:46,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:47,278 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:47,279 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:47,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:27:47,279 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:47,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:47,279 INFO L182 omatonBuilderFactory]: Interpolants [12940#true, 12941#false, 12942#(= (select |#valid| main_~head~0.base) 1), 12943#(and (= main_~item~0.offset main_~head~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 12944#(and (= 0 |main_#t~malloc5.offset|) (= main_~item~0.offset main_~head~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~malloc5.base|))), 12945#(and (= main_~item~0.offset main_~head~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= 1 (select |#valid| main_~item~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~head~0.offset)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base)), 12946#(and (= main_~item~0.offset main_~head~0.offset) (= 12 (select |#length| |main_#t~mem7.base|)) (= (select |#valid| main_~item~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~head~0.offset)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~mem7.base|))), 12947#(and (= 12 (select |#length| |main_#t~mem9.base|)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 12948#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~item~0.base)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 12949#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~item~0.base)) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 12950#(or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~item~0.base)) (= 12 (select |#length| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 12951#(or (and (not (= main_~head~0.base |main_#t~malloc5.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~item~0.base)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base |main_#t~malloc5.base|))) (= main_~status~0 0)), 12952#(or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~item~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))))), 12953#(or (= main_~status~0 0) (and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~item~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~item~0.base) main_~item~0.offset))) (not (= main_~item~0.base |main_#t~mem7.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.offset)) main_~head~0.base) main_~head~0.offset)))), 12954#(and (or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~item~0.base)))) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))) (= main_~status~0 0))), 12955#(and (or (and (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 0)) (or (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 0))), 12956#(or (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (= main_~status~0 0)), 12957#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 12958#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 12959#(and (= |main_#t~mem16.offset| 0) (= (select |#length| |main_#t~mem16.base|) 12))] [2018-02-02 10:27:47,279 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:47,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:27:47,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:27:47,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:27:47,280 INFO L87 Difference]: Start difference. First operand 285 states and 306 transitions. Second operand 20 states. [2018-02-02 10:27:48,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:48,562 INFO L93 Difference]: Finished difference Result 326 states and 351 transitions. [2018-02-02 10:27:48,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:27:48,563 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 70 [2018-02-02 10:27:48,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:48,563 INFO L225 Difference]: With dead ends: 326 [2018-02-02 10:27:48,564 INFO L226 Difference]: Without dead ends: 326 [2018-02-02 10:27:48,564 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=384, Invalid=1256, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 10:27:48,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-02-02 10:27:48,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 285. [2018-02-02 10:27:48,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-02-02 10:27:48,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 305 transitions. [2018-02-02 10:27:48,567 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 305 transitions. Word has length 70 [2018-02-02 10:27:48,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:48,567 INFO L432 AbstractCegarLoop]: Abstraction has 285 states and 305 transitions. [2018-02-02 10:27:48,567 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:27:48,567 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 305 transitions. [2018-02-02 10:27:48,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 10:27:48,568 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:48,568 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:48,568 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:48,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1398724031, now seen corresponding path program 1 times [2018-02-02 10:27:48,569 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:48,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:48,626 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 10:27:48,626 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:27:48,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:27:48,626 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:48,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:48,627 INFO L182 omatonBuilderFactory]: Interpolants [13616#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 13617#(= 1 (select |#valid| |main_#t~mem28.base|)), 13618#(= 1 (select |#valid| main_~item~0.base)), 13613#true, 13614#false, 13615#(= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))] [2018-02-02 10:27:48,627 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 10:27:48,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:27:48,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:27:48,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:27:48,627 INFO L87 Difference]: Start difference. First operand 285 states and 305 transitions. Second operand 6 states. [2018-02-02 10:27:48,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:48,753 INFO L93 Difference]: Finished difference Result 331 states and 357 transitions. [2018-02-02 10:27:48,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:27:48,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-02-02 10:27:48,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:48,754 INFO L225 Difference]: With dead ends: 331 [2018-02-02 10:27:48,754 INFO L226 Difference]: Without dead ends: 331 [2018-02-02 10:27:48,754 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:27:48,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-02-02 10:27:48,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 294. [2018-02-02 10:27:48,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-02-02 10:27:48,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 318 transitions. [2018-02-02 10:27:48,757 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 318 transitions. Word has length 82 [2018-02-02 10:27:48,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:48,757 INFO L432 AbstractCegarLoop]: Abstraction has 294 states and 318 transitions. [2018-02-02 10:27:48,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:27:48,757 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 318 transitions. [2018-02-02 10:27:48,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 10:27:48,757 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:48,757 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:48,757 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:48,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1398724030, now seen corresponding path program 1 times [2018-02-02 10:27:48,758 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:48,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:49,189 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:49,189 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:49,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:27:49,189 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:49,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:49,190 INFO L182 omatonBuilderFactory]: Interpolants [14272#(and (= 12 (select |#length| |main_#t~mem28.base|)) (<= |main_#t~mem28.offset| 0) (<= 0 |main_#t~mem28.offset|)), 14273#(and (= (select |#length| main_~item~0.base) 12) (<= 0 main_~item~0.offset) (<= main_~item~0.offset 0)), 14252#true, 14253#false, 14254#(= (select |#valid| main_~head~0.base) 1), 14255#(and (= main_~item~0.offset main_~head~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 14256#(and (= 0 |main_#t~malloc5.offset|) (= main_~item~0.offset main_~head~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~malloc5.base|))), 14257#(and (= main_~item~0.offset main_~head~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= 1 (select |#valid| main_~item~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~head~0.offset)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base)), 14258#(and (= main_~item~0.offset main_~head~0.offset) (= 12 (select |#length| |main_#t~mem7.base|)) (= (select |#valid| main_~item~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~head~0.offset)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~mem7.base|))), 14259#(and (= 12 (select |#length| |main_#t~mem9.base|)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 14260#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~item~0.base)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 14261#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~item~0.base)) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 14262#(or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~item~0.base)) (= 12 (select |#length| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 14263#(or (and (not (= main_~head~0.base |main_#t~malloc5.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~item~0.base)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base |main_#t~malloc5.base|))) (= main_~status~0 0)), 14264#(or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~item~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))))), 14265#(or (= main_~status~0 0) (and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~item~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~item~0.base) main_~item~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base |main_#t~mem7.base|)))), 14266#(or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~item~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))))), 14267#(or (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 0)), 14268#(or (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (= main_~status~0 0)), 14269#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 14270#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 14271#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem16.offset| 0) (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 10:27:49,190 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:49,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:27:49,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:27:49,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:27:49,191 INFO L87 Difference]: Start difference. First operand 294 states and 318 transitions. Second operand 22 states. [2018-02-02 10:27:50,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:50,651 INFO L93 Difference]: Finished difference Result 346 states and 377 transitions. [2018-02-02 10:27:50,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:27:50,651 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 82 [2018-02-02 10:27:50,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:50,652 INFO L225 Difference]: With dead ends: 346 [2018-02-02 10:27:50,652 INFO L226 Difference]: Without dead ends: 346 [2018-02-02 10:27:50,652 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=405, Invalid=1575, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 10:27:50,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-02-02 10:27:50,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 310. [2018-02-02 10:27:50,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-02-02 10:27:50,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 337 transitions. [2018-02-02 10:27:50,655 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 337 transitions. Word has length 82 [2018-02-02 10:27:50,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:50,655 INFO L432 AbstractCegarLoop]: Abstraction has 310 states and 337 transitions. [2018-02-02 10:27:50,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:27:50,655 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 337 transitions. [2018-02-02 10:27:50,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 10:27:50,656 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:50,656 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:50,656 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:50,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1534096123, now seen corresponding path program 1 times [2018-02-02 10:27:50,656 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:50,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:51,150 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:51,150 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:51,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:27:51,150 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:51,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:51,151 INFO L182 omatonBuilderFactory]: Interpolants [14976#true, 14977#false, 14978#(not (= 0 |main_#t~malloc0.base|)), 14979#(not (= 0 main_~head~0.base)), 14980#(and (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base))), 14981#(and (= main_~item~0.offset main_~head~0.offset) (= (select |#valid| main_~item~0.base) 1) (not (= 0 main_~head~0.base)) (= main_~item~0.base main_~head~0.base)), 14982#(and (= main_~item~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~malloc5.base|))), 14983#(and (= main_~item~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~item~0.base)) (not (= 0 main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base)), 14984#(and (= main_~item~0.offset main_~head~0.offset) (= (select |#valid| main_~item~0.base) 1) (not (= 0 main_~head~0.base)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~mem7.base|))), 14985#(and (= (select |#valid| main_~item~0.base) 1) (not (= 0 main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~head~0.offset)))), 14986#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base))), 14987#(and (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base))), 14988#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base))), 14989#(or (= main_~status~0 0) (and (= main_~status~0 (select |#valid| main_~item~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (not (= 0 main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base)))), 14990#(or (and (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= 0 main_~head~0.base)) (not (= main_~item~0.base |main_#t~malloc5.base|)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)))) (= main_~status~0 0)), 14991#(or (= main_~status~0 0) (and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))))), 14992#(or (and (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~item~0.base) main_~item~0.offset))) (not (= 0 main_~head~0.base)) (not (= main_~item~0.base |main_#t~mem7.base|))) (= main_~status~0 0)), 14993#(or (= main_~status~0 0) (and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))))), 14994#(or (= main_~status~0 0) (and (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base)))), 14995#(or (and (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (not (= 0 main_~head~0.base))) (= main_~status~0 0)), 14996#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (not (= 0 main_~head~0.base))), 14997#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base))), 14998#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem16.base|)) (not (= 0 main_~head~0.base))), 14999#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base))), 15000#(and (not (= 0 main_~item~0.base)) (= 1 (select (store |#valid| main_~item~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 15001#(and (= 1 (select (store |#valid| main_~item~0.base 0) |main_#t~mem34.base|)) (not (= 0 main_~item~0.base))), 15002#(and (= 1 (select (store |#valid| main_~item~0.base 0) main_~head~0.base)) (not (= 0 main_~item~0.base))), 15003#(= (select |#valid| main_~head~0.base) 1)] [2018-02-02 10:27:51,151 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:51,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:27:51,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:27:51,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:27:51,151 INFO L87 Difference]: Start difference. First operand 310 states and 337 transitions. Second operand 28 states. [2018-02-02 10:27:53,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:53,545 INFO L93 Difference]: Finished difference Result 711 states and 775 transitions. [2018-02-02 10:27:53,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-02 10:27:53,545 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 87 [2018-02-02 10:27:53,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:53,546 INFO L225 Difference]: With dead ends: 711 [2018-02-02 10:27:53,546 INFO L226 Difference]: Without dead ends: 711 [2018-02-02 10:27:53,547 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1625 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1226, Invalid=4626, Unknown=0, NotChecked=0, Total=5852 [2018-02-02 10:27:53,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2018-02-02 10:27:53,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 439. [2018-02-02 10:27:53,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-02-02 10:27:53,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 494 transitions. [2018-02-02 10:27:53,551 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 494 transitions. Word has length 87 [2018-02-02 10:27:53,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:53,551 INFO L432 AbstractCegarLoop]: Abstraction has 439 states and 494 transitions. [2018-02-02 10:27:53,551 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 10:27:53,551 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 494 transitions. [2018-02-02 10:27:53,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 10:27:53,552 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:53,552 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:53,552 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:53,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1534096124, now seen corresponding path program 1 times [2018-02-02 10:27:53,552 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:53,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:53,601 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 10:27:53,601 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:53,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:27:53,602 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:53,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:53,602 INFO L182 omatonBuilderFactory]: Interpolants [16256#(and (<= (+ |main_#t~mem34.offset| 4) (select |#length| |main_#t~mem34.base|)) (<= 0 |main_#t~mem34.offset|)), 16257#(and (<= (+ main_~head~0.offset 4) (select |#length| main_~head~0.base)) (<= 0 main_~head~0.offset)), 16252#true, 16253#false, 16254#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 16255#(and (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))))] [2018-02-02 10:27:53,602 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 10:27:53,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:27:53,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:27:53,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:27:53,603 INFO L87 Difference]: Start difference. First operand 439 states and 494 transitions. Second operand 6 states. [2018-02-02 10:27:53,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:53,768 INFO L93 Difference]: Finished difference Result 480 states and 538 transitions. [2018-02-02 10:27:53,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:27:53,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2018-02-02 10:27:53,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:53,769 INFO L225 Difference]: With dead ends: 480 [2018-02-02 10:27:53,769 INFO L226 Difference]: Without dead ends: 480 [2018-02-02 10:27:53,769 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:27:53,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2018-02-02 10:27:53,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 463. [2018-02-02 10:27:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-02-02 10:27:53,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 527 transitions. [2018-02-02 10:27:53,774 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 527 transitions. Word has length 87 [2018-02-02 10:27:53,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:53,775 INFO L432 AbstractCegarLoop]: Abstraction has 463 states and 527 transitions. [2018-02-02 10:27:53,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:27:53,775 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 527 transitions. [2018-02-02 10:27:53,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 10:27:53,775 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:53,776 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:53,776 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:53,776 INFO L82 PathProgramCache]: Analyzing trace with hash 312338347, now seen corresponding path program 1 times [2018-02-02 10:27:53,776 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:53,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:53,843 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 10:27:53,844 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:53,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:27:53,844 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:53,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:53,845 INFO L182 omatonBuilderFactory]: Interpolants [17209#true, 17210#false, 17211#(and (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 17212#(or (not (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 17213#(or (not (= |main_#t~mem34.offset| 0)) (not (= 0 |main_#t~mem34.base|))), 17214#(or (not (= 0 main_~head~0.base)) (not (= main_~head~0.offset 0)))] [2018-02-02 10:27:53,845 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 10:27:53,845 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:27:53,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:27:53,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:27:53,845 INFO L87 Difference]: Start difference. First operand 463 states and 527 transitions. Second operand 6 states. [2018-02-02 10:27:53,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:53,961 INFO L93 Difference]: Finished difference Result 475 states and 532 transitions. [2018-02-02 10:27:53,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:27:53,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2018-02-02 10:27:53,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:53,962 INFO L225 Difference]: With dead ends: 475 [2018-02-02 10:27:53,962 INFO L226 Difference]: Without dead ends: 467 [2018-02-02 10:27:53,962 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-02 10:27:53,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-02-02 10:27:53,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 463. [2018-02-02 10:27:53,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-02-02 10:27:53,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 522 transitions. [2018-02-02 10:27:53,967 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 522 transitions. Word has length 88 [2018-02-02 10:27:53,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:53,967 INFO L432 AbstractCegarLoop]: Abstraction has 463 states and 522 transitions. [2018-02-02 10:27:53,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:27:53,968 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 522 transitions. [2018-02-02 10:27:53,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 10:27:53,968 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:53,968 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:53,968 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:53,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1092604284, now seen corresponding path program 1 times [2018-02-02 10:27:53,969 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:53,982 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:54,312 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:54,312 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:54,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:27:54,312 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:54,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:54,313 INFO L182 omatonBuilderFactory]: Interpolants [18176#(and (not (= main_~item~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18177#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 18178#(= 0 |main_#t~mem34.offset|), 18179#(= 0 main_~head~0.offset), 18180#(= main_~item~0.offset 0), 18159#true, 18160#false, 18161#(= (select |#valid| main_~head~0.base) 1), 18162#(and (= main_~item~0.offset main_~head~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 18163#(and (= 0 |main_#t~malloc5.offset|) (= main_~item~0.offset main_~head~0.offset) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~malloc5.base|))), 18164#(and (= 1 (select |#valid| main_~item~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~head~0.offset)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base)), 18165#(and (= (select |#valid| main_~item~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~head~0.offset)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~mem7.base|))), 18166#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18167#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 18168#(and (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18169#(or (= main_~status~0 0) (and (= main_~status~0 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 18170#(or (= main_~status~0 0) (and (not (= main_~head~0.base |main_#t~malloc5.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base |main_#t~malloc5.base|)))), 18171#(or (= main_~status~0 0) (and (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))))), 18172#(or (and (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~item~0.base) main_~item~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base |main_#t~mem7.base|))) (= main_~status~0 0)), 18173#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))) (= main_~status~0 0)), 18174#(or (and (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 0)), 18175#(or (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base))) (= main_~status~0 0))] [2018-02-02 10:27:54,313 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:54,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:27:54,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:27:54,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:27:54,313 INFO L87 Difference]: Start difference. First operand 463 states and 522 transitions. Second operand 22 states. [2018-02-02 10:27:55,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:55,704 INFO L93 Difference]: Finished difference Result 706 states and 793 transitions. [2018-02-02 10:27:55,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 10:27:55,704 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 89 [2018-02-02 10:27:55,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:55,706 INFO L225 Difference]: With dead ends: 706 [2018-02-02 10:27:55,706 INFO L226 Difference]: Without dead ends: 706 [2018-02-02 10:27:55,707 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=501, Invalid=1949, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 10:27:55,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2018-02-02 10:27:55,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 600. [2018-02-02 10:27:55,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-02-02 10:27:55,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 704 transitions. [2018-02-02 10:27:55,713 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 704 transitions. Word has length 89 [2018-02-02 10:27:55,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:55,714 INFO L432 AbstractCegarLoop]: Abstraction has 600 states and 704 transitions. [2018-02-02 10:27:55,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:27:55,714 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 704 transitions. [2018-02-02 10:27:55,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 10:27:55,715 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:55,715 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:55,715 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:55,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1782530235, now seen corresponding path program 2 times [2018-02-02 10:27:55,716 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:55,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:56,578 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:56,579 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:56,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 10:27:56,579 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:56,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:56,579 INFO L182 omatonBuilderFactory]: Interpolants [19543#true, 19544#false, 19545#(not (= 0 |main_#t~malloc0.base|)), 19546#(not (= 0 main_~head~0.base)), 19547#(and (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base))), 19548#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (not (= 0 main_~head~0.base)) (= main_~item~0.base main_~head~0.base)), 19549#(and (= |main_#t~malloc5.offset| 0) (= main_~head~0.offset main_~item~0.offset) (not (= 0 main_~head~0.base)) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~malloc5.base|))), 19550#(and (= main_~head~0.offset main_~item~0.offset) (= 1 (select |#valid| main_~item~0.base)) (not (= 0 main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base) (= (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset) 0)), 19551#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base main_~head~0.base) (= (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset) 0) (not (= main_~item~0.base |main_#t~mem7.base|))), 19552#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.offset| 0) (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base))), 19553#(and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base)) (= main_~item~0.offset 0)), 19554#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base)) (= main_~item~0.offset 0)), 19555#(and (= main_~status~0 (select |#valid| main_~item~0.base)) (or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (not (= 0 main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base)) (= main_~item~0.offset 0)))), 19556#(and (or (= main_~status~0 0) (not (= main_~item~0.base |main_#t~malloc5.base|))) (or (and (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= 0 main_~head~0.base)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~item~0.offset 0)) (= main_~status~0 0))), 19557#(and (or (= main_~status~0 0) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))) (or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 main_~head~0.base)) (= main_~item~0.offset 0) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))))), 19558#(and (or (and (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~head~0.base) main_~head~0.offset) main_~item~0.base) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~item~0.base) main_~item~0.offset))) (not (= 0 main_~head~0.base)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.offset 0)) (= main_~status~0 0)) (or (= main_~status~0 0) (not (= main_~item~0.base |main_#t~mem7.base|)))), 19559#(or (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.offset 0) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))) (= main_~status~0 0)), 19560#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|)) (not (= 0 main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))) (= main_~status~0 0)), 19561#(or (= main_~status~0 0) (and (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~item~0.base main_~head~0.base)) (not (= 0 main_~head~0.base)) (not (= (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0))))), 19562#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~item~0.base main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 19563#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= 0 main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 19564#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= 0 main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 19565#(and (or (not (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= 0 main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 19566#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) 0))) (or (not (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) 0))) (not (= 0 main_~head~0.base))), 19567#(and (or (not (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (= 1 (select (store |#valid| main_~item~0.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= 0 main_~item~0.base))), 19568#(and (= 1 (select (store |#valid| main_~item~0.base 0) (select (select |#memory_$Pointer$.base| |main_#t~mem34.base|) 0))) (not (= 0 main_~item~0.base)) (not (= |main_#t~mem34.base| (select (select |#memory_$Pointer$.base| |main_#t~mem34.base|) 0))) (or (not (= |main_#t~mem34.offset| 0)) (not (= 0 |main_#t~mem34.base|)))), 19569#(and (or (not (= 0 main_~head~0.base)) (not (= main_~head~0.offset 0))) (or (and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select (store |#valid| main_~item~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.offset 0))) (not (= 0 main_~item~0.base))), 19570#(and (or (not (= 0 main_~head~0.base)) (not (= main_~head~0.offset 0))) (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.offset 0)))), 19571#(and (or (not (= main_~item~0.offset 0)) (= 1 (select (store |#valid| main_~item~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base)))), 19572#(and (or (not (= main_~item~0.offset 0)) (= 1 (select (store |#valid| main_~item~0.base 0) |main_#t~mem34.base|))) (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base)))), 19573#(and (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base))) (or (not (= main_~item~0.offset 0)) (= 1 (select (store |#valid| main_~item~0.base 0) main_~head~0.base)))), 19574#(= (select |#valid| main_~head~0.base) 1)] [2018-02-02 10:27:56,580 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:56,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 10:27:56,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 10:27:56,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=891, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:27:56,581 INFO L87 Difference]: Start difference. First operand 600 states and 704 transitions. Second operand 32 states. [2018-02-02 10:27:58,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:27:58,736 INFO L93 Difference]: Finished difference Result 648 states and 756 transitions. [2018-02-02 10:27:58,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 10:27:58,736 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 92 [2018-02-02 10:27:58,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:27:58,737 INFO L225 Difference]: With dead ends: 648 [2018-02-02 10:27:58,737 INFO L226 Difference]: Without dead ends: 648 [2018-02-02 10:27:58,738 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1259 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=782, Invalid=4188, Unknown=0, NotChecked=0, Total=4970 [2018-02-02 10:27:58,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2018-02-02 10:27:58,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 629. [2018-02-02 10:27:58,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2018-02-02 10:27:58,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 743 transitions. [2018-02-02 10:27:58,742 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 743 transitions. Word has length 92 [2018-02-02 10:27:58,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:27:58,743 INFO L432 AbstractCegarLoop]: Abstraction has 629 states and 743 transitions. [2018-02-02 10:27:58,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 10:27:58,743 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 743 transitions. [2018-02-02 10:27:58,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 10:27:58,743 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:27:58,747 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:27:58,747 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:27:58,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1782530234, now seen corresponding path program 2 times [2018-02-02 10:27:58,748 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:27:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:27:58,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:27:59,308 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:59,308 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:27:59,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:27:59,308 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:27:59,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:59,309 INFO L182 omatonBuilderFactory]: Interpolants [20930#true, 20931#false, 20932#(= (select |#valid| main_~head~0.base) 1), 20933#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 20934#(and (= |main_#t~malloc5.offset| 0) (= main_~head~0.offset main_~item~0.offset) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~malloc5.base|))), 20935#(and (= main_~head~0.offset main_~item~0.offset) (= 1 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base) (= (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset) 0)), 20936#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base main_~head~0.base) (= (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset) 0) (not (= main_~item~0.base |main_#t~mem7.base|))), 20937#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.offset| 0) (= (select |#valid| main_~head~0.base) 1)), 20938#(and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~item~0.offset 0)), 20939#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~item~0.offset 0)), 20940#(or (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base)) (= main_~item~0.offset 0)) (= main_~status~0 0)), 20941#(or (= main_~status~0 0) (and (= 0 |main_#t~malloc5.offset|) (not (= main_~head~0.base |main_#t~malloc5.base|)) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base |main_#t~malloc5.base|)) (= main_~item~0.offset 0))), 20942#(or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) 0)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~item~0.base) 0))) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))))), 20943#(or (and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~item~0.base) 0))) (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) 0)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~item~0.base) main_~item~0.offset))) (not (= main_~item~0.base |main_#t~mem7.base|))) (= main_~status~0 0)), 20944#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))) (= main_~status~0 0)), 20945#(or (and (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~item~0.base main_~head~0.base)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0)))) (= main_~status~0 0)), 20946#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~item~0.base main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 20947#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 20948#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) 0))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) 0))), 20949#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem34.base|) 0))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem34.base|) 0))), 20950#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) 0))), 20951#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) 0))) (= main_~head~0.offset main_~item~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) 0))), 20952#(and (or (= 0 |main_#t~mem34.offset|) (not (= main_~item~0.offset 0))) (or (= 12 (select |#length| |main_#t~mem34.base|)) (not (= main_~item~0.offset 0)))), 20953#(and (or (not (= main_~item~0.offset 0)) (= (select |#length| main_~head~0.base) 12)) (or (not (= main_~item~0.offset 0)) (= main_~head~0.offset 0))), 20954#(and (= (select |#length| main_~head~0.base) 12) (= main_~head~0.offset 0))] [2018-02-02 10:27:59,309 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:27:59,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:27:59,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:27:59,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:27:59,309 INFO L87 Difference]: Start difference. First operand 629 states and 743 transitions. Second operand 25 states. [2018-02-02 10:28:00,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:00,585 INFO L93 Difference]: Finished difference Result 645 states and 753 transitions. [2018-02-02 10:28:00,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:28:00,585 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 92 [2018-02-02 10:28:00,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:00,586 INFO L225 Difference]: With dead ends: 645 [2018-02-02 10:28:00,586 INFO L226 Difference]: Without dead ends: 645 [2018-02-02 10:28:00,587 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=284, Invalid=1878, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:28:00,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2018-02-02 10:28:00,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 628. [2018-02-02 10:28:00,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-02-02 10:28:00,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 741 transitions. [2018-02-02 10:28:00,593 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 741 transitions. Word has length 92 [2018-02-02 10:28:00,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:00,593 INFO L432 AbstractCegarLoop]: Abstraction has 628 states and 741 transitions. [2018-02-02 10:28:00,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:28:00,593 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 741 transitions. [2018-02-02 10:28:00,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 10:28:00,594 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:00,594 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:00,594 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:00,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1717837581, now seen corresponding path program 1 times [2018-02-02 10:28:00,595 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:00,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:00,656 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:28:00,656 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:28:00,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:28:00,657 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:00,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:00,657 INFO L182 omatonBuilderFactory]: Interpolants [22272#true, 22273#false, 22274#(= main_~status~0 2), 22275#(and (not |main_#t~short32|) (not (= main_~status~0 0)))] [2018-02-02 10:28:00,657 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:28:00,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:28:00,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:28:00,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:28:00,658 INFO L87 Difference]: Start difference. First operand 628 states and 741 transitions. Second operand 4 states. [2018-02-02 10:28:00,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:00,689 INFO L93 Difference]: Finished difference Result 639 states and 733 transitions. [2018-02-02 10:28:00,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:28:00,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-02-02 10:28:00,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:00,692 INFO L225 Difference]: With dead ends: 639 [2018-02-02 10:28:00,692 INFO L226 Difference]: Without dead ends: 639 [2018-02-02 10:28:00,692 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:28:00,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-02-02 10:28:00,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 616. [2018-02-02 10:28:00,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-02-02 10:28:00,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 713 transitions. [2018-02-02 10:28:00,698 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 713 transitions. Word has length 92 [2018-02-02 10:28:00,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:00,698 INFO L432 AbstractCegarLoop]: Abstraction has 616 states and 713 transitions. [2018-02-02 10:28:00,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:28:00,699 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 713 transitions. [2018-02-02 10:28:00,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 10:28:00,699 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:00,699 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:00,699 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:00,700 INFO L82 PathProgramCache]: Analyzing trace with hash -921619733, now seen corresponding path program 1 times [2018-02-02 10:28:00,700 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:00,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:00,729 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-02-02 10:28:00,730 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:28:00,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:28:00,730 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:00,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:00,730 INFO L182 omatonBuilderFactory]: Interpolants [23533#true, 23534#false, 23535#(= main_~status~0 3)] [2018-02-02 10:28:00,731 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-02-02 10:28:00,731 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:28:00,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:28:00,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:28:00,731 INFO L87 Difference]: Start difference. First operand 616 states and 713 transitions. Second operand 3 states. [2018-02-02 10:28:00,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:00,746 INFO L93 Difference]: Finished difference Result 258 states and 272 transitions. [2018-02-02 10:28:00,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:28:00,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2018-02-02 10:28:00,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:00,748 INFO L225 Difference]: With dead ends: 258 [2018-02-02 10:28:00,748 INFO L226 Difference]: Without dead ends: 258 [2018-02-02 10:28:00,748 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:28:00,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-02 10:28:00,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 231. [2018-02-02 10:28:00,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 10:28:00,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 248 transitions. [2018-02-02 10:28:00,751 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 248 transitions. Word has length 92 [2018-02-02 10:28:00,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:00,751 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 248 transitions. [2018-02-02 10:28:00,751 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:28:00,751 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 248 transitions. [2018-02-02 10:28:00,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 10:28:00,751 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:00,752 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:00,752 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:00,752 INFO L82 PathProgramCache]: Analyzing trace with hash 576136353, now seen corresponding path program 2 times [2018-02-02 10:28:00,752 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:00,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:00,848 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 10:28:00,848 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:00,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:28:00,848 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:00,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:00,849 INFO L182 omatonBuilderFactory]: Interpolants [24032#(or (not (= |main_#t~mem34.offset| 0)) (not (= 0 |main_#t~mem34.base|))), 24033#(or (not (= 0 main_~head~0.base)) (not (= main_~head~0.offset 0))), 24025#true, 24026#false, 24027#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 24028#(and (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem17.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 24029#(or (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))), 24030#(or (not (= (select (select |#memory_$Pointer$.offset| |main_#t~mem34.base|) |main_#t~mem34.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem34.base|) |main_#t~mem34.offset|)))), 24031#(or (not (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))))] [2018-02-02 10:28:00,849 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 10:28:00,849 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:28:00,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:28:00,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:28:00,849 INFO L87 Difference]: Start difference. First operand 231 states and 248 transitions. Second operand 9 states. [2018-02-02 10:28:01,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:01,054 INFO L93 Difference]: Finished difference Result 234 states and 247 transitions. [2018-02-02 10:28:01,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:28:01,054 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2018-02-02 10:28:01,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:01,055 INFO L225 Difference]: With dead ends: 234 [2018-02-02 10:28:01,055 INFO L226 Difference]: Without dead ends: 234 [2018-02-02 10:28:01,056 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:28:01,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-02-02 10:28:01,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2018-02-02 10:28:01,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 10:28:01,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 247 transitions. [2018-02-02 10:28:01,058 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 247 transitions. Word has length 93 [2018-02-02 10:28:01,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:01,059 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 247 transitions. [2018-02-02 10:28:01,059 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:28:01,059 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 247 transitions. [2018-02-02 10:28:01,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 10:28:01,059 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:01,060 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:01,060 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:01,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1434599856, now seen corresponding path program 1 times [2018-02-02 10:28:01,061 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:01,077 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:02,027 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:02,027 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:02,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:28:02,027 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:02,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:02,028 INFO L182 omatonBuilderFactory]: Interpolants [24512#false, 24513#(= (select |#valid| main_~head~0.base) 1), 24514#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 24515#(and (= main_~head~0.offset main_~item~0.offset) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~malloc5.base|))), 24516#(and (= main_~head~0.offset main_~item~0.offset) (= 1 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base)), 24517#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~mem7.base|))), 24518#(and (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1)), 24519#(and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 24520#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 24521#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 1) (= main_~status~0 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base))), 24522#(and (not (= main_~head~0.base |main_#t~malloc5.base|)) (= main_~status~0 1) (= main_~status~0 (select |#valid| main_~head~0.base)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base |main_#t~malloc5.base|))), 24523#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 1) (= 1 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~status~0 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))), 24524#(and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~head~0.base) main_~head~0.offset)) (= main_~status~0 1) (= 1 (select |#valid| main_~item~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~item~0.base) main_~item~0.offset))) (= main_~status~0 (select |#valid| main_~head~0.base)) (not (= main_~item~0.base |main_#t~mem7.base|))), 24525#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 1) (= 1 (select |#valid| main_~item~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))), 24526#(and (= main_~status~0 1) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 (select |#valid| main_~head~0.base))), 24527#(and (= main_~status~0 1) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base))), 24528#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 (select |#valid| main_~item~0.base)) (= 1 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base))), 24529#(and (not (= (select |#valid| main_~head~0.base) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base))), 24530#(and (not (= (select |#valid| main_~head~0.base) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (not (= (select |#valid| main_~item~0.base) 0))), 24531#(and (not (= main_~head~0.base |main_#t~malloc5.base|)) (or (= |main_#t~malloc5.base| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~item~0.base |main_#t~malloc5.base|))), 24532#(and (or (= (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))), 24533#(and (or (and (= (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset) (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~item~0.base) main_~item~0.offset))) (not (= main_~item~0.base |main_#t~mem7.base|))), 24534#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))), 24535#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 24536#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base))), 24537#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 24538#(= 1 (select |#valid| |main_#t~mem19.base|)), 24511#true] [2018-02-02 10:28:02,028 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:02,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:28:02,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:28:02,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:28:02,028 INFO L87 Difference]: Start difference. First operand 231 states and 247 transitions. Second operand 28 states. [2018-02-02 10:28:02,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:02,918 INFO L93 Difference]: Finished difference Result 230 states and 246 transitions. [2018-02-02 10:28:02,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:28:02,918 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 93 [2018-02-02 10:28:02,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:02,919 INFO L225 Difference]: With dead ends: 230 [2018-02-02 10:28:02,919 INFO L226 Difference]: Without dead ends: 230 [2018-02-02 10:28:02,919 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=392, Invalid=1770, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:28:02,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-02-02 10:28:02,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2018-02-02 10:28:02,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-02 10:28:02,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 246 transitions. [2018-02-02 10:28:02,921 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 246 transitions. Word has length 93 [2018-02-02 10:28:02,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:02,921 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 246 transitions. [2018-02-02 10:28:02,921 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 10:28:02,921 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 246 transitions. [2018-02-02 10:28:02,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 10:28:02,921 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:02,921 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:02,921 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:02,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1434599855, now seen corresponding path program 1 times [2018-02-02 10:28:02,922 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:02,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:04,125 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:04,125 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:04,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 10:28:04,125 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:04,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:04,126 INFO L182 omatonBuilderFactory]: Interpolants [25037#true, 25038#false, 25039#(= |main_#t~malloc0.offset| 0), 25040#(= main_~head~0.offset 0), 25041#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 25042#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset 0)), 25043#(and (= 0 |main_#t~malloc5.offset|) (= main_~head~0.offset main_~item~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset 0) (not (= main_~item~0.base |main_#t~malloc5.base|))), 25044#(and (= main_~head~0.offset main_~item~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= 1 (select |#valid| main_~item~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~head~0.offset)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset 0)), 25045#(and (= 12 (select |#length| |main_#t~mem7.base|)) (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~head~0.base main_~item~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~head~0.offset)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~head~0.offset 0) (not (= main_~item~0.base |main_#t~mem7.base|))), 25046#(and (= 12 (select |#length| |main_#t~mem9.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 25047#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~item~0.base)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 25048#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~item~0.base)) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 25049#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 1) (= main_~status~0 (select |#valid| main_~item~0.base)) (= 12 (select |#length| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 25050#(or (= main_~status~0 0) (and (not (= main_~head~0.base |main_#t~malloc5.base|)) (= main_~status~0 1) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~item~0.base)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0) (not (= main_~item~0.base |main_#t~malloc5.base|)))), 25051#(or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 1) (= 12 (select |#length| main_~item~0.base)) (= 1 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))))), 25052#(or (= main_~status~0 0) (and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~head~0.base) main_~head~0.offset)) (= main_~status~0 1) (= main_~status~0 (select |#valid| main_~item~0.base)) (= 12 (select |#length| main_~item~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~item~0.base) main_~item~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base |main_#t~mem7.base|)))), 25053#(or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 1) (= main_~status~0 (select |#valid| main_~item~0.base)) (= 12 (select |#length| main_~item~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))))), 25054#(or (= main_~status~0 0) (and (= main_~status~0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 1) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem9.base|)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 25055#(or (and (= main_~status~0 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~status~0 1) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0)) (= main_~status~0 0)), 25056#(or (and (= main_~status~0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 (select |#valid| main_~item~0.base)) (= 1 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 0)), 25057#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 25058#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select |#valid| main_~item~0.base) 0)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 25059#(and (= main_~head~0.offset |main_#t~malloc5.offset|) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base |main_#t~malloc5.base|))), 25060#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset))), 25061#(and (or (and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset))) (and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.offset)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)))) (not (= main_~item~0.base |main_#t~mem7.base|))), 25062#(or (and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset))) (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)))), 25063#(or (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset |main_#t~mem9.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= main_~head~0.offset |main_#t~mem9.offset|) (= main_~head~0.base |main_#t~mem9.base|))), 25064#(or (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (and (= main_~item~0.offset main_~head~0.offset) (= main_~item~0.base main_~head~0.base))), 25065#(or (and (= main_~item~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base main_~head~0.base)) (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 25066#(or (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 25067#(or (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= |main_#t~mem18.base| 0) (= 0 |main_#t~mem18.offset|))), 25068#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 25069#(and (= (select |#length| |main_#t~mem19.base|) 12) (= |main_#t~mem19.offset| 0))] [2018-02-02 10:28:04,126 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:04,126 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 10:28:04,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 10:28:04,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=908, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:28:04,126 INFO L87 Difference]: Start difference. First operand 230 states and 246 transitions. Second operand 33 states. [2018-02-02 10:28:06,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:06,429 INFO L93 Difference]: Finished difference Result 331 states and 353 transitions. [2018-02-02 10:28:06,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 10:28:06,429 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 93 [2018-02-02 10:28:06,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:06,430 INFO L225 Difference]: With dead ends: 331 [2018-02-02 10:28:06,430 INFO L226 Difference]: Without dead ends: 331 [2018-02-02 10:28:06,431 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=943, Invalid=3613, Unknown=0, NotChecked=0, Total=4556 [2018-02-02 10:28:06,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-02-02 10:28:06,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 268. [2018-02-02 10:28:06,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-02-02 10:28:06,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 285 transitions. [2018-02-02 10:28:06,433 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 285 transitions. Word has length 93 [2018-02-02 10:28:06,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:06,433 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 285 transitions. [2018-02-02 10:28:06,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 10:28:06,433 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 285 transitions. [2018-02-02 10:28:06,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 10:28:06,433 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:06,433 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:06,433 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:06,434 INFO L82 PathProgramCache]: Analyzing trace with hash 680407878, now seen corresponding path program 2 times [2018-02-02 10:28:06,434 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:06,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:06,970 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:06,970 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:06,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:28:06,970 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:06,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:06,971 INFO L182 omatonBuilderFactory]: Interpolants [25739#true, 25740#false, 25741#(= (select |#valid| main_~head~0.base) 1), 25742#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 25743#(and (= |main_#t~malloc5.offset| 0) (= main_~head~0.offset main_~item~0.offset) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~malloc5.base|))), 25744#(and (= main_~head~0.offset main_~item~0.offset) (= 1 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base) (= (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset) 0)), 25745#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base main_~head~0.base) (= (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset) 0) (not (= main_~item~0.base |main_#t~mem7.base|))), 25746#(and (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.offset| 0) (= (select |#valid| main_~head~0.base) 1)), 25747#(and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~item~0.offset 0)), 25748#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~item~0.offset 0)), 25749#(and (= main_~status~0 (select |#valid| main_~item~0.base)) (or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base)) (= main_~item~0.offset 0)))), 25750#(and (or (= main_~status~0 0) (not (= main_~item~0.base |main_#t~malloc5.base|))) (or (and (= 0 |main_#t~malloc5.offset|) (not (= main_~head~0.base |main_#t~malloc5.base|)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~item~0.offset 0)) (= main_~status~0 0))), 25751#(and (or (= main_~status~0 0) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) 0)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))) (= main_~status~0 0))), 25752#(and (or (= main_~status~0 0) (not (= main_~item~0.base |main_#t~mem7.base|))) (or (= main_~status~0 0) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) 0)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~item~0.base) main_~item~0.offset)))))), 25753#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) 0)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))) (= main_~status~0 0)), 25754#(or (= main_~status~0 0) (and (= 0 |main_#t~mem9.offset|) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~head~0.base |main_#t~mem9.base|)))), 25755#(or (and (not (= main_~item~0.base main_~head~0.base)) (or (and (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0))) (and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~item~0.offset 0)))) (= main_~status~0 0)), 25756#(or (and (not (= main_~item~0.base main_~head~0.base)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~item~0.offset 0)))) (= main_~status~0 0)), 25757#(and (not (= main_~item~0.base main_~head~0.base)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~item~0.offset 0)))), 25758#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)), 25759#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem34.base|) 0)), 25760#(or (not (= 0 main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 25761#(or (not (= 0 main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 25762#(or (= 0 |main_#t~mem34.offset|) (not (= main_~item~0.offset 0))), 25763#(or (= 0 main_~head~0.offset) (not (= main_~item~0.offset 0))), 25764#(= 0 main_~head~0.offset), 25765#(= main_~item~0.offset 0)] [2018-02-02 10:28:06,971 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:06,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:28:06,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:28:06,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:28:06,971 INFO L87 Difference]: Start difference. First operand 268 states and 285 transitions. Second operand 27 states. [2018-02-02 10:28:08,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:08,358 INFO L93 Difference]: Finished difference Result 276 states and 290 transitions. [2018-02-02 10:28:08,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 10:28:08,358 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 94 [2018-02-02 10:28:08,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:08,359 INFO L225 Difference]: With dead ends: 276 [2018-02-02 10:28:08,359 INFO L226 Difference]: Without dead ends: 276 [2018-02-02 10:28:08,359 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=483, Invalid=2379, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 10:28:08,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-02-02 10:28:08,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 268. [2018-02-02 10:28:08,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-02-02 10:28:08,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 285 transitions. [2018-02-02 10:28:08,361 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 285 transitions. Word has length 94 [2018-02-02 10:28:08,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:08,361 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 285 transitions. [2018-02-02 10:28:08,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:28:08,361 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 285 transitions. [2018-02-02 10:28:08,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 10:28:08,362 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:08,362 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:08,362 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:08,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1264604632, now seen corresponding path program 1 times [2018-02-02 10:28:08,363 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:08,370 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:08,866 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:08,866 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:08,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:28:08,866 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:08,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:08,867 INFO L182 omatonBuilderFactory]: Interpolants [26368#(and (= main_~head~0.offset main_~item~0.offset) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~malloc5.base|))), 26369#(and (= main_~head~0.offset main_~item~0.offset) (= 1 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base)), 26370#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~mem7.base|))), 26371#(and (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1)), 26372#(and (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 26373#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 26374#(or (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base)) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~head~0.base))) (= main_~status~0 0)), 26375#(or (and (not (= main_~head~0.base |main_#t~malloc5.base|)) (= 1 (select |#valid| |main_#t~malloc5.base|)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base |main_#t~malloc5.base|))) (= main_~status~0 0)), 26376#(or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~item~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))))), 26377#(or (= main_~status~0 0) (and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~item~0.base) main_~item~0.offset))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~item~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.offset)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~item~0.base) main_~item~0.offset))) (not (= main_~item~0.base |main_#t~mem7.base|)))), 26378#(or (= main_~status~0 0) (and (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))), 26379#(or (= main_~status~0 0) (and (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)))))), 26380#(and (not (= main_~item~0.base main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 26381#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 26382#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 26383#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem28.base|) |main_#t~mem28.offset|))), 26384#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))), 26385#(= 1 (select |#valid| |main_#t~mem33.base|)), 26386#(= 1 (select |#valid| main_~item~0.base)), 26364#true, 26365#false, 26366#(= (select |#valid| main_~head~0.base) 1), 26367#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base))] [2018-02-02 10:28:08,867 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:08,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:28:08,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:28:08,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:28:08,867 INFO L87 Difference]: Start difference. First operand 268 states and 285 transitions. Second operand 23 states. [2018-02-02 10:28:10,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:10,059 INFO L93 Difference]: Finished difference Result 286 states and 301 transitions. [2018-02-02 10:28:10,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:28:10,059 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 94 [2018-02-02 10:28:10,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:10,060 INFO L225 Difference]: With dead ends: 286 [2018-02-02 10:28:10,060 INFO L226 Difference]: Without dead ends: 286 [2018-02-02 10:28:10,060 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=378, Invalid=1878, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 10:28:10,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-02-02 10:28:10,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 276. [2018-02-02 10:28:10,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-02-02 10:28:10,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 296 transitions. [2018-02-02 10:28:10,062 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 296 transitions. Word has length 94 [2018-02-02 10:28:10,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:10,062 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 296 transitions. [2018-02-02 10:28:10,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:28:10,062 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 296 transitions. [2018-02-02 10:28:10,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 10:28:10,063 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:10,063 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:10,063 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:10,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1264604631, now seen corresponding path program 1 times [2018-02-02 10:28:10,064 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:10,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:10,631 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:10,631 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:10,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:28:10,631 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:10,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:10,632 INFO L182 omatonBuilderFactory]: Interpolants [27008#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 27009#(or (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base)) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~head~0.base))) (= main_~status~0 0)), 27010#(or (= main_~status~0 0) (and (= 0 |main_#t~malloc5.offset|) (not (= main_~head~0.base |main_#t~malloc5.base|)) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base |main_#t~malloc5.base|)))), 27011#(or (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~item~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))) (= main_~status~0 0)), 27012#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.offset)) main_~head~0.base) main_~head~0.offset))) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~item~0.base) main_~item~0.offset))) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~item~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.offset)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~item~0.base) main_~item~0.offset))) (not (= main_~item~0.base |main_#t~mem7.base|))) (= main_~status~0 0)), 27013#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|))) (= main_~status~0 0)), 27014#(or (and (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base))) (= main_~status~0 0)), 27015#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= main_~item~0.base main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 27016#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 27017#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 27018#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem28.base|) |main_#t~mem28.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem28.base|) |main_#t~mem28.offset|))), 27019#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))), 27020#(and (= 0 |main_#t~mem33.offset|) (= 12 (select |#length| |main_#t~mem33.base|))), 27021#(and (= (select |#length| main_~item~0.base) 12) (= main_~item~0.offset 0)), 26999#true, 27000#false, 27001#(= (select |#valid| main_~head~0.base) 1), 27002#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 27003#(and (= main_~head~0.offset main_~item~0.offset) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~malloc5.base|))), 27004#(and (= main_~head~0.offset main_~item~0.offset) (= 1 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base)), 27005#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~mem7.base|))), 27006#(and (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1)), 27007#(and (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1))] [2018-02-02 10:28:10,632 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:10,632 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:28:10,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:28:10,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:28:10,632 INFO L87 Difference]: Start difference. First operand 276 states and 296 transitions. Second operand 23 states. [2018-02-02 10:28:11,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:11,883 INFO L93 Difference]: Finished difference Result 289 states and 305 transitions. [2018-02-02 10:28:11,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:28:11,883 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 94 [2018-02-02 10:28:11,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:11,884 INFO L225 Difference]: With dead ends: 289 [2018-02-02 10:28:11,884 INFO L226 Difference]: Without dead ends: 289 [2018-02-02 10:28:11,884 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=268, Invalid=1624, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:28:11,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-02-02 10:28:11,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 280. [2018-02-02 10:28:11,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-02-02 10:28:11,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 299 transitions. [2018-02-02 10:28:11,886 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 299 transitions. Word has length 94 [2018-02-02 10:28:11,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:11,887 INFO L432 AbstractCegarLoop]: Abstraction has 280 states and 299 transitions. [2018-02-02 10:28:11,887 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:28:11,887 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 299 transitions. [2018-02-02 10:28:11,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-02 10:28:11,887 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:11,887 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:11,887 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:11,887 INFO L82 PathProgramCache]: Analyzing trace with hash 2080805179, now seen corresponding path program 3 times [2018-02-02 10:28:11,888 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:11,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:12,699 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:12,699 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:12,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 10:28:12,699 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:12,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:12,700 INFO L182 omatonBuilderFactory]: Interpolants [27648#(or (= main_~status~0 0) (and (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~item~0.base main_~head~0.base)) (= main_~item~0.offset 0))), 27649#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~item~0.base main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~item~0.offset 0)) (= main_~status~0 0)), 27650#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~item~0.base main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~item~0.offset 0)), 27651#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= main_~item~0.offset 0)), 27652#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) 0))), 27653#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) 0)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) 0)) 0))), 27654#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem34.base|) 0)) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem34.base|) 0)) 0))), 27655#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.offset 0))), 27656#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~item~0.offset 0))), 27657#(or (not (= main_~item~0.offset 0)) (and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem34.base|) 0)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem34.base|) 0)))), 27658#(or (not (= 0 main_~head~0.offset)) (not (= main_~item~0.offset 0)) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 27659#(or (not (= 0 main_~head~0.offset)) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 27660#(or (not (= 0 main_~item~0.offset)) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 27661#(or (not (= 0 main_~item~0.offset)) (and (= 0 |main_#t~mem34.base|) (= 0 |main_#t~mem34.offset|))), 27662#(or (not (= 0 main_~item~0.offset)) (and (= 0 main_~head~0.base) (= main_~head~0.offset 0))), 27663#(and (= 0 main_~head~0.base) (= main_~head~0.offset 0)), 27633#true, 27634#false, 27635#(= (select |#valid| main_~head~0.base) 1), 27636#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 27637#(and (= |main_#t~malloc5.offset| 0) (= main_~head~0.offset main_~item~0.offset) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~malloc5.base|))), 27638#(and (= main_~head~0.offset main_~item~0.offset) (= 1 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base) (= (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset) 0)), 27639#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base main_~head~0.base) (= (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset) 0) (not (= main_~item~0.base |main_#t~mem7.base|))), 27640#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.offset| 0) (= (select |#valid| main_~head~0.base) 1)), 27641#(and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~item~0.offset 0)), 27642#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~item~0.offset 0)), 27643#(or (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base)) (= main_~item~0.offset 0)) (= main_~status~0 0)), 27644#(or (= main_~status~0 0) (and (= 0 |main_#t~malloc5.offset|) (not (= main_~head~0.base |main_#t~malloc5.base|)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base |main_#t~malloc5.base|)) (= main_~item~0.offset 0))), 27645#(or (= main_~status~0 0) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.offset 0) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))))), 27646#(or (= main_~status~0 0) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~item~0.base) main_~item~0.offset))) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~item~0.base) main_~item~0.offset))) (not (= main_~item~0.base |main_#t~mem7.base|)) (= main_~item~0.offset 0))), 27647#(or (= main_~status~0 0) (and (= 0 |main_#t~mem9.offset|) (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))))] [2018-02-02 10:28:12,700 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:12,700 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 10:28:12,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 10:28:12,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=851, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:28:12,700 INFO L87 Difference]: Start difference. First operand 280 states and 299 transitions. Second operand 31 states. [2018-02-02 10:28:14,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:14,064 INFO L93 Difference]: Finished difference Result 287 states and 303 transitions. [2018-02-02 10:28:14,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:28:14,064 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 97 [2018-02-02 10:28:14,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:14,065 INFO L225 Difference]: With dead ends: 287 [2018-02-02 10:28:14,065 INFO L226 Difference]: Without dead ends: 287 [2018-02-02 10:28:14,065 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=342, Invalid=2738, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 10:28:14,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-02-02 10:28:14,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 277. [2018-02-02 10:28:14,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-02-02 10:28:14,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 296 transitions. [2018-02-02 10:28:14,067 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 296 transitions. Word has length 97 [2018-02-02 10:28:14,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:14,067 INFO L432 AbstractCegarLoop]: Abstraction has 277 states and 296 transitions. [2018-02-02 10:28:14,068 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 10:28:14,068 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 296 transitions. [2018-02-02 10:28:14,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-02-02 10:28:14,068 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:14,068 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:14,069 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:14,069 INFO L82 PathProgramCache]: Analyzing trace with hash 80449899, now seen corresponding path program 3 times [2018-02-02 10:28:14,069 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:14,084 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:15,920 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:15,920 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:15,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 10:28:15,921 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:15,921 INFO L182 omatonBuilderFactory]: Interpolants [28288#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem9.offset| 0) (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base)) (= (store (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) |old(#valid)|)), 28289#(and (= |old(#valid)| (store (store |#valid| main_~head~0.base 0) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset) 0)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base)) (= main_~item~0.offset 0)), 28290#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base)) (= (store (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) |old(#valid)|) (= main_~item~0.offset 0)), 28291#(or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base)) (not (= 0 main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base)) (= (store (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) |old(#valid)|) (= main_~item~0.offset 0))), 28292#(or (and (= |old(#valid)| (store (store (store |#valid| |main_#t~malloc5.base| 0) main_~head~0.base 0) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset) 0)) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= 0 main_~head~0.base)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base |main_#t~malloc5.base|)) (= main_~item~0.offset 0) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)))) (= main_~status~0 0)), 28293#(or (and (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset) 0) main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) |old(#valid)|) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base)) (= main_~item~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~item~0.base) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))) (= main_~status~0 0)), 28294#(or (and (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~head~0.base) main_~head~0.offset))) (= (store (store (store |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~item~0.base) main_~item~0.offset) 0) main_~head~0.base 0) (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~head~0.base) main_~head~0.offset) 0) |old(#valid)|) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= 0 main_~head~0.base)) (not (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~head~0.base) main_~head~0.offset) (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~item~0.base) 0))) (not (= main_~item~0.base |main_#t~mem7.base|)) (= main_~item~0.offset 0) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~item~0.base) 0)))) (= main_~status~0 0)), 28295#(or (= main_~status~0 0) (and (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) 0) main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|)) (not (= 0 main_~head~0.base)))), 28296#(or (= main_~status~0 0) (and (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~item~0.base main_~head~0.base)) (not (= 0 main_~head~0.base)) (= (store (store (store |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0) 0) main_~head~0.base 0) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset) 0) |old(#valid)|) (not (= (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0))))), 28297#(and (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) 0) main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base))), 28298#(and (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) 0) main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base))), 28299#(and (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) 0) main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= 0 main_~head~0.base)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 28300#(and (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) 0) main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) |old(#valid)|) (or (not (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base))), 28301#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (or (not (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base)) (= |old(#valid)| (store (store (store |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) 0) 0) main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0))), 28302#(and (= (store (store (store |#valid| main_~item~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) 0) |old(#valid)|) (or (not (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~item~0.base))), 28303#(and (not (= main_~item~0.base |main_#t~mem34.base|)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem34.base|) 0))) (= (store (store (store |#valid| main_~item~0.base 0) |main_#t~mem34.base| 0) (select (select |#memory_$Pointer$.base| |main_#t~mem34.base|) 0) 0) |old(#valid)|) (not (= 0 main_~item~0.base)) (not (= |main_#t~mem34.base| (select (select |#memory_$Pointer$.base| |main_#t~mem34.base|) 0))) (or (not (= |main_#t~mem34.offset| 0)) (not (= 0 |main_#t~mem34.base|)))), 28304#(and (or (not (= 0 main_~head~0.base)) (not (= main_~head~0.offset 0))) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) 0))) (or (= (store (store (store |#valid| main_~item~0.base 0) main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) |old(#valid)|) (not (= main_~head~0.offset 0))) (not (= main_~item~0.base main_~head~0.base)) (not (= 0 main_~item~0.base))), 28305#(and (or (not (= 0 main_~head~0.base)) (not (= main_~head~0.offset 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) 0))) (or (= (store (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) |old(#valid)|) (not (= main_~head~0.offset 0)))), 28306#(and (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) 0))) (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base))) (= main_~head~0.offset main_~item~0.offset) (or (not (= main_~item~0.offset 0)) (= (store (store |#valid| main_~item~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) |old(#valid)|))), 28307#(and (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base))) (or (not (= main_~item~0.offset 0)) (= |old(#valid)| (store (store |#valid| main_~item~0.base 0) |main_#t~mem34.base| 0))) (or (not (= main_~item~0.base |main_#t~mem34.base|)) (not (= main_~item~0.offset 0)))), 28308#(and (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base))) (or (not (= main_~item~0.offset 0)) (= (store (store |#valid| main_~item~0.base 0) main_~head~0.base 0) |old(#valid)|)) (or (not (= main_~item~0.offset 0)) (not (= main_~item~0.base main_~head~0.base)))), 28309#(= (store |#valid| main_~head~0.base 0) |old(#valid)|), 28310#(and (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base))) (= (store |#valid| main_~item~0.base 0) |old(#valid)|)), 28278#true, 28279#false, 28280#(= |#valid| |old(#valid)|), 28281#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|))), 28282#(and (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|)), 28283#(and (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|)), 28284#(and (= main_~item~0.offset main_~head~0.offset) (= (select |#valid| main_~item~0.base) 1) (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|) (= main_~item~0.base main_~head~0.base)), 28285#(and (= |main_#t~malloc5.offset| 0) (= main_~head~0.offset main_~item~0.offset) (not (= 0 main_~head~0.base)) (= (store (store |#valid| main_~head~0.base 0) |main_#t~malloc5.base| 0) |old(#valid)|) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~malloc5.base|))), 28286#(and (= main_~head~0.offset main_~item~0.offset) (= 1 (select |#valid| main_~item~0.base)) (= (store (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~head~0.offset) 0) |old(#valid)|) (not (= 0 main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base) (= (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset) 0)), 28287#(and (= main_~item~0.offset main_~head~0.offset) (= |old(#valid)| (store (store |#valid| main_~head~0.base 0) (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~item~0.base) main_~head~0.offset) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= (select |#valid| main_~item~0.base) 1) (= main_~head~0.base main_~item~0.base) (not (= 0 main_~head~0.base)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (not (= main_~item~0.base |main_#t~mem7.base|)))] [2018-02-02 10:28:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:15,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 10:28:15,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 10:28:15,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=978, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:28:15,922 INFO L87 Difference]: Start difference. First operand 277 states and 296 transitions. Second operand 33 states. [2018-02-02 10:28:17,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:17,883 INFO L93 Difference]: Finished difference Result 289 states and 304 transitions. [2018-02-02 10:28:17,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 10:28:17,883 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 98 [2018-02-02 10:28:17,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:17,884 INFO L225 Difference]: With dead ends: 289 [2018-02-02 10:28:17,884 INFO L226 Difference]: Without dead ends: 269 [2018-02-02 10:28:17,884 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=286, Invalid=3136, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 10:28:17,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-02 10:28:17,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2018-02-02 10:28:17,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-02-02 10:28:17,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 280 transitions. [2018-02-02 10:28:17,886 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 280 transitions. Word has length 98 [2018-02-02 10:28:17,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:17,886 INFO L432 AbstractCegarLoop]: Abstraction has 266 states and 280 transitions. [2018-02-02 10:28:17,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 10:28:17,887 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 280 transitions. [2018-02-02 10:28:17,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-02-02 10:28:17,887 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:17,887 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:17,887 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:17,887 INFO L82 PathProgramCache]: Analyzing trace with hash 731616349, now seen corresponding path program 1 times [2018-02-02 10:28:17,888 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:17,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:17,929 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-02-02 10:28:17,930 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:28:17,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:28:17,930 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:17,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:17,930 INFO L182 omatonBuilderFactory]: Interpolants [28918#true, 28919#false, 28920#(= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)), 28921#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 28922#(= 1 (select |#valid| |main_#t~mem21.base|))] [2018-02-02 10:28:17,930 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-02-02 10:28:17,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:28:17,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:28:17,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:28:17,930 INFO L87 Difference]: Start difference. First operand 266 states and 280 transitions. Second operand 5 states. [2018-02-02 10:28:17,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:17,998 INFO L93 Difference]: Finished difference Result 268 states and 279 transitions. [2018-02-02 10:28:17,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:28:17,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-02-02 10:28:17,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:17,999 INFO L225 Difference]: With dead ends: 268 [2018-02-02 10:28:17,999 INFO L226 Difference]: Without dead ends: 268 [2018-02-02 10:28:17,999 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:28:17,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-02-02 10:28:18,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 265. [2018-02-02 10:28:18,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-02-02 10:28:18,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 279 transitions. [2018-02-02 10:28:18,001 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 279 transitions. Word has length 98 [2018-02-02 10:28:18,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:18,001 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 279 transitions. [2018-02-02 10:28:18,001 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:28:18,001 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 279 transitions. [2018-02-02 10:28:18,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-02-02 10:28:18,001 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:18,002 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:18,002 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:18,002 INFO L82 PathProgramCache]: Analyzing trace with hash 731616350, now seen corresponding path program 1 times [2018-02-02 10:28:18,002 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:18,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:18,054 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-02-02 10:28:18,054 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:28:18,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:28:18,054 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:18,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:18,054 INFO L182 omatonBuilderFactory]: Interpolants [29460#true, 29461#false, 29462#(and (= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem19.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 29463#(and (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 29464#(and (<= 0 |main_#t~mem21.offset|) (<= (+ |main_#t~mem21.offset| 4) (select |#length| |main_#t~mem21.base|)))] [2018-02-02 10:28:18,055 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-02-02 10:28:18,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:28:18,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:28:18,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:28:18,055 INFO L87 Difference]: Start difference. First operand 265 states and 279 transitions. Second operand 5 states. [2018-02-02 10:28:18,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:18,141 INFO L93 Difference]: Finished difference Result 267 states and 278 transitions. [2018-02-02 10:28:18,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:28:18,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-02-02 10:28:18,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:18,142 INFO L225 Difference]: With dead ends: 267 [2018-02-02 10:28:18,142 INFO L226 Difference]: Without dead ends: 267 [2018-02-02 10:28:18,142 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:28:18,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-02-02 10:28:18,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 264. [2018-02-02 10:28:18,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-02-02 10:28:18,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 278 transitions. [2018-02-02 10:28:18,145 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 278 transitions. Word has length 98 [2018-02-02 10:28:18,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:18,145 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 278 transitions. [2018-02-02 10:28:18,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:28:18,145 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 278 transitions. [2018-02-02 10:28:18,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-02 10:28:18,146 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:18,146 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:18,146 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr60EnsuresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:18,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1205270616, now seen corresponding path program 1 times [2018-02-02 10:28:18,146 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:18,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:19,626 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:19,626 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:19,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-02 10:28:19,626 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:19,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:19,627 INFO L182 omatonBuilderFactory]: Interpolants [30016#(or (and (= 12 (select |#length| main_~head~0.base)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~item~0.base)) (= 12 (select |#length| main_~item~0.base)) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~status~0 (select |#valid| main_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))) (= main_~status~0 0)), 30017#(or (and (= 12 (select |#length| main_~head~0.base)) (= main_~status~0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|)) (= main_~status~0 (select |#valid| main_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0)) (= main_~status~0 0)), 30018#(or (= main_~status~0 0) (and (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| main_~head~0.base)) (= main_~status~0 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset) 0) (not (= main_~item~0.base main_~head~0.base)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~status~0 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0))), 30019#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| main_~head~0.base)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select |#valid| main_~head~0.base) 0)) (not (= main_~item~0.base main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0)), 30020#(and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.base|)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| main_~head~0.base)) (not (= main_~head~0.base |main_#t~malloc5.base|)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset))) (= (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0) (not (= (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc5.base|))), 30021#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| main_~head~0.base)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= 1 (select |#valid| main_~item~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))), 30022#(and (= 12 (select |#length| main_~head~0.base)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.offset)) main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| main_~item~0.base)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~head~0.base) main_~head~0.offset))) (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.offset)) main_~head~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0)), 30023#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| main_~head~0.base)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| main_~item~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0)), 30024#(and (= 12 (select |#length| main_~head~0.base)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 30025#(or (and (or (and (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (and (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)))))) (not (= main_~item~0.base main_~head~0.base))) (and (= (select |#length| main_~item~0.base) 12) (or (and (= main_~item~0.offset main_~head~0.offset) (= main_~item~0.base main_~head~0.base)) (<= 1 main_~item~0.offset))) (<= (+ main_~item~0.offset 1) 0)), 30026#(or (and (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))) (not (= main_~item~0.base main_~head~0.base))) (and (= (select |#length| main_~item~0.base) 12) (or (and (= main_~item~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base main_~head~0.base)) (<= 1 main_~item~0.offset)))), 30027#(or (and (= (select |#length| main_~item~0.base) 12) (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 30028#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 30029#(or (and (= |main_#t~mem18.base| 0) (= 0 |main_#t~mem18.offset|)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 30030#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 30031#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem19.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (and (= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))), 30032#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem20.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 30033#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 30034#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) |main_#t~mem21.offset|))), 30035#(= 1 (select |#valid| |main_#t~mem22.base|)), 30000#true, 30001#false, 30002#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 30003#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base))), 30004#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 30005#(and (= 12 (select |#length| main_~head~0.base)) (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base) (= main_~item~0.offset 0)), 30006#(and (= 12 (select |#length| main_~head~0.base)) (= main_~head~0.offset main_~item~0.offset) (= |main_#t~malloc5.offset| main_~item~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~malloc5.base|)) (= main_~item~0.offset 0)), 30007#(and (= main_~item~0.offset main_~head~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~head~0.offset) main_~item~0.offset) (= 12 (select |#length| main_~head~0.base)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= 1 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base) (= main_~item~0.offset 0)), 30008#(and (= main_~item~0.offset main_~head~0.offset) (= 12 (select |#length| |main_#t~mem7.base|)) (= (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~head~0.offset) main_~item~0.offset) (= 12 (select |#length| main_~head~0.base)) (= (select |#valid| main_~item~0.base) 1) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base main_~head~0.base) (not (= main_~item~0.base |main_#t~mem7.base|)) (= main_~item~0.offset 0)), 30009#(and (= 12 (select |#length| main_~head~0.base)) (= 12 (select |#length| |main_#t~mem9.base|)) (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0)), 30010#(and (= 12 (select |#length| main_~head~0.base)) (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset) 0) (= 12 (select |#length| main_~item~0.base)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 30011#(and (= 12 (select |#length| main_~head~0.base)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~item~0.base)) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0)), 30012#(or (= main_~status~0 0) (and (= 12 (select |#length| main_~head~0.base)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 1) (= main_~status~0 (select |#valid| main_~item~0.base)) (= 12 (select |#length| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base)) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0))), 30013#(or (= main_~status~0 0) (and (= 12 (select |#length| main_~head~0.base)) (not (= main_~head~0.base |main_#t~malloc5.base|)) (= main_~status~0 1) (= 12 (select |#length| main_~item~0.base)) (= (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset) 0) (= main_~status~0 (select |#valid| main_~head~0.base)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0) (not (= main_~item~0.base |main_#t~malloc5.base|)))), 30014#(or (and (= 12 (select |#length| main_~head~0.base)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~item~0.base)) (= 12 (select |#length| main_~item~0.base)) (= 1 (select |#valid| main_~item~0.base)) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~status~0 (select |#valid| main_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))) (= main_~status~0 0)), 30015#(or (and (= 12 (select |#length| main_~head~0.base)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~item~0.base)) (= 12 (select |#length| main_~item~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.base)) main_~item~0.base) main_~item~0.offset))) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~status~0 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0) (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.offset)) main_~head~0.base) main_~head~0.offset) 0) (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~item~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base |main_#t~mem7.base|))) (= main_~status~0 0))] [2018-02-02 10:28:19,627 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:19,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 10:28:19,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 10:28:19,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1119, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:28:19,628 INFO L87 Difference]: Start difference. First operand 264 states and 278 transitions. Second operand 36 states. Received shutdown request... [2018-02-02 10:28:20,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:28:20,816 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:28:20,820 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:28:20,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:28:20 BoogieIcfgContainer [2018-02-02 10:28:20,820 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:28:20,821 INFO L168 Benchmark]: Toolchain (without parser) took 50901.81 ms. Allocated memory was 400.0 MB in the beginning and 1.3 GB in the end (delta: 936.4 MB). Free memory was 356.9 MB in the beginning and 681.0 MB in the end (delta: -324.1 MB). Peak memory consumption was 612.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:28:20,822 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 400.0 MB. Free memory is still 363.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:28:20,822 INFO L168 Benchmark]: CACSL2BoogieTranslator took 173.25 ms. Allocated memory is still 400.0 MB. Free memory was 356.9 MB in the beginning and 345.0 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:28:20,822 INFO L168 Benchmark]: Boogie Preprocessor took 34.30 ms. Allocated memory is still 400.0 MB. Free memory was 345.0 MB in the beginning and 342.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:28:20,823 INFO L168 Benchmark]: RCFGBuilder took 446.37 ms. Allocated memory is still 400.0 MB. Free memory was 342.4 MB in the beginning and 299.1 MB in the end (delta: 43.2 MB). Peak memory consumption was 43.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:28:20,823 INFO L168 Benchmark]: TraceAbstraction took 50245.15 ms. Allocated memory was 400.0 MB in the beginning and 1.3 GB in the end (delta: 936.4 MB). Free memory was 297.8 MB in the beginning and 681.0 MB in the end (delta: -383.2 MB). Peak memory consumption was 553.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:28:20,823 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.11 ms. Allocated memory is still 400.0 MB. Free memory is still 363.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 173.25 ms. Allocated memory is still 400.0 MB. Free memory was 356.9 MB in the beginning and 345.0 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.30 ms. Allocated memory is still 400.0 MB. Free memory was 345.0 MB in the beginning and 342.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 446.37 ms. Allocated memory is still 400.0 MB. Free memory was 342.4 MB in the beginning and 299.1 MB in the end (delta: 43.2 MB). Peak memory consumption was 43.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 50245.15 ms. Allocated memory was 400.0 MB in the beginning and 1.3 GB in the end (delta: 936.4 MB). Free memory was 297.8 MB in the beginning and 681.0 MB in the end (delta: -383.2 MB). Peak memory consumption was 553.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1045). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1045). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1052). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1052). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 983]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 983). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (264states) and interpolant automaton (currently 17 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 172 locations, 61 error locations. TIMEOUT Result, 50.1s OverallTime, 49 OverallIterations, 4 TraceHistogramMax, 33.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5461 SDtfs, 19057 SDslu, 33183 SDs, 0 SdLazy, 30630 SolverSat, 2790 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1382 GetRequests, 106 SyntacticMatches, 39 SemanticMatches, 1236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12880 ImplicationChecksByTransitivity, 30.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=629occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 371/1026 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 48 MinimizatonAttempts, 1487 StatesRemovedByMinimization, 45 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 3159 NumberOfCodeBlocks, 3159 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 3110 ConstructedInterpolants, 0 QuantifiedInterpolants, 4268994 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 49 InterpolantComputations, 20 PerfectInterpolantSequences, 371/1026 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-queue_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-28-20-829.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-queue_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-28-20-829.csv Completed graceful shutdown