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/list-ext-properties/test-0513_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:09:53,280 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:09:53,281 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:09:53,292 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:09:53,292 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:09:53,292 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:09:53,293 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:09:53,294 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:09:53,295 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:09:53,296 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:09:53,297 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:09:53,297 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:09:53,298 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:09:53,299 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:09:53,300 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:09:53,301 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:09:53,303 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:09:53,305 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:09:53,306 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:09:53,307 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:09:53,308 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:09:53,309 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:09:53,309 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:09:53,310 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:09:53,311 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:09:53,311 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:09:53,312 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:09:53,312 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:09:53,313 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:09:53,313 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:09:53,313 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:09:53,314 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:09:53,324 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:09:53,324 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:09:53,325 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:09:53,325 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:09:53,326 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:09:53,326 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:09:53,326 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:09:53,326 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:09:53,326 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:09:53,327 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:09:53,327 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:09:53,327 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:09:53,327 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:09:53,327 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:09:53,327 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:09:53,328 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:09:53,328 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:09:53,328 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:09:53,328 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:09:53,328 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:09:53,328 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:09:53,329 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:09:53,329 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:09:53,360 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:09:53,371 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:09:53,374 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:09:53,376 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:09:53,376 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:09:53,377 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0513_1_true-valid-memsafety.i [2018-02-02 10:09:53,524 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:09:53,525 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:09:53,526 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:09:53,526 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:09:53,532 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:09:53,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:09:53" (1/1) ... [2018-02-02 10:09:53,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4817ffc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:09:53, skipping insertion in model container [2018-02-02 10:09:53,534 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:09:53" (1/1) ... [2018-02-02 10:09:53,547 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:09:53,576 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:09:53,670 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:09:53,687 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:09:53,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:09:53 WrapperNode [2018-02-02 10:09:53,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:09:53,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:09:53,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:09:53,696 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:09:53,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:09:53" (1/1) ... [2018-02-02 10:09:53,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:09:53" (1/1) ... [2018-02-02 10:09:53,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:09:53" (1/1) ... [2018-02-02 10:09:53,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:09:53" (1/1) ... [2018-02-02 10:09:53,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:09:53" (1/1) ... [2018-02-02 10:09:53,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:09:53" (1/1) ... [2018-02-02 10:09:53,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:09:53" (1/1) ... [2018-02-02 10:09:53,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:09:53,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:09:53,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:09:53,724 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:09:53,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:09:53" (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:09:53,759 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:09:53,759 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:09:53,759 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:09:53,759 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:09:53,759 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:09:53,760 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:09:53,760 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:09:53,760 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:09:53,760 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:09:53,760 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:09:53,760 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:09:53,760 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:09:53,760 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-02 10:09:53,760 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:09:53,760 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:09:53,760 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:09:53,760 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:09:54,132 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:09:54,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:09:54 BoogieIcfgContainer [2018-02-02 10:09:54,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:09:54,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:09:54,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:09:54,136 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:09:54,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:09:53" (1/3) ... [2018-02-02 10:09:54,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d7f5f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:09:54, skipping insertion in model container [2018-02-02 10:09:54,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:09:53" (2/3) ... [2018-02-02 10:09:54,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d7f5f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:09:54, skipping insertion in model container [2018-02-02 10:09:54,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:09:54" (3/3) ... [2018-02-02 10:09:54,138 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0513_1_true-valid-memsafety.i [2018-02-02 10:09:54,144 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:09:54,150 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-02-02 10:09:54,173 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:09:54,174 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:09:54,174 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:09:54,174 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:09:54,174 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:09:54,174 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:09:54,174 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:09:54,174 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:09:54,175 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:09:54,186 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2018-02-02 10:09:54,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-02 10:09:54,193 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:54,194 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:54,194 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:09:54,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1366809009, now seen corresponding path program 1 times [2018-02-02 10:09:54,231 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:54,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:54,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:09:54,281 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:54,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:09:54,281 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:54,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:54,282 INFO L182 omatonBuilderFactory]: Interpolants [158#true, 159#false] [2018-02-02 10:09:54,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:54,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-02 10:09:54,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-02 10:09:54,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 10:09:54,293 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 2 states. [2018-02-02 10:09:54,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:54,386 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2018-02-02 10:09:54,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 10:09:54,387 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-02-02 10:09:54,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:54,394 INFO L225 Difference]: With dead ends: 155 [2018-02-02 10:09:54,394 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 10:09:54,396 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 10:09:54,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 10:09:54,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-02-02 10:09:54,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 10:09:54,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2018-02-02 10:09:54,426 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 9 [2018-02-02 10:09:54,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:54,427 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2018-02-02 10:09:54,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-02 10:09:54,427 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2018-02-02 10:09:54,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 10:09:54,427 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:54,427 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:54,427 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:09:54,428 INFO L82 PathProgramCache]: Analyzing trace with hash -26359990, now seen corresponding path program 1 times [2018-02-02 10:09:54,429 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:54,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:54,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:54,484 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:54,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:09:54,484 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:54,485 INFO L182 omatonBuilderFactory]: Interpolants [467#true, 468#false, 469#(= |#valid| |old(#valid)|)] [2018-02-02 10:09:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:54,486 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:09:54,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:09:54,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:09:54,487 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand 3 states. [2018-02-02 10:09:54,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:54,632 INFO L93 Difference]: Finished difference Result 196 states and 213 transitions. [2018-02-02 10:09:54,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:09:54,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-02 10:09:54,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:54,635 INFO L225 Difference]: With dead ends: 196 [2018-02-02 10:09:54,635 INFO L226 Difference]: Without dead ends: 195 [2018-02-02 10:09:54,636 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:09:54,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-02 10:09:54,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 157. [2018-02-02 10:09:54,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-02 10:09:54,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 173 transitions. [2018-02-02 10:09:54,645 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 173 transitions. Word has length 12 [2018-02-02 10:09:54,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:54,645 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 173 transitions. [2018-02-02 10:09:54,645 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:09:54,646 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 173 transitions. [2018-02-02 10:09:54,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 10:09:54,646 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:54,646 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:54,646 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:09:54,646 INFO L82 PathProgramCache]: Analyzing trace with hash -817163438, now seen corresponding path program 1 times [2018-02-02 10:09:54,647 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:54,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:54,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:54,682 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:54,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:09:54,682 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:54,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:54,683 INFO L182 omatonBuilderFactory]: Interpolants [823#true, 824#false, 825#(and (= main_~data~0.offset 0) (= main_~data~0.base 0))] [2018-02-02 10:09:54,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:54,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:09:54,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:09:54,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:09:54,684 INFO L87 Difference]: Start difference. First operand 157 states and 173 transitions. Second operand 3 states. [2018-02-02 10:09:54,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:54,728 INFO L93 Difference]: Finished difference Result 180 states and 197 transitions. [2018-02-02 10:09:54,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:09:54,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-02-02 10:09:54,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:54,729 INFO L225 Difference]: With dead ends: 180 [2018-02-02 10:09:54,729 INFO L226 Difference]: Without dead ends: 179 [2018-02-02 10:09:54,730 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:09:54,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-02 10:09:54,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 169. [2018-02-02 10:09:54,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-02 10:09:54,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 195 transitions. [2018-02-02 10:09:54,737 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 195 transitions. Word has length 13 [2018-02-02 10:09:54,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:54,737 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 195 transitions. [2018-02-02 10:09:54,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:09:54,738 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 195 transitions. [2018-02-02 10:09:54,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:09:54,738 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:54,738 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:54,738 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:09:54,739 INFO L82 PathProgramCache]: Analyzing trace with hash 437426512, now seen corresponding path program 1 times [2018-02-02 10:09:54,739 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:54,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:54,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:54,773 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:54,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:09:54,774 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:54,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:54,774 INFO L182 omatonBuilderFactory]: Interpolants [1175#true, 1176#false, 1177#(= 1 (select |#valid| |main_#t~malloc3.base|)), 1178#(= 1 (select |#valid| main_~item~0.base))] [2018-02-02 10:09:54,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:54,775 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:09:54,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:09:54,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:09:54,775 INFO L87 Difference]: Start difference. First operand 169 states and 195 transitions. Second operand 4 states. [2018-02-02 10:09:54,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:54,971 INFO L93 Difference]: Finished difference Result 239 states and 265 transitions. [2018-02-02 10:09:54,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:09:54,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 10:09:54,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:54,974 INFO L225 Difference]: With dead ends: 239 [2018-02-02 10:09:54,974 INFO L226 Difference]: Without dead ends: 239 [2018-02-02 10:09:54,974 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:09:54,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-02 10:09:54,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 169. [2018-02-02 10:09:54,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-02 10:09:54,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 195 transitions. [2018-02-02 10:09:54,988 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 195 transitions. Word has length 14 [2018-02-02 10:09:54,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:54,988 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 195 transitions. [2018-02-02 10:09:54,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:09:54,988 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 195 transitions. [2018-02-02 10:09:54,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:09:54,989 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:54,989 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:54,989 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:09:54,989 INFO L82 PathProgramCache]: Analyzing trace with hash 437426513, now seen corresponding path program 1 times [2018-02-02 10:09:54,990 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:55,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:55,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:55,078 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:55,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:09:55,079 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:55,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:55,079 INFO L182 omatonBuilderFactory]: Interpolants [1589#true, 1590#false, 1591#(and (= 8 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 1592#(and (= (select |#length| main_~item~0.base) 8) (= main_~item~0.offset 0))] [2018-02-02 10:09:55,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:55,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:09:55,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:09:55,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:09:55,080 INFO L87 Difference]: Start difference. First operand 169 states and 195 transitions. Second operand 4 states. [2018-02-02 10:09:55,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:55,185 INFO L93 Difference]: Finished difference Result 165 states and 187 transitions. [2018-02-02 10:09:55,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:09:55,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 10:09:55,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:55,186 INFO L225 Difference]: With dead ends: 165 [2018-02-02 10:09:55,186 INFO L226 Difference]: Without dead ends: 165 [2018-02-02 10:09:55,186 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:09:55,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-02 10:09:55,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-02-02 10:09:55,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 10:09:55,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 187 transitions. [2018-02-02 10:09:55,192 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 187 transitions. Word has length 14 [2018-02-02 10:09:55,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:55,193 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 187 transitions. [2018-02-02 10:09:55,193 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:09:55,193 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 187 transitions. [2018-02-02 10:09:55,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:09:55,193 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:55,193 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:55,194 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:09:55,194 INFO L82 PathProgramCache]: Analyzing trace with hash 809095649, now seen corresponding path program 1 times [2018-02-02 10:09:55,195 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:55,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:09:55,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:55,233 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:55,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:09:55,233 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:55,233 INFO L182 omatonBuilderFactory]: Interpolants [1925#true, 1926#false, 1927#(or (not |main_#t~short1|) (<= main_~c1~0 4)), 1928#(<= main_~c1~0 4), 1929#(<= main_~c1~0 5)] [2018-02-02 10:09:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:55,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:09:55,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:09:55,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:09:55,234 INFO L87 Difference]: Start difference. First operand 165 states and 187 transitions. Second operand 5 states. [2018-02-02 10:09:55,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:55,258 INFO L93 Difference]: Finished difference Result 306 states and 343 transitions. [2018-02-02 10:09:55,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:09:55,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-02-02 10:09:55,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:55,259 INFO L225 Difference]: With dead ends: 306 [2018-02-02 10:09:55,259 INFO L226 Difference]: Without dead ends: 306 [2018-02-02 10:09:55,260 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:09:55,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-02-02 10:09:55,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 165. [2018-02-02 10:09:55,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 10:09:55,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 185 transitions. [2018-02-02 10:09:55,263 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 185 transitions. Word has length 21 [2018-02-02 10:09:55,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:55,263 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 185 transitions. [2018-02-02 10:09:55,263 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:09:55,263 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 185 transitions. [2018-02-02 10:09:55,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:09:55,263 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:55,263 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:09:55,264 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:09:55,264 INFO L82 PathProgramCache]: Analyzing trace with hash -836569732, now seen corresponding path program 1 times [2018-02-02 10:09:55,264 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:55,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:55,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:55,310 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:55,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:09:55,311 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:55,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:55,311 INFO L182 omatonBuilderFactory]: Interpolants [2403#true, 2404#false, 2405#(= 1 (select |#valid| |main_#t~malloc8.base|)), 2406#(= 1 (select |#valid| main_~lItem~0.base))] [2018-02-02 10:09:55,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:55,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:09:55,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:09:55,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:09:55,312 INFO L87 Difference]: Start difference. First operand 165 states and 185 transitions. Second operand 4 states. [2018-02-02 10:09:55,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:55,418 INFO L93 Difference]: Finished difference Result 199 states and 219 transitions. [2018-02-02 10:09:55,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:09:55,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-02 10:09:55,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:55,419 INFO L225 Difference]: With dead ends: 199 [2018-02-02 10:09:55,419 INFO L226 Difference]: Without dead ends: 199 [2018-02-02 10:09:55,419 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:09:55,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-02-02 10:09:55,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 161. [2018-02-02 10:09:55,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-02 10:09:55,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 181 transitions. [2018-02-02 10:09:55,422 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 181 transitions. Word has length 22 [2018-02-02 10:09:55,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:55,422 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 181 transitions. [2018-02-02 10:09:55,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:09:55,423 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 181 transitions. [2018-02-02 10:09:55,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:09:55,423 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:55,423 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:09:55,423 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:09:55,424 INFO L82 PathProgramCache]: Analyzing trace with hash -836569731, now seen corresponding path program 1 times [2018-02-02 10:09:55,424 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:55,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:55,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:55,482 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:55,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:09:55,483 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:55,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:55,483 INFO L182 omatonBuilderFactory]: Interpolants [2769#true, 2770#false, 2771#(and (= 8 (select |#length| |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|)), 2772#(and (= main_~lItem~0.offset 0) (= (select |#length| main_~lItem~0.base) 8))] [2018-02-02 10:09:55,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:55,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:09:55,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:09:55,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:09:55,484 INFO L87 Difference]: Start difference. First operand 161 states and 181 transitions. Second operand 4 states. [2018-02-02 10:09:55,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:55,583 INFO L93 Difference]: Finished difference Result 158 states and 178 transitions. [2018-02-02 10:09:55,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:09:55,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-02 10:09:55,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:55,584 INFO L225 Difference]: With dead ends: 158 [2018-02-02 10:09:55,584 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 10:09:55,585 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:09:55,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 10:09:55,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-02-02 10:09:55,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 10:09:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 178 transitions. [2018-02-02 10:09:55,588 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 178 transitions. Word has length 22 [2018-02-02 10:09:55,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:55,588 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 178 transitions. [2018-02-02 10:09:55,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:09:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 178 transitions. [2018-02-02 10:09:55,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:09:55,589 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:55,589 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] [2018-02-02 10:09:55,589 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:09:55,589 INFO L82 PathProgramCache]: Analyzing trace with hash 261861212, now seen corresponding path program 1 times [2018-02-02 10:09:55,590 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:55,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:55,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:55,660 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:55,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:09:55,660 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:55,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:55,661 INFO L182 omatonBuilderFactory]: Interpolants [3091#true, 3092#false, 3093#(not (= 0 |main_#t~malloc8.base|)), 3094#(not (= 0 main_~lItem~0.base)), 3095#(not (= 0 main_~data~0.base))] [2018-02-02 10:09:55,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:55,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:09:55,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:09:55,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:09:55,662 INFO L87 Difference]: Start difference. First operand 158 states and 178 transitions. Second operand 5 states. [2018-02-02 10:09:55,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:55,729 INFO L93 Difference]: Finished difference Result 262 states and 292 transitions. [2018-02-02 10:09:55,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:09:55,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-02-02 10:09:55,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:55,730 INFO L225 Difference]: With dead ends: 262 [2018-02-02 10:09:55,730 INFO L226 Difference]: Without dead ends: 262 [2018-02-02 10:09:55,731 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:09:55,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-02-02 10:09:55,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 158. [2018-02-02 10:09:55,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 10:09:55,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 176 transitions. [2018-02-02 10:09:55,735 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 176 transitions. Word has length 31 [2018-02-02 10:09:55,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:55,735 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 176 transitions. [2018-02-02 10:09:55,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:09:55,735 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 176 transitions. [2018-02-02 10:09:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 10:09:55,736 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:55,736 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] [2018-02-02 10:09:55,736 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:09:55,736 INFO L82 PathProgramCache]: Analyzing trace with hash -472240768, now seen corresponding path program 1 times [2018-02-02 10:09:55,737 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:55,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:55,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:55,812 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:55,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:09:55,812 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:55,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:55,812 INFO L182 omatonBuilderFactory]: Interpolants [3523#true, 3524#false, 3525#(and (= 8 (select |#length| |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|)), 3526#(and (= 8 (select |#length| main_~lItem~0.base)) (= 0 main_~lItem~0.offset)), 3527#(and (= main_~data~0.offset 0) (= (select |#length| main_~data~0.base) 8))] [2018-02-02 10:09:55,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:55,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:09:55,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:09:55,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:09:55,813 INFO L87 Difference]: Start difference. First operand 158 states and 176 transitions. Second operand 5 states. [2018-02-02 10:09:55,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:55,997 INFO L93 Difference]: Finished difference Result 253 states and 282 transitions. [2018-02-02 10:09:55,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:09:55,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-02-02 10:09:55,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:55,998 INFO L225 Difference]: With dead ends: 253 [2018-02-02 10:09:55,998 INFO L226 Difference]: Without dead ends: 253 [2018-02-02 10:09:55,999 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:09:55,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-02 10:09:56,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 200. [2018-02-02 10:09:56,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-02-02 10:09:56,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 257 transitions. [2018-02-02 10:09:56,002 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 257 transitions. Word has length 32 [2018-02-02 10:09:56,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:56,002 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 257 transitions. [2018-02-02 10:09:56,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:09:56,002 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 257 transitions. [2018-02-02 10:09:56,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 10:09:56,002 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:56,003 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] [2018-02-02 10:09:56,003 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:09:56,003 INFO L82 PathProgramCache]: Analyzing trace with hash -472240769, now seen corresponding path program 1 times [2018-02-02 10:09:56,004 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:56,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:56,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:56,040 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:56,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:09:56,040 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:56,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:56,040 INFO L182 omatonBuilderFactory]: Interpolants [3988#true, 3989#false, 3990#(= (select |#valid| main_~lItem~0.base) 1), 3991#(and (= (select |#valid| main_~lItem~0.base) 1) (= main_~data~0.base main_~lItem~0.base)), 3992#(= 1 (select |#valid| main_~data~0.base))] [2018-02-02 10:09:56,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:56,040 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:09:56,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:09:56,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:09:56,041 INFO L87 Difference]: Start difference. First operand 200 states and 257 transitions. Second operand 5 states. [2018-02-02 10:09:56,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:56,153 INFO L93 Difference]: Finished difference Result 194 states and 244 transitions. [2018-02-02 10:09:56,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:09:56,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-02-02 10:09:56,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:56,154 INFO L225 Difference]: With dead ends: 194 [2018-02-02 10:09:56,154 INFO L226 Difference]: Without dead ends: 194 [2018-02-02 10:09:56,154 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:09:56,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-02-02 10:09:56,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2018-02-02 10:09:56,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-02 10:09:56,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 242 transitions. [2018-02-02 10:09:56,158 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 242 transitions. Word has length 32 [2018-02-02 10:09:56,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:56,159 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 242 transitions. [2018-02-02 10:09:56,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:09:56,159 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 242 transitions. [2018-02-02 10:09:56,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:09:56,160 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:56,160 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] [2018-02-02 10:09:56,160 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:09:56,160 INFO L82 PathProgramCache]: Analyzing trace with hash 456903790, now seen corresponding path program 1 times [2018-02-02 10:09:56,161 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:56,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:56,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:56,194 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:56,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:09:56,195 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:56,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:56,195 INFO L182 omatonBuilderFactory]: Interpolants [4384#(<= main_~c1~0 1), 4381#true, 4382#false, 4383#(= main_~c1~0 0)] [2018-02-02 10:09:56,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:56,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:09:56,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:09:56,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:09:56,196 INFO L87 Difference]: Start difference. First operand 192 states and 242 transitions. Second operand 4 states. [2018-02-02 10:09:56,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:56,218 INFO L93 Difference]: Finished difference Result 353 states and 446 transitions. [2018-02-02 10:09:56,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:09:56,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-02-02 10:09:56,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:56,220 INFO L225 Difference]: With dead ends: 353 [2018-02-02 10:09:56,220 INFO L226 Difference]: Without dead ends: 353 [2018-02-02 10:09:56,220 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:09:56,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-02-02 10:09:56,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 193. [2018-02-02 10:09:56,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-02 10:09:56,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 241 transitions. [2018-02-02 10:09:56,226 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 241 transitions. Word has length 37 [2018-02-02 10:09:56,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:56,227 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 241 transitions. [2018-02-02 10:09:56,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:09:56,227 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 241 transitions. [2018-02-02 10:09:56,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:09:56,227 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:56,227 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] [2018-02-02 10:09:56,228 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:09:56,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1168751179, now seen corresponding path program 1 times [2018-02-02 10:09:56,229 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:56,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:56,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:56,344 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:56,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:09:56,344 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:56,345 INFO L182 omatonBuilderFactory]: Interpolants [4931#true, 4932#false, 4933#(and (= main_~lItem~0.offset (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (= (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset) main_~lItem~0.base)), 4934#(and (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= main_~data~0.offset (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)), 4935#(and (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 4936#(and (= main_~data~0.base |main_#t~mem14.base|) (= |main_#t~mem14.offset| main_~data~0.offset))] [2018-02-02 10:09:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:56,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:09:56,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:09:56,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:09:56,346 INFO L87 Difference]: Start difference. First operand 193 states and 241 transitions. Second operand 6 states. [2018-02-02 10:09:56,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:56,488 INFO L93 Difference]: Finished difference Result 232 states and 284 transitions. [2018-02-02 10:09:56,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:09:56,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-02-02 10:09:56,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:56,489 INFO L225 Difference]: With dead ends: 232 [2018-02-02 10:09:56,489 INFO L226 Difference]: Without dead ends: 232 [2018-02-02 10:09:56,489 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:09:56,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-02 10:09:56,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 203. [2018-02-02 10:09:56,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-02-02 10:09:56,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 253 transitions. [2018-02-02 10:09:56,493 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 253 transitions. Word has length 39 [2018-02-02 10:09:56,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:56,494 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 253 transitions. [2018-02-02 10:09:56,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:09:56,494 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 253 transitions. [2018-02-02 10:09:56,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:09:56,494 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:56,494 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] [2018-02-02 10:09:56,495 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:09:56,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1118408649, now seen corresponding path program 1 times [2018-02-02 10:09:56,495 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:56,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:56,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:56,745 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:56,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 10:09:56,745 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:56,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:56,746 INFO L182 omatonBuilderFactory]: Interpolants [5376#(and (= 1 (select |#valid| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 5377#(and (= 1 (select |#valid| main_~item~0.base)) (= main_~item~0.offset 0)), 5378#(and (not (= 0 |main_#t~malloc8.base|)) (= 1 (select (store |#valid| |main_#t~malloc8.base| 0) main_~item~0.base)) (= 0 |main_#t~malloc8.offset|) (= main_~item~0.offset 0)), 5379#(and (= 1 (select (store |#valid| main_~lItem~0.base 0) main_~item~0.base)) (not (= 0 main_~lItem~0.base)) (= 0 main_~lItem~0.offset) (= main_~item~0.offset 0)), 5380#(and (= 1 (select (store |#valid| main_~data~0.base 0) main_~item~0.base)) (= main_~data~0.offset 0) (= main_~lItem~0.offset 0) (not (= 0 main_~data~0.base)) (= main_~item~0.offset 0) (= main_~data~0.base main_~lItem~0.base)), 5381#(and (= main_~data~0.offset 0) (not (= 0 main_~data~0.base)) (= 1 (select (store |#valid| main_~data~0.base 0) (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))))), 5382#(and (= main_~data~0.offset 0) (not (= main_~data~0.base 0)) (= 1 (select (store |#valid| main_~data~0.base 0) |main_#t~mem31.base|))), 5383#(and (= 1 (select (store |#valid| main_~data~0.base 0) main_~item~0.base)) (= main_~data~0.offset 0) (not (= main_~data~0.base 0))), 5384#(= 1 (select |#valid| main_~item~0.base)), 5374#true, 5375#false] [2018-02-02 10:09:56,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:56,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:09:56,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:09:56,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:09:56,747 INFO L87 Difference]: Start difference. First operand 203 states and 253 transitions. Second operand 11 states. [2018-02-02 10:09:57,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:57,339 INFO L93 Difference]: Finished difference Result 288 states and 344 transitions. [2018-02-02 10:09:57,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:09:57,339 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-02-02 10:09:57,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:57,340 INFO L225 Difference]: With dead ends: 288 [2018-02-02 10:09:57,340 INFO L226 Difference]: Without dead ends: 288 [2018-02-02 10:09:57,341 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:09:57,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-02-02 10:09:57,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 209. [2018-02-02 10:09:57,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 10:09:57,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 261 transitions. [2018-02-02 10:09:57,345 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 261 transitions. Word has length 41 [2018-02-02 10:09:57,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:57,346 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 261 transitions. [2018-02-02 10:09:57,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:09:57,346 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 261 transitions. [2018-02-02 10:09:57,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:09:57,346 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:57,347 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] [2018-02-02 10:09:57,347 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:09:57,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1118408648, now seen corresponding path program 1 times [2018-02-02 10:09:57,348 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:57,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:09:57,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:57,637 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:57,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 10:09:57,637 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:57,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:09:57,638 INFO L182 omatonBuilderFactory]: Interpolants [5907#true, 5908#false, 5909#(and (= 8 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 5910#(and (= (select |#length| main_~item~0.base) 8) (= main_~item~0.offset 0)), 5911#(and (<= 8 (select |#length| main_~item~0.base)) (= 0 |main_#t~malloc8.offset|) (= main_~item~0.offset 0)), 5912#(and (<= 8 (select |#length| main_~item~0.base)) (= 0 main_~lItem~0.offset) (= main_~item~0.offset 0)), 5913#(and (= main_~data~0.offset 0) (<= 8 (select |#length| main_~item~0.base)) (= main_~lItem~0.offset 0) (= main_~lItem~0.base main_~data~0.base) (= main_~item~0.offset 0)), 5914#(and (= main_~data~0.offset 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4)))), 5915#(and (= 0 |main_#t~mem31.offset|) (= main_~data~0.offset 0) (<= 8 (select |#length| |main_#t~mem31.base|))), 5916#(and (= main_~data~0.offset 0) (<= 8 (select |#length| main_~item~0.base)) (= main_~item~0.offset 0)), 5917#(and (<= 8 (select |#length| main_~item~0.base)) (= main_~item~0.offset 0))] [2018-02-02 10:09:57,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:57,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:09:57,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:09:57,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:09:57,638 INFO L87 Difference]: Start difference. First operand 209 states and 261 transitions. Second operand 11 states. [2018-02-02 10:09:58,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:58,097 INFO L93 Difference]: Finished difference Result 258 states and 312 transitions. [2018-02-02 10:09:58,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:09:58,097 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-02-02 10:09:58,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:58,098 INFO L225 Difference]: With dead ends: 258 [2018-02-02 10:09:58,099 INFO L226 Difference]: Without dead ends: 258 [2018-02-02 10:09:58,099 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:09:58,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-02 10:09:58,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 209. [2018-02-02 10:09:58,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 10:09:58,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 260 transitions. [2018-02-02 10:09:58,108 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 260 transitions. Word has length 41 [2018-02-02 10:09:58,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:58,109 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 260 transitions. [2018-02-02 10:09:58,109 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:09:58,109 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 260 transitions. [2018-02-02 10:09:58,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 10:09:58,109 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:58,110 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] [2018-02-02 10:09:58,110 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:09:58,110 INFO L82 PathProgramCache]: Analyzing trace with hash -310930527, now seen corresponding path program 1 times [2018-02-02 10:09:58,111 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:58,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:58,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:58,263 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:58,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 10:09:58,264 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:58,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:58,264 INFO L182 omatonBuilderFactory]: Interpolants [6416#(and (= main_~item~0.offset main_~lItem~0.offset) (= main_~item~0.offset main_~data~0.offset) (not (= 0 main_~item~0.base)) (= main_~item~0.offset 0) (= main_~data~0.base main_~lItem~0.base)), 6417#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))), 6418#(not (= 0 |main_#t~mem31.base|)), 6419#(not (= 0 main_~item~0.base)), 6410#true, 6411#false, 6412#(and (not (= 0 |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 6413#(and (not (= 0 main_~item~0.base)) (= main_~item~0.offset 0)), 6414#(and (= 0 |main_#t~malloc8.offset|) (not (= 0 main_~item~0.base)) (= main_~item~0.offset 0)), 6415#(and (= main_~item~0.offset main_~lItem~0.offset) (not (= 0 main_~item~0.base)) (= main_~item~0.offset 0))] [2018-02-02 10:09:58,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:58,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:09:58,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:09:58,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:09:58,265 INFO L87 Difference]: Start difference. First operand 209 states and 260 transitions. Second operand 10 states. [2018-02-02 10:09:58,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:58,493 INFO L93 Difference]: Finished difference Result 236 states and 288 transitions. [2018-02-02 10:09:58,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:09:58,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-02-02 10:09:58,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:58,494 INFO L225 Difference]: With dead ends: 236 [2018-02-02 10:09:58,494 INFO L226 Difference]: Without dead ends: 236 [2018-02-02 10:09:58,495 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:09:58,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-02-02 10:09:58,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 209. [2018-02-02 10:09:58,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 10:09:58,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 259 transitions. [2018-02-02 10:09:58,499 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 259 transitions. Word has length 42 [2018-02-02 10:09:58,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:58,499 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 259 transitions. [2018-02-02 10:09:58,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:09:58,499 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 259 transitions. [2018-02-02 10:09:58,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:09:58,499 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:58,500 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] [2018-02-02 10:09:58,500 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:09:58,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1048881672, now seen corresponding path program 1 times [2018-02-02 10:09:58,500 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:58,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:58,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:09:58,538 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:58,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:09:58,538 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:58,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:58,538 INFO L182 omatonBuilderFactory]: Interpolants [6884#true, 6885#false, 6886#(= main_~item2~0.base main_~item~0.base), 6887#(= 1 (select |#valid| main_~item2~0.base))] [2018-02-02 10:09:58,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:09:58,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:09:58,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:09:58,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:09:58,539 INFO L87 Difference]: Start difference. First operand 209 states and 259 transitions. Second operand 4 states. [2018-02-02 10:09:58,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:58,660 INFO L93 Difference]: Finished difference Result 265 states and 327 transitions. [2018-02-02 10:09:58,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:09:58,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-02-02 10:09:58,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:58,662 INFO L225 Difference]: With dead ends: 265 [2018-02-02 10:09:58,662 INFO L226 Difference]: Without dead ends: 265 [2018-02-02 10:09:58,662 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:09:58,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-02-02 10:09:58,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 213. [2018-02-02 10:09:58,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-02-02 10:09:58,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 270 transitions. [2018-02-02 10:09:58,666 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 270 transitions. Word has length 43 [2018-02-02 10:09:58,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:58,666 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 270 transitions. [2018-02-02 10:09:58,666 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:09:58,667 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 270 transitions. [2018-02-02 10:09:58,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:09:58,667 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:58,667 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] [2018-02-02 10:09:58,667 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:09:58,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1048881671, now seen corresponding path program 1 times [2018-02-02 10:09:58,668 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:58,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:59,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:59,037 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:59,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 10:09:59,038 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:59,038 INFO L182 omatonBuilderFactory]: Interpolants [7368#true, 7369#false, 7370#(and (= 8 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 7371#(and (= (select |#length| main_~item~0.base) 8) (= main_~item~0.offset 0)), 7372#(and (not (= 0 |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|) (= main_~item~0.offset 0) (or (<= 8 (select |#length| main_~item~0.base)) (= main_~item~0.base |main_#t~malloc8.base|))), 7373#(and (= main_~lItem~0.offset 0) (or (not (= main_~item~0.base main_~lItem~0.base)) (not (= 0 main_~lItem~0.base))) (or (= main_~item~0.base main_~lItem~0.base) (<= 8 (select |#length| main_~item~0.base))) (= main_~item~0.offset 0)), 7374#(and (= main_~data~0.offset 0) (= main_~lItem~0.offset 0) (or (not (= main_~item~0.base main_~lItem~0.base)) (and (not (= 0 main_~data~0.base)) (= main_~data~0.base main_~lItem~0.base))) (= main_~item~0.offset 0) (or (= main_~item~0.base main_~lItem~0.base) (and (<= 8 (select |#length| main_~item~0.base)) (= main_~data~0.base main_~lItem~0.base)))), 7375#(and (= main_~data~0.offset 0) (or (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4)))) (and (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (not (= 0 main_~data~0.base))))), 7376#(and (= main_~data~0.offset 0) (or (and (= 0 |main_#t~mem31.offset|) (<= 8 (select |#length| |main_#t~mem31.base|))) (and (not (= main_~data~0.base 0)) (= main_~data~0.base |main_#t~mem31.base|)))), 7377#(and (= main_~data~0.offset 0) (or (and (<= 8 (select |#length| main_~item~0.base)) (= main_~item~0.offset 0)) (and (= main_~data~0.base main_~item~0.base) (not (= main_~data~0.base 0))))), 7378#(or (and (<= 8 (select |#length| main_~item~0.base)) (= main_~item~0.offset 0)) (= 0 (select |#valid| main_~item~0.base))), 7379#(and (or (= 0 (select |#valid| main_~item~0.base)) (and (= (select |#length| main_~item~0.base) (select |#length| main_~item2~0.base)) (<= 8 (select |#length| main_~item~0.base)) (= main_~item~0.offset 0))) (= main_~item~0.offset main_~item2~0.offset)), 7380#(and (<= (+ main_~item2~0.offset 8) (select |#length| main_~item2~0.base)) (<= 0 main_~item2~0.offset))] [2018-02-02 10:09:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:59,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:09:59,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:09:59,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:09:59,039 INFO L87 Difference]: Start difference. First operand 213 states and 270 transitions. Second operand 13 states. [2018-02-02 10:09:59,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:59,742 INFO L93 Difference]: Finished difference Result 269 states and 332 transitions. [2018-02-02 10:09:59,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:09:59,743 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-02-02 10:09:59,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:59,743 INFO L225 Difference]: With dead ends: 269 [2018-02-02 10:09:59,743 INFO L226 Difference]: Without dead ends: 269 [2018-02-02 10:09:59,744 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:09:59,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-02 10:09:59,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 218. [2018-02-02 10:09:59,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 10:09:59,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 276 transitions. [2018-02-02 10:09:59,746 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 276 transitions. Word has length 43 [2018-02-02 10:09:59,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:59,746 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 276 transitions. [2018-02-02 10:09:59,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:09:59,746 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 276 transitions. [2018-02-02 10:09:59,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:09:59,747 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:59,747 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] [2018-02-02 10:09:59,747 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:09:59,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1204415842, now seen corresponding path program 1 times [2018-02-02 10:09:59,747 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:59,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:59,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:09:59,763 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:59,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:09:59,763 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:59,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:59,763 INFO L182 omatonBuilderFactory]: Interpolants [7901#true, 7902#false, 7903#(not |main_#t~short35|)] [2018-02-02 10:09:59,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:09:59,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:09:59,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:09:59,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:09:59,764 INFO L87 Difference]: Start difference. First operand 218 states and 276 transitions. Second operand 3 states. [2018-02-02 10:09:59,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:59,768 INFO L93 Difference]: Finished difference Result 219 states and 277 transitions. [2018-02-02 10:09:59,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:09:59,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-02-02 10:09:59,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:59,769 INFO L225 Difference]: With dead ends: 219 [2018-02-02 10:09:59,769 INFO L226 Difference]: Without dead ends: 219 [2018-02-02 10:09:59,769 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:09:59,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-02 10:09:59,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-02-02 10:09:59,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 10:09:59,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 277 transitions. [2018-02-02 10:09:59,771 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 277 transitions. Word has length 47 [2018-02-02 10:09:59,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:59,771 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 277 transitions. [2018-02-02 10:09:59,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:09:59,771 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 277 transitions. [2018-02-02 10:09:59,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:09:59,772 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:59,772 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] [2018-02-02 10:09:59,772 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:09:59,772 INFO L82 PathProgramCache]: Analyzing trace with hash 2091612127, now seen corresponding path program 1 times [2018-02-02 10:09:59,773 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:59,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:59,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:59,903 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:59,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 10:09:59,903 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:59,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:59,904 INFO L182 omatonBuilderFactory]: Interpolants [8352#(and (= main_~item~0.offset main_~item2~0.offset) (= main_~item~0.offset 0)), 8353#(and (<= main_~item2~0.offset 0) (<= 0 main_~item2~0.offset)), 8342#true, 8343#false, 8344#(= 0 |main_#t~malloc3.offset|), 8345#(= 0 main_~item~0.offset), 8346#(and (= 0 |main_#t~malloc8.offset|) (= main_~item~0.offset 0)), 8347#(and (= 0 main_~lItem~0.offset) (= main_~item~0.offset 0)), 8348#(and (= main_~data~0.offset 0) (= main_~lItem~0.offset 0) (= main_~lItem~0.base main_~data~0.base) (= main_~item~0.offset 0)), 8349#(and (= main_~data~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4)))), 8350#(and (= 0 |main_#t~mem31.offset|) (= main_~data~0.offset 0)), 8351#(and (= main_~data~0.offset 0) (= main_~item~0.offset 0))] [2018-02-02 10:09:59,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:59,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:09:59,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:09:59,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:09:59,904 INFO L87 Difference]: Start difference. First operand 219 states and 277 transitions. Second operand 12 states. [2018-02-02 10:10:00,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:00,183 INFO L93 Difference]: Finished difference Result 289 states and 354 transitions. [2018-02-02 10:10:00,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:10:00,184 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2018-02-02 10:10:00,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:00,185 INFO L225 Difference]: With dead ends: 289 [2018-02-02 10:10:00,185 INFO L226 Difference]: Without dead ends: 289 [2018-02-02 10:10:00,186 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=182, Invalid=520, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:10:00,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-02-02 10:10:00,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 222. [2018-02-02 10:10:00,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-02 10:10:00,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 281 transitions. [2018-02-02 10:10:00,189 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 281 transitions. Word has length 49 [2018-02-02 10:10:00,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:00,190 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 281 transitions. [2018-02-02 10:10:00,190 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:10:00,190 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 281 transitions. [2018-02-02 10:10:00,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:10:00,190 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:00,190 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:00,191 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:10:00,191 INFO L82 PathProgramCache]: Analyzing trace with hash 2097549474, now seen corresponding path program 1 times [2018-02-02 10:10:00,191 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:00,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:00,673 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:00,673 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:00,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:10:00,673 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:00,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:00,674 INFO L182 omatonBuilderFactory]: Interpolants [8897#true, 8898#false, 8899#(= main_~c1~0 0), 8900#(<= 1 main_~c1~0), 8901#(and (<= 1 main_~c1~0) (= 0 |main_#t~malloc3.offset|)), 8902#(and (<= 1 main_~c1~0) (= main_~item~0.offset 0)), 8903#(and (= (+ (* 2 main_~c1~0) 4) (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4))) (<= 1 main_~c1~0) (= main_~item~0.offset 0)), 8904#(and (or (and (= (+ (* 2 main_~c1~0) 4) (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4))) (<= 1 main_~c1~0)) (= main_~item~0.base |main_#t~malloc8.base|)) (or (not (= 0 |main_#t~malloc8.base|)) (not (= main_~item~0.base |main_#t~malloc8.base|))) (= 0 |main_#t~malloc8.offset|) (= main_~item~0.offset 0)), 8905#(and (or (and (not (= main_~item~0.base main_~lItem~0.base)) (= (+ (* 2 main_~c1~0) 4) (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4))) (<= 1 main_~c1~0)) (and (= main_~lItem~0.base main_~item~0.base) (not (= 0 main_~lItem~0.base)))) (= 0 main_~lItem~0.offset) (= main_~item~0.offset 0)), 8906#(and (= main_~data~0.offset 0) (= main_~lItem~0.offset 0) (or (and (not (= main_~item~0.base main_~lItem~0.base)) (= (+ (* 2 main_~c1~0) 4) (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4))) (<= 1 main_~c1~0) (= main_~data~0.base main_~lItem~0.base)) (and (= main_~data~0.base main_~item~0.base) (not (= 0 main_~data~0.base)) (= main_~data~0.base main_~lItem~0.base))) (= main_~item~0.offset 0)), 8907#(and (= main_~data~0.offset 0) (or (and (= (+ (* 2 main_~c1~0) 4) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (+ 0 4))) (<= 1 main_~c1~0) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4)))) (and (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (not (= 0 main_~data~0.base))))), 8908#(and (= main_~data~0.offset 0) (or (and (<= 6 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4)))) (and (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (not (= 0 main_~data~0.base))))), 8909#(and (= main_~data~0.offset 0) (or (and (<= 6 (select (select |#memory_int| |main_#t~mem31.base|) (+ 0 4))) (= 0 |main_#t~mem31.offset|)) (and (not (= main_~data~0.base 0)) (= main_~data~0.base |main_#t~mem31.base|)))), 8910#(and (= main_~data~0.offset 0) (or (and (= main_~item~0.offset 0) (<= 6 (select (select |#memory_int| main_~item~0.base) (+ 0 4)))) (and (= main_~data~0.base main_~item~0.base) (not (= main_~data~0.base 0))))), 8911#(or (= 0 (select |#valid| main_~item~0.base)) (and (= main_~item~0.offset 0) (<= 6 (select (select |#memory_int| main_~item~0.base) (+ 0 4))))), 8912#(or (<= 6 (select (select |#memory_int| main_~item2~0.base) (+ main_~item2~0.offset 4))) (= 0 (select |#valid| main_~item~0.base))), 8913#(<= 6 (select (select |#memory_int| main_~item2~0.base) (+ main_~item2~0.offset 4))), 8914#(<= 2 |main_#t~mem33|), 8915#|main_#t~short35|] [2018-02-02 10:10:00,674 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:00,674 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:10:00,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:10:00,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:10:00,675 INFO L87 Difference]: Start difference. First operand 222 states and 281 transitions. Second operand 19 states. [2018-02-02 10:10:01,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:01,995 INFO L93 Difference]: Finished difference Result 266 states and 328 transitions. [2018-02-02 10:10:01,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:10:01,996 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-02-02 10:10:01,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:01,996 INFO L225 Difference]: With dead ends: 266 [2018-02-02 10:10:01,996 INFO L226 Difference]: Without dead ends: 266 [2018-02-02 10:10:01,997 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=310, Invalid=1496, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:10:01,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-02-02 10:10:01,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 222. [2018-02-02 10:10:01,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-02 10:10:01,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 280 transitions. [2018-02-02 10:10:01,999 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 280 transitions. Word has length 49 [2018-02-02 10:10:01,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:01,999 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 280 transitions. [2018-02-02 10:10:01,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:10:01,999 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 280 transitions. [2018-02-02 10:10:02,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:10:02,000 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:02,000 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:02,000 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:10:02,000 INFO L82 PathProgramCache]: Analyzing trace with hash -5312545, now seen corresponding path program 1 times [2018-02-02 10:10:02,000 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:02,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:02,483 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:02,483 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:02,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:10:02,483 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:02,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:02,484 INFO L182 omatonBuilderFactory]: Interpolants [9452#true, 9453#false, 9454#(= 0 |main_#t~malloc3.offset|), 9455#(= main_~item~0.offset 0), 9456#(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.offset 0)), 9457#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (not (= 0 |main_#t~malloc8.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= 0 |main_#t~malloc8.offset|) (= main_~item~0.offset 0)), 9458#(and (or (= main_~item~0.base main_~lItem~0.base) (and (= 0 (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) main_~lItem~0.offset main_~lItem~0.base)) main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)))) (= 0 main_~lItem~0.offset) (or (not (= main_~item~0.base main_~lItem~0.base)) (not (= 0 main_~lItem~0.base))) (= main_~item~0.offset 0)), 9459#(and (= main_~data~0.offset 0) (= main_~lItem~0.offset 0) (or (= main_~item~0.base main_~lItem~0.base) (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~item~0.base) main_~item~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~item~0.base) main_~item~0.offset)) (= main_~data~0.base main_~lItem~0.base))) (or (not (= main_~item~0.base main_~lItem~0.base)) (and (not (= 0 main_~data~0.base)) (= main_~data~0.base main_~lItem~0.base))) (= main_~item~0.offset 0)), 9460#(and (= main_~data~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) 0))) (and (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (not (= 0 main_~data~0.base)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4)))), 9461#(and (= 0 |main_#t~mem31.offset|) (= main_~data~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem31.base|) 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem31.base|) 0))) (and (not (= main_~data~0.base 0)) (= main_~data~0.base |main_#t~mem31.base|)))), 9462#(and (= main_~data~0.offset 0) (or (and (= main_~data~0.base main_~item~0.base) (not (= main_~data~0.base 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)))) (= main_~item~0.offset 0)), 9463#(and (= main_~item~0.offset 0) (or (= 0 (select |#valid| main_~item~0.base)) (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))))), 9464#(or (= 0 (select |#valid| main_~item~0.base)) (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)))), 9465#(and (= 0 |main_#t~mem32.offset|) (= 0 |main_#t~mem32.base|)), 9466#(and (= 0 main_~item~0.base) (= main_~item~0.offset 0))] [2018-02-02 10:10:02,484 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:02,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:10:02,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:10:02,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:10:02,484 INFO L87 Difference]: Start difference. First operand 222 states and 280 transitions. Second operand 15 states. [2018-02-02 10:10:03,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:03,391 INFO L93 Difference]: Finished difference Result 246 states and 305 transitions. [2018-02-02 10:10:03,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:10:03,392 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2018-02-02 10:10:03,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:03,393 INFO L225 Difference]: With dead ends: 246 [2018-02-02 10:10:03,393 INFO L226 Difference]: Without dead ends: 246 [2018-02-02 10:10:03,393 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=228, Invalid=828, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:10:03,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-02-02 10:10:03,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 224. [2018-02-02 10:10:03,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-02-02 10:10:03,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 282 transitions. [2018-02-02 10:10:03,397 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 282 transitions. Word has length 51 [2018-02-02 10:10:03,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:03,397 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 282 transitions. [2018-02-02 10:10:03,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:10:03,397 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 282 transitions. [2018-02-02 10:10:03,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:10:03,397 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:03,397 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] [2018-02-02 10:10:03,397 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:10:03,397 INFO L82 PathProgramCache]: Analyzing trace with hash -164689671, now seen corresponding path program 1 times [2018-02-02 10:10:03,398 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:03,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:03,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:03,823 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:10:03,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-02-02 10:10:03,823 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:03,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:03,824 INFO L182 omatonBuilderFactory]: Interpolants [9984#(and (= main_~data~0.offset 0) (or (and (= (+ (* 2 main_~c1~0) 4) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (+ 0 4))) (<= main_~c1~0 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4)))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (not (= 0 main_~data~0.base))), 9985#(and (= main_~data~0.offset 0) (not (= 0 main_~data~0.base)) (or (and (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) (+ 0 4)) 6) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4)))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))))), 9986#(and (not (= main_~data~0.base 0)) (= main_~data~0.offset 0) (or (and (= 0 |main_#t~mem31.offset|) (<= (select (select |#memory_int| |main_#t~mem31.base|) (+ 0 4)) 6)) (= main_~data~0.base |main_#t~mem31.base|))), 9987#(and (or (= main_~data~0.base main_~item~0.base) (and (<= (select (select |#memory_int| main_~item~0.base) (+ 0 4)) 6) (= main_~item~0.offset 0))) (= main_~data~0.offset 0) (not (= main_~data~0.base 0))), 9988#(or (= 0 (select |#valid| main_~item~0.base)) (and (<= (select (select |#memory_int| main_~item~0.base) (+ 0 4)) 6) (= main_~item~0.offset 0))), 9989#(or (= 0 (select |#valid| main_~item~0.base)) (<= (select (select |#memory_int| main_~item2~0.base) (+ main_~item2~0.offset 4)) 6)), 9990#(<= (select (select |#memory_int| main_~item2~0.base) (+ main_~item2~0.offset 4)) 6), 9991#(and (= |main_#t~mem33| (select (select |#memory_int| main_~item2~0.base) (+ main_~item2~0.offset 4))) (<= |main_#t~mem33| 14)), 9992#(<= (select (select |#memory_int| main_~item2~0.base) (+ main_~item2~0.offset 4)) 14), 9993#(<= |main_#t~mem34| 14), 9994#|main_#t~short35|, 9975#true, 9976#false, 9977#(= 0 |main_#t~malloc3.offset|), 9978#(= 0 main_~item~0.offset), 9979#(and (<= main_~c1~0 1) (= main_~item~0.offset 0)), 9980#(and (<= main_~c1~0 1) (= (+ (* 2 main_~c1~0) 4) (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4))) (= main_~item~0.offset 0)), 9981#(and (<= main_~c1~0 1) (not (= 0 |main_#t~malloc8.base|)) (= (+ (* 2 main_~c1~0) 4) (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4))) (= 0 |main_#t~malloc8.offset|) (= main_~item~0.offset 0)), 9982#(and (not (= 0 main_~lItem~0.base)) (or (= main_~item~0.base main_~lItem~0.base) (and (<= main_~c1~0 1) (= (+ (* 2 main_~c1~0) 4) (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4))))) (= 0 main_~lItem~0.offset) (= main_~item~0.offset 0)), 9983#(and (= main_~data~0.offset 0) (or (= main_~item~0.base main_~lItem~0.base) (and (<= main_~c1~0 1) (= (+ (* 2 main_~c1~0) 4) (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4))))) (= main_~lItem~0.offset 0) (not (= 0 main_~data~0.base)) (= main_~item~0.offset 0) (= main_~data~0.base main_~lItem~0.base))] [2018-02-02 10:10:03,824 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:03,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:10:03,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:10:03,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:10:03,824 INFO L87 Difference]: Start difference. First operand 224 states and 282 transitions. Second operand 20 states. [2018-02-02 10:10:04,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:04,919 INFO L93 Difference]: Finished difference Result 274 states and 335 transitions. [2018-02-02 10:10:04,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:10:04,920 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 52 [2018-02-02 10:10:04,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:04,920 INFO L225 Difference]: With dead ends: 274 [2018-02-02 10:10:04,920 INFO L226 Difference]: Without dead ends: 274 [2018-02-02 10:10:04,921 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=357, Invalid=1805, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:10:04,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-02-02 10:10:04,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 224. [2018-02-02 10:10:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-02-02 10:10:04,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 281 transitions. [2018-02-02 10:10:04,923 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 281 transitions. Word has length 52 [2018-02-02 10:10:04,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:04,923 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 281 transitions. [2018-02-02 10:10:04,923 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:10:04,923 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 281 transitions. [2018-02-02 10:10:04,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:10:04,923 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:04,924 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] [2018-02-02 10:10:04,924 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:10:04,924 INFO L82 PathProgramCache]: Analyzing trace with hash -927850364, now seen corresponding path program 1 times [2018-02-02 10:10:04,924 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:04,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:05,199 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:10:05,199 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:05,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:10:05,199 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:05,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:05,199 INFO L182 omatonBuilderFactory]: Interpolants [10560#(and (not (= main_~data~0.base 0)) (= |old(#valid)| (store (store |#valid| main_~data~0.base 0) |main_#t~mem31.base| 0))), 10561#(and (= (store (store |#valid| main_~data~0.base 0) main_~item~0.base 0) |old(#valid)|) (not (= main_~data~0.base 0))), 10562#(= (store |#valid| main_~item~0.base 0) |old(#valid)|), 10563#(and (or (not (= 0 main_~item2~0.base)) (not (= 0 main_~item2~0.offset))) (= (store |#valid| main_~item2~0.base 0) |old(#valid)|)), 10551#true, 10552#false, 10553#(= |#valid| |old(#valid)|), 10554#(and (= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0)) (= 0 |main_#t~malloc3.offset|)), 10555#(and (= (store |#valid| main_~item~0.base 0) |old(#valid)|) (= main_~item~0.offset 0)), 10556#(and (= (store (store |#valid| |main_#t~malloc8.base| 0) main_~item~0.base 0) |old(#valid)|) (not (= 0 |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|) (= main_~item~0.offset 0)), 10557#(and (= main_~item~0.offset main_~lItem~0.offset) (not (= 0 main_~lItem~0.base)) (= main_~item~0.offset 0) (= |old(#valid)| (store (store |#valid| main_~lItem~0.base 0) main_~item~0.base 0))), 10558#(and (= (store (store |#valid| main_~data~0.base 0) main_~item~0.base 0) |old(#valid)|) (= main_~item~0.offset main_~lItem~0.offset) (= main_~item~0.offset main_~data~0.offset) (not (= 0 main_~data~0.base)) (= main_~item~0.offset 0) (= main_~data~0.base main_~lItem~0.base)), 10559#(and (= (store (store |#valid| main_~data~0.base 0) (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)) 0) |old(#valid)|) (not (= 0 main_~data~0.base)))] [2018-02-02 10:10:05,200 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:10:05,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:10:05,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:10:05,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:10:05,200 INFO L87 Difference]: Start difference. First operand 224 states and 281 transitions. Second operand 13 states. [2018-02-02 10:10:05,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:05,645 INFO L93 Difference]: Finished difference Result 227 states and 283 transitions. [2018-02-02 10:10:05,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:10:05,645 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-02-02 10:10:05,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:05,646 INFO L225 Difference]: With dead ends: 227 [2018-02-02 10:10:05,646 INFO L226 Difference]: Without dead ends: 205 [2018-02-02 10:10:05,646 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:10:05,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-02 10:10:05,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2018-02-02 10:10:05,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-02 10:10:05,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 260 transitions. [2018-02-02 10:10:05,649 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 260 transitions. Word has length 53 [2018-02-02 10:10:05,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:05,649 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 260 transitions. [2018-02-02 10:10:05,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:10:05,649 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 260 transitions. [2018-02-02 10:10:05,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:10:05,650 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:05,650 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:05,650 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:10:05,650 INFO L82 PathProgramCache]: Analyzing trace with hash -62214646, now seen corresponding path program 1 times [2018-02-02 10:10:05,651 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:05,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:05,691 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:05,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 10:10:05,692 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:05,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:05,692 INFO L182 omatonBuilderFactory]: Interpolants [11015#true, 11016#false, 11017#(<= main_~c1~0 1), 11018#(<= main_~c1~0 2)] [2018-02-02 10:10:05,692 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:05,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:10:05,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:10:05,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:10:05,693 INFO L87 Difference]: Start difference. First operand 204 states and 260 transitions. Second operand 4 states. [2018-02-02 10:10:05,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:05,718 INFO L93 Difference]: Finished difference Result 540 states and 701 transitions. [2018-02-02 10:10:05,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:10:05,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-02-02 10:10:05,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:05,720 INFO L225 Difference]: With dead ends: 540 [2018-02-02 10:10:05,720 INFO L226 Difference]: Without dead ends: 540 [2018-02-02 10:10:05,720 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:10:05,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-02-02 10:10:05,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 226. [2018-02-02 10:10:05,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-02 10:10:05,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 285 transitions. [2018-02-02 10:10:05,724 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 285 transitions. Word has length 60 [2018-02-02 10:10:05,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:05,724 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 285 transitions. [2018-02-02 10:10:05,724 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:10:05,724 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 285 transitions. [2018-02-02 10:10:05,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:10:05,725 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:05,725 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-02-02 10:10:05,725 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:10:05,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1528276162, now seen corresponding path program 1 times [2018-02-02 10:10:05,726 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:05,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:10:05,949 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:05,949 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:05,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:10:05,950 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:05,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:05,950 INFO L182 omatonBuilderFactory]: Interpolants [11792#(or (and (not (= main_~data~0.offset (+ main_~lItem~0.offset 4))) (= 1 (select |#valid| main_~data~0.base))) (not (= main_~lItem~0.base main_~data~0.base))), 11793#(and (= 1 (select |#valid| main_~lItem~0.base)) (or (not (= main_~lItem~0.base main_~data~0.base)) (not (= main_~data~0.offset (+ main_~lItem~0.offset 4))))), 11794#(and (= 1 (select |#valid| main_~lItem~0.base)) (or (not (= main_~lItem~0.base main_~data~0.base)) (not (= main_~data~0.offset (+ main_~lItem~0.offset 4)))) (= main_~lItem~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset))), 11795#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 11796#(= 1 (select |#valid| |main_#t~mem16.base|)), 11785#true, 11786#false, 11787#(= 0 |main_#t~malloc8.offset|), 11788#(= 0 main_~lItem~0.offset), 11789#(= 0 main_~data~0.offset), 11790#(and (= 0 main_~data~0.offset) (= 0 |main_#t~malloc8.offset|)), 11791#(or (not (= main_~lItem~0.base main_~data~0.base)) (not (= main_~data~0.offset (+ main_~lItem~0.offset 4))))] [2018-02-02 10:10:05,950 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:05,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:10:05,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:10:05,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:10:05,951 INFO L87 Difference]: Start difference. First operand 226 states and 285 transitions. Second operand 12 states. [2018-02-02 10:10:06,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:06,241 INFO L93 Difference]: Finished difference Result 252 states and 289 transitions. [2018-02-02 10:10:06,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:10:06,241 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-02-02 10:10:06,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:06,241 INFO L225 Difference]: With dead ends: 252 [2018-02-02 10:10:06,242 INFO L226 Difference]: Without dead ends: 252 [2018-02-02 10:10:06,242 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:10:06,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-02-02 10:10:06,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 226. [2018-02-02 10:10:06,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-02 10:10:06,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 284 transitions. [2018-02-02 10:10:06,245 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 284 transitions. Word has length 61 [2018-02-02 10:10:06,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:06,245 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 284 transitions. [2018-02-02 10:10:06,245 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:10:06,245 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 284 transitions. [2018-02-02 10:10:06,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:10:06,246 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:06,246 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-02-02 10:10:06,246 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:10:06,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1528276161, now seen corresponding path program 1 times [2018-02-02 10:10:06,247 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:06,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:06,505 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:06,505 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:06,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:10:06,505 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:06,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:06,506 INFO L182 omatonBuilderFactory]: Interpolants [12304#(= 0 main_~lItem~0.offset), 12305#(= main_~data~0.offset 0), 12306#(and (= main_~data~0.offset |main_#t~malloc8.offset|) (= 8 (select |#length| |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|)), 12307#(and (or (and (= 8 (select |#length| main_~lItem~0.base)) (= 0 main_~lItem~0.offset)) (= main_~lItem~0.base main_~data~0.base)) (or (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.offset main_~lItem~0.offset))), 12308#(and (or (not (= main_~lItem~0.base main_~data~0.base)) (and (not (= main_~data~0.offset (+ main_~lItem~0.offset 4))) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset)) (= main_~data~0.offset (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~data~0.offset)))) (or (= main_~lItem~0.base main_~data~0.base) (and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset))))), 12309#(or (and (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))), 12310#(or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (and (= main_~data~0.base |main_#t~mem14.base|) (= |main_#t~mem14.offset| main_~data~0.offset))), 12311#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))), 12312#(and (= |main_#t~mem16.offset| 0) (= 8 (select |#length| |main_#t~mem16.base|))), 12301#true, 12302#false, 12303#(= 0 |main_#t~malloc8.offset|)] [2018-02-02 10:10:06,506 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:06,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:10:06,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:10:06,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:10:06,506 INFO L87 Difference]: Start difference. First operand 226 states and 284 transitions. Second operand 12 states. [2018-02-02 10:10:06,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:06,949 INFO L93 Difference]: Finished difference Result 271 states and 310 transitions. [2018-02-02 10:10:06,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:10:06,949 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-02-02 10:10:06,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:06,950 INFO L225 Difference]: With dead ends: 271 [2018-02-02 10:10:06,950 INFO L226 Difference]: Without dead ends: 271 [2018-02-02 10:10:06,950 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:10:06,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-02-02 10:10:06,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 226. [2018-02-02 10:10:06,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-02 10:10:06,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 283 transitions. [2018-02-02 10:10:06,952 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 283 transitions. Word has length 61 [2018-02-02 10:10:06,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:06,952 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 283 transitions. [2018-02-02 10:10:06,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:10:06,952 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 283 transitions. [2018-02-02 10:10:06,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:10:06,953 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:06,953 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-02-02 10:10:06,953 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:10:06,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1270433664, now seen corresponding path program 1 times [2018-02-02 10:10:06,953 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:06,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:07,033 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:07,034 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:07,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:10:07,034 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:07,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:07,034 INFO L182 omatonBuilderFactory]: Interpolants [12832#true, 12833#false, 12834#(= (select |#valid| main_~lItem~0.base) 1), 12835#(and (= (select |#valid| main_~lItem~0.base) 1) (= main_~data~0.base main_~lItem~0.base)), 12836#(= (select |#valid| main_~data~0.base) 1), 12837#(or (= main_~data~0.base |main_#t~malloc3.base|) (= (select |#valid| main_~data~0.base) 1)), 12838#(or (= main_~item~0.base main_~data~0.base) (= (select |#valid| main_~data~0.base) 1)), 12839#(and (= (select |#valid| main_~item~0.base) 1) (= (select |#valid| main_~data~0.base) 1)), 12840#(not (= main_~data~0.base |main_#t~malloc8.base|)), 12841#(not (= main_~lItem~0.base main_~data~0.base)), 12842#(and (not (= main_~lItem~0.base main_~data~0.base)) (= (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset) main_~lItem~0.base)), 12843#(not (= (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset) main_~data~0.base)), 12844#(and (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset) main_~data~0.base)))] [2018-02-02 10:10:07,034 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:07,034 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:10:07,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:10:07,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:10:07,035 INFO L87 Difference]: Start difference. First operand 226 states and 283 transitions. Second operand 13 states. [2018-02-02 10:10:07,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:07,361 INFO L93 Difference]: Finished difference Result 260 states and 297 transitions. [2018-02-02 10:10:07,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:10:07,361 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-02-02 10:10:07,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:07,362 INFO L225 Difference]: With dead ends: 260 [2018-02-02 10:10:07,362 INFO L226 Difference]: Without dead ends: 260 [2018-02-02 10:10:07,362 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:10:07,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-02-02 10:10:07,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 223. [2018-02-02 10:10:07,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-02 10:10:07,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 279 transitions. [2018-02-02 10:10:07,366 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 279 transitions. Word has length 63 [2018-02-02 10:10:07,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:07,366 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 279 transitions. [2018-02-02 10:10:07,366 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:10:07,366 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 279 transitions. [2018-02-02 10:10:07,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:10:07,367 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:07,367 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-02-02 10:10:07,367 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:10:07,367 INFO L82 PathProgramCache]: Analyzing trace with hash -153938688, now seen corresponding path program 1 times [2018-02-02 10:10:07,368 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:07,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:07,420 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-02-02 10:10:07,421 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:10:07,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:10:07,421 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:07,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:07,421 INFO L182 omatonBuilderFactory]: Interpolants [13360#(= 1 (select |#valid| main_~lItem~0.base)), 13355#true, 13356#false, 13357#(= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)), 13358#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 13359#(= 1 (select |#valid| |main_#t~mem18.base|))] [2018-02-02 10:10:07,421 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-02-02 10:10:07,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:10:07,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:10:07,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:10:07,422 INFO L87 Difference]: Start difference. First operand 223 states and 279 transitions. Second operand 6 states. [2018-02-02 10:10:07,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:07,576 INFO L93 Difference]: Finished difference Result 222 states and 277 transitions. [2018-02-02 10:10:07,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:10:07,577 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-02-02 10:10:07,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:07,578 INFO L225 Difference]: With dead ends: 222 [2018-02-02 10:10:07,578 INFO L226 Difference]: Without dead ends: 222 [2018-02-02 10:10:07,578 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:10:07,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-02 10:10:07,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-02-02 10:10:07,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-02 10:10:07,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 277 transitions. [2018-02-02 10:10:07,581 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 277 transitions. Word has length 65 [2018-02-02 10:10:07,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:07,581 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 277 transitions. [2018-02-02 10:10:07,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:10:07,581 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 277 transitions. [2018-02-02 10:10:07,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:10:07,582 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:07,582 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-02-02 10:10:07,582 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:10:07,582 INFO L82 PathProgramCache]: Analyzing trace with hash -153938687, now seen corresponding path program 1 times [2018-02-02 10:10:07,583 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:07,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:07,841 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:07,842 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:07,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:10:07,842 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:07,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:07,843 INFO L182 omatonBuilderFactory]: Interpolants [13824#(and (<= (+ |main_#t~mem18.offset| 8) (select |#length| |main_#t~mem18.base|)) (<= 0 |main_#t~mem18.offset|)), 13825#(and (<= 0 main_~lItem~0.offset) (<= (+ main_~lItem~0.offset 8) (select |#length| main_~lItem~0.base))), 13812#true, 13813#false, 13814#(= 0 |main_#t~malloc8.offset|), 13815#(= 0 main_~lItem~0.offset), 13816#(and (= 0 main_~data~0.offset) (= main_~data~0.base main_~lItem~0.base)), 13817#(= 0 main_~data~0.offset), 13818#(and (= 0 main_~data~0.offset) (= 0 |main_#t~malloc8.offset|)), 13819#(or (and (= 0 main_~lItem~0.offset) (<= main_~data~0.offset main_~lItem~0.offset)) (and (not (= main_~lItem~0.base main_~data~0.base)) (= 0 main_~lItem~0.offset))), 13820#(or (and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~data~0.offset)) (<= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)) (and (not (= main_~lItem~0.base main_~data~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset)))), 13821#(= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)), 13822#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= |main_#t~mem16.offset| 0)), 13823#(and (<= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))))] [2018-02-02 10:10:07,843 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:07,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:10:07,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:10:07,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:10:07,843 INFO L87 Difference]: Start difference. First operand 222 states and 277 transitions. Second operand 14 states. [2018-02-02 10:10:08,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:08,477 INFO L93 Difference]: Finished difference Result 293 states and 333 transitions. [2018-02-02 10:10:08,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:10:08,477 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2018-02-02 10:10:08,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:08,478 INFO L225 Difference]: With dead ends: 293 [2018-02-02 10:10:08,478 INFO L226 Difference]: Without dead ends: 293 [2018-02-02 10:10:08,478 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=570, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:10:08,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-02-02 10:10:08,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 222. [2018-02-02 10:10:08,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-02 10:10:08,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 276 transitions. [2018-02-02 10:10:08,480 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 276 transitions. Word has length 65 [2018-02-02 10:10:08,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:08,480 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 276 transitions. [2018-02-02 10:10:08,480 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:10:08,480 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 276 transitions. [2018-02-02 10:10:08,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 10:10:08,481 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:08,481 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-02-02 10:10:08,481 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:10:08,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1037707387, now seen corresponding path program 1 times [2018-02-02 10:10:08,481 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:08,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:08,666 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:08,667 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:08,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:10:08,667 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:08,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:08,667 INFO L182 omatonBuilderFactory]: Interpolants [14371#true, 14372#false, 14373#(= 0 |main_#t~malloc8.offset|), 14374#(= 0 main_~lItem~0.offset), 14375#(= 0 main_~data~0.offset), 14376#(and (= 0 main_~data~0.offset) (= 0 |main_#t~malloc8.offset|)), 14377#(and (or (not (= main_~lItem~0.base main_~data~0.base)) (not (= main_~data~0.offset (+ main_~lItem~0.offset 4)))) (= 0 main_~lItem~0.offset)), 14378#(and (or (not (= main_~lItem~0.base main_~data~0.base)) (not (= main_~data~0.offset (+ main_~lItem~0.offset 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset))), 14379#(= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)), 14380#(and (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= |main_#t~mem16.offset| 0)), 14381#(<= (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) 0), 14382#(<= |main_#t~mem18.offset| 0), 14383#(<= main_~lItem~0.offset 0)] [2018-02-02 10:10:08,668 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:08,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:10:08,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:10:08,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:10:08,668 INFO L87 Difference]: Start difference. First operand 222 states and 276 transitions. Second operand 13 states. [2018-02-02 10:10:08,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:08,885 INFO L93 Difference]: Finished difference Result 250 states and 287 transitions. [2018-02-02 10:10:08,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:10:08,885 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2018-02-02 10:10:08,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:08,886 INFO L225 Difference]: With dead ends: 250 [2018-02-02 10:10:08,886 INFO L226 Difference]: Without dead ends: 250 [2018-02-02 10:10:08,886 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:10:08,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-02 10:10:08,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 222. [2018-02-02 10:10:08,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-02 10:10:08,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 275 transitions. [2018-02-02 10:10:08,888 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 275 transitions. Word has length 68 [2018-02-02 10:10:08,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:08,888 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 275 transitions. [2018-02-02 10:10:08,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:10:08,888 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 275 transitions. [2018-02-02 10:10:08,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:10:08,889 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:08,889 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-02-02 10:10:08,889 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:10:08,889 INFO L82 PathProgramCache]: Analyzing trace with hash -75951232, now seen corresponding path program 1 times [2018-02-02 10:10:08,890 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:08,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:09,860 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:09,860 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:09,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:10:09,861 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:09,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:09,861 INFO L182 omatonBuilderFactory]: Interpolants [14870#true, 14871#false, 14872#(= 0 |main_#t~malloc3.offset|), 14873#(= main_~item~0.offset 0), 14874#(and (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.offset 0)), 14875#(and (not (= 0 |main_#t~malloc8.base|)) (= 1 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|) (= main_~item~0.offset 0)), 14876#(and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.offset 0) (= 1 (select |#valid| main_~item~0.base)) (= main_~item~0.offset 0)), 14877#(and (not (= 0 main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= main_~lItem~0.offset 0) (= 1 (select |#valid| main_~item~0.base)) (= main_~item~0.offset 0)), 14878#(and (not (= 0 main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= main_~lItem~0.offset 0) (= 0 main_~data~0.offset) (= 1 (select |#valid| main_~item~0.base)) (= main_~data~0.base main_~lItem~0.base) (= main_~item~0.offset 0)), 14879#(and (= main_~data~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (not (= 0 main_~data~0.base)) (= (select |#valid| main_~data~0.base) 1)), 14880#(and (= main_~data~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (not (= main_~data~0.base |main_#t~malloc3.base|)) (not (= 0 main_~data~0.base))), 14881#(and (= main_~data~0.offset 0) (= 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_~data~0.base) (+ main_~data~0.offset 4)))) (not (= main_~item~0.base main_~data~0.base)) (not (= 0 main_~data~0.base))), 14882#(and (= main_~data~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (not (= 0 main_~data~0.base))), 14883#(and (= main_~data~0.offset 0) (not (= 0 |main_#t~malloc8.base|)) (= (select |#valid| |main_#t~malloc8.base|) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (not (= 0 main_~data~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)) |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|)), 14884#(and (= main_~data~0.offset 0) (= main_~lItem~0.offset 0) (or (and (not (= (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)) main_~lItem~0.base)) (not (= 0 main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))))) (= main_~data~0.base main_~lItem~0.base))), 14885#(and (= main_~data~0.offset 0) (= main_~lItem~0.offset 0) (or (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset))) (or (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) (and (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) 1) (not (= (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) (+ main_~data~0.offset 4)) (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) (+ main_~data~0.offset 4))))))), 14886#(and (= main_~data~0.offset 0) (or (and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)) (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 14887#(and (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.offset 0) (or (= main_~data~0.base |main_#t~mem14.base|) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)) (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))))), 14888#(or (and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 1) (= main_~data~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)) (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (not (= (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) 0))), 14889#(or (and (= 1 (select |#valid| |main_#t~mem15.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 1) (= main_~data~0.offset 0) (not (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (not (= (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) 0))), 14890#(or (and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 1) (= main_~data~0.offset 0) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 1 (select |#valid| main_~item~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (not (= (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) 0))), 14891#(or (and (= main_~data~0.offset 0) (not (= 0 |main_#t~mem18.base|)) (not (= main_~item~0.base |main_#t~mem18.base|)) (= (select |#valid| |main_#t~mem18.base|) 1) (= 1 (select |#valid| main_~item~0.base))) (not (= |main_#t~mem18.offset| 0))), 14892#(or (not (= 0 main_~lItem~0.offset)) (and (= main_~data~0.offset 0) (= 1 (select (store |#valid| main_~lItem~0.base 0) main_~item~0.base)) (not (= 0 main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1))), 14893#(and (= main_~data~0.offset 0) (= 1 (select |#valid| main_~item~0.base))), 14894#(= 1 (select |#valid| main_~item~0.base))] [2018-02-02 10:10:09,862 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:09,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:10:09,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:10:09,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:10:09,862 INFO L87 Difference]: Start difference. First operand 222 states and 275 transitions. Second operand 25 states. [2018-02-02 10:10:11,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:11,863 INFO L93 Difference]: Finished difference Result 321 states and 385 transitions. [2018-02-02 10:10:11,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:10:11,864 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 72 [2018-02-02 10:10:11,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:11,864 INFO L225 Difference]: With dead ends: 321 [2018-02-02 10:10:11,864 INFO L226 Difference]: Without dead ends: 321 [2018-02-02 10:10:11,865 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 4 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=534, Invalid=2328, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 10:10:11,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-02-02 10:10:11,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 219. [2018-02-02 10:10:11,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 10:10:11,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 269 transitions. [2018-02-02 10:10:11,868 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 269 transitions. Word has length 72 [2018-02-02 10:10:11,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:11,868 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 269 transitions. [2018-02-02 10:10:11,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:10:11,868 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 269 transitions. [2018-02-02 10:10:11,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:10:11,869 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:11,869 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-02-02 10:10:11,869 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:10:11,869 INFO L82 PathProgramCache]: Analyzing trace with hash -75951231, now seen corresponding path program 1 times [2018-02-02 10:10:11,870 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:11,895 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:12,912 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:12,912 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:12,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:10:12,912 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:12,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:12,913 INFO L182 omatonBuilderFactory]: Interpolants [15495#true, 15496#false, 15497#(and (= 8 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 15498#(and (= 8 (select |#length| main_~item~0.base)) (= main_~item~0.offset 0)), 15499#(and (= 8 (select |#length| main_~item~0.base)) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.offset 0)), 15500#(and (or (= 8 (select |#length| |main_#t~malloc8.base|)) (not (= main_~item~0.base |main_#t~malloc8.base|))) (or (and (= 8 (select |#length| main_~item~0.base)) (= (select |#valid| main_~item~0.base) 1)) (= main_~item~0.base |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|) (= main_~item~0.offset 0)), 15501#(and (or (and (= 8 (select |#length| main_~lItem~0.base)) (= main_~lItem~0.base main_~item~0.base)) (and (= 8 (select |#length| main_~item~0.base)) (= (select |#valid| main_~item~0.base) 1))) (= 0 main_~lItem~0.offset) (= main_~item~0.offset 0)), 15502#(and (= 8 (select |#length| main_~item~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= (select |#valid| main_~lItem~0.base) (select |#valid| main_~item~0.base)) (= 0 main_~lItem~0.offset) (= main_~item~0.offset 0)), 15503#(and (= 8 (select |#length| main_~item~0.base)) (= (select |#valid| main_~lItem~0.base) (select |#valid| main_~item~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= main_~lItem~0.offset 0) (= 0 main_~data~0.offset) (= main_~item~0.offset 0) (= main_~data~0.base main_~lItem~0.base)), 15504#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4))) 1) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4))) (= (select |#valid| main_~data~0.base) 1)), 15505#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4))) (not (= main_~data~0.base |main_#t~malloc3.base|))), 15506#(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_~data~0.base) (+ main_~data~0.offset 4))) (= 8 (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_~data~0.base) (+ main_~data~0.offset 4)))) (= 0 main_~data~0.offset) (not (= main_~item~0.base main_~data~0.base))), 15507#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4)))), 15508#(and (or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4))) (= 0 |main_#t~malloc8.offset|)) (and (= main_~data~0.base |main_#t~malloc8.base|) (= 0 |main_#t~malloc8.offset|))) (= 0 main_~data~0.offset)), 15509#(and (or (and (= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)) (and (not (= main_~lItem~0.base main_~data~0.base)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4))))) (= 0 main_~data~0.offset)), 15510#(and (= main_~data~0.offset 0) (or (and (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset)) (= main_~data~0.offset (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~data~0.offset)) (<= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)) (and (not (= main_~lItem~0.base main_~data~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) (+ main_~data~0.offset 4))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) (+ main_~data~0.offset 4))))))), 15511#(and (= main_~data~0.offset 0) (or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4)))) (and (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))))), 15512#(and (= main_~data~0.offset 0) (or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~data~0.base) (+ main_~data~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) (+ main_~data~0.offset 4)))) (and (= main_~data~0.base |main_#t~mem14.base|) (= |main_#t~mem14.offset| main_~data~0.offset)))), 15513#(and (= main_~data~0.offset 0) (= 0 |main_#t~mem15.offset|) (= 8 (select |#length| |main_#t~mem15.base|))), 15514#(and (= main_~data~0.offset 0) (= (select |#length| main_~item~0.base) 8) (= main_~item~0.offset 0))] [2018-02-02 10:10:12,913 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:12,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:10:12,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:10:12,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:10:12,914 INFO L87 Difference]: Start difference. First operand 219 states and 269 transitions. Second operand 20 states. [2018-02-02 10:10:14,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:14,459 INFO L93 Difference]: Finished difference Result 341 states and 405 transitions. [2018-02-02 10:10:14,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:10:14,459 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2018-02-02 10:10:14,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:14,460 INFO L225 Difference]: With dead ends: 341 [2018-02-02 10:10:14,460 INFO L226 Difference]: Without dead ends: 341 [2018-02-02 10:10:14,460 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 10 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=445, Invalid=1361, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:10:14,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-02-02 10:10:14,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 231. [2018-02-02 10:10:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 10:10:14,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 292 transitions. [2018-02-02 10:10:14,463 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 292 transitions. Word has length 72 [2018-02-02 10:10:14,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:14,463 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 292 transitions. [2018-02-02 10:10:14,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:10:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 292 transitions. [2018-02-02 10:10:14,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 10:10:14,463 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:14,463 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-02-02 10:10:14,463 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:10:14,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1940478412, now seen corresponding path program 1 times [2018-02-02 10:10:14,464 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:14,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:14,519 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:10:14,519 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:14,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:10:14,519 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:14,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:14,520 INFO L182 omatonBuilderFactory]: Interpolants [16135#true, 16136#false, 16137#(= 0 |main_#t~malloc8.offset|), 16138#(= 0 main_~lItem~0.offset), 16139#(= 0 main_~data~0.offset), 16140#(and (= main_~data~0.offset 0) (<= (+ main_~data~0.offset 8) (select |#length| main_~data~0.base))), 16141#(and (<= 4 main_~dst~0.offset) (<= (+ main_~dst~0.offset 4) (select |#length| main_~dst~0.base)))] [2018-02-02 10:10:14,520 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:10:14,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:10:14,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:10:14,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:10:14,520 INFO L87 Difference]: Start difference. First operand 231 states and 292 transitions. Second operand 7 states. [2018-02-02 10:10:14,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:14,685 INFO L93 Difference]: Finished difference Result 279 states and 328 transitions. [2018-02-02 10:10:14,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:10:14,686 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-02-02 10:10:14,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:14,686 INFO L225 Difference]: With dead ends: 279 [2018-02-02 10:10:14,686 INFO L226 Difference]: Without dead ends: 279 [2018-02-02 10:10:14,687 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:10:14,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-02-02 10:10:14,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 248. [2018-02-02 10:10:14,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-02 10:10:14,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 322 transitions. [2018-02-02 10:10:14,688 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 322 transitions. Word has length 73 [2018-02-02 10:10:14,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:14,689 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 322 transitions. [2018-02-02 10:10:14,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:10:14,689 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 322 transitions. [2018-02-02 10:10:14,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 10:10:14,689 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:14,690 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-02-02 10:10:14,690 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:10:14,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1940478411, now seen corresponding path program 1 times [2018-02-02 10:10:14,690 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:14,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:14,951 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:14,951 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:14,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:10:14,952 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:14,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:14,952 INFO L182 omatonBuilderFactory]: Interpolants [16682#true, 16683#false, 16684#(= 0 |main_#t~malloc8.offset|), 16685#(= 0 main_~lItem~0.offset), 16686#(and (= main_~data~0.offset 0) (= main_~data~0.base main_~lItem~0.base)), 16687#(= main_~data~0.offset 0), 16688#(and (= main_~data~0.offset |main_#t~malloc8.offset|) (= 0 |main_#t~malloc8.offset|)), 16689#(= main_~data~0.offset main_~lItem~0.offset), 16690#(and (= 1 (select |#valid| main_~data~0.base)) (= main_~data~0.offset main_~lItem~0.offset)), 16691#(and (= 1 (select |#valid| main_~data~0.base)) (= main_~data~0.offset (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset)) (or (not (= main_~lItem~0.base main_~data~0.base)) (<= main_~data~0.offset main_~lItem~0.offset))), 16692#(and (= 1 (select |#valid| main_~data~0.base)) (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))), 16693#(and (= 1 (select |#valid| main_~data~0.base)) (= |main_#t~mem14.offset| main_~data~0.offset) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 16694#(and (= 1 (select |#valid| main_~data~0.base)) (not (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 16695#(and (not (= main_~data~0.base |main_#t~mem18.base|)) (= 1 (select |#valid| main_~data~0.base))), 16696#(and (= 1 (select |#valid| main_~data~0.base)) (not (= main_~data~0.base main_~lItem~0.base))), 16697#(= 1 (select |#valid| main_~data~0.base)), 16698#(= 1 (select |#valid| main_~dst~0.base))] [2018-02-02 10:10:14,952 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:14,952 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:10:14,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:10:14,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:10:14,952 INFO L87 Difference]: Start difference. First operand 248 states and 322 transitions. Second operand 17 states. [2018-02-02 10:10:15,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:15,505 INFO L93 Difference]: Finished difference Result 277 states and 324 transitions. [2018-02-02 10:10:15,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:10:15,506 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 73 [2018-02-02 10:10:15,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:15,506 INFO L225 Difference]: With dead ends: 277 [2018-02-02 10:10:15,506 INFO L226 Difference]: Without dead ends: 277 [2018-02-02 10:10:15,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=238, Invalid=818, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:10:15,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-02-02 10:10:15,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 247. [2018-02-02 10:10:15,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-02-02 10:10:15,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 310 transitions. [2018-02-02 10:10:15,509 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 310 transitions. Word has length 73 [2018-02-02 10:10:15,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:15,509 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 310 transitions. [2018-02-02 10:10:15,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:10:15,509 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 310 transitions. [2018-02-02 10:10:15,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 10:10:15,509 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:15,509 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-02-02 10:10:15,509 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:10:15,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1940479215, now seen corresponding path program 1 times [2018-02-02 10:10:15,510 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:15,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:16,196 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:16,197 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:16,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:10:16,197 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:16,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:16,197 INFO L182 omatonBuilderFactory]: Interpolants [17257#true, 17258#false, 17259#(= 0 |main_#t~malloc3.offset|), 17260#(= main_~item~0.offset 0), 17261#(and (not (= 0 |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|) (= main_~item~0.offset 0)), 17262#(and (not (= 0 main_~lItem~0.base)) (= 0 main_~lItem~0.offset) (= main_~item~0.offset 0)), 17263#(and (= main_~data~0.offset 0) (not (= 0 main_~lItem~0.base)) (= main_~item~0.offset 0) (= main_~data~0.base main_~lItem~0.base)), 17264#(and (= main_~data~0.offset 0) (not (= 0 main_~data~0.base))), 17265#(and (= main_~data~0.offset 0) (= 1 (select |#valid| |main_#t~malloc3.base|)) (not (= 0 main_~data~0.base))), 17266#(and (= main_~data~0.offset 0) (= 1 (select |#valid| main_~item~0.base)) (not (= 0 main_~data~0.base))), 17267#(and (= main_~data~0.offset 0) (not (= 0 |main_#t~malloc8.base|)) (= (select |#valid| |main_#t~malloc8.base|) 1) (= 1 (select (store |#valid| |main_#t~malloc8.base| 0) main_~item~0.base)) (not (= 0 main_~data~0.base)) (= 0 |main_#t~malloc8.offset|)), 17268#(and (or (and (= 1 (select (store |#valid| main_~lItem~0.base 0) main_~item~0.base)) (not (= 0 main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1)) (= main_~lItem~0.base main_~data~0.base)) (or (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.offset 0)) (= main_~lItem~0.offset 0) (<= main_~data~0.offset main_~lItem~0.offset)), 17269#(and (or (and (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset))) (= main_~lItem~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) 1) (= 1 (select (store |#valid| (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset) 0) main_~item~0.base))) (= main_~lItem~0.base main_~data~0.base)) (= main_~lItem~0.offset 0) (or (not (= main_~lItem~0.base main_~data~0.base)) (and (= main_~data~0.offset 0) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset)))) (<= main_~data~0.offset main_~lItem~0.offset)), 17270#(or (and (= 1 (select (store |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ 0 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 1) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (and (= main_~data~0.offset 0) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 17271#(or (and (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.offset 0) (= main_~data~0.base |main_#t~mem14.base|)) (and (= 1 (select (store |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ 0 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 1) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))))), 17272#(or (and (= 1 (select (store |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ 0 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 1) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (not (= (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) 0))), 17273#(and (or (= |main_#t~mem16.offset| 0) (= (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) |main_#t~mem16.offset|)) (or (and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 1) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= 1 (select (store |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ |main_#t~mem16.offset| 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (not (= (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) 0)))), 17274#(or (and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 1) (= 1 (select (store |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset) 0) |main_#t~mem17.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))) (not (= (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) 0))), 17275#(or (not (= (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset) 0)) (and (= 1 (select (store |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset) 0) main_~item2~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 1) (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))))), 17276#(or (and (not (= 0 |main_#t~mem18.base|)) (= (select |#valid| |main_#t~mem18.base|) 1) (= 1 (select (store |#valid| |main_#t~mem18.base| 0) main_~item2~0.base))) (not (= |main_#t~mem18.offset| 0))), 17277#(or (not (= 0 main_~lItem~0.offset)) (and (not (= 0 main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= 1 (select (store |#valid| main_~lItem~0.base 0) main_~item2~0.base)))), 17278#(= 1 (select |#valid| main_~item2~0.base))] [2018-02-02 10:10:16,197 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:16,197 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:10:16,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:10:16,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:10:16,198 INFO L87 Difference]: Start difference. First operand 247 states and 310 transitions. Second operand 22 states. [2018-02-02 10:10:17,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:17,608 INFO L93 Difference]: Finished difference Result 329 states and 374 transitions. [2018-02-02 10:10:17,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:10:17,609 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 73 [2018-02-02 10:10:17,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:17,609 INFO L225 Difference]: With dead ends: 329 [2018-02-02 10:10:17,609 INFO L226 Difference]: Without dead ends: 329 [2018-02-02 10:10:17,610 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=396, Invalid=2360, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 10:10:17,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-02-02 10:10:17,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 247. [2018-02-02 10:10:17,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-02-02 10:10:17,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 309 transitions. [2018-02-02 10:10:17,613 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 309 transitions. Word has length 73 [2018-02-02 10:10:17,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:17,613 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 309 transitions. [2018-02-02 10:10:17,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:10:17,613 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 309 transitions. [2018-02-02 10:10:17,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 10:10:17,613 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:17,613 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-02-02 10:10:17,613 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:10:17,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1940479216, now seen corresponding path program 1 times [2018-02-02 10:10:17,614 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:17,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:18,147 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:18,147 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:18,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:10:18,147 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:18,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:18,148 INFO L182 omatonBuilderFactory]: Interpolants [17920#false, 17921#(= 0 |main_#t~malloc3.offset|), 17922#(= main_~item~0.offset 0), 17923#(and (= 0 |main_#t~malloc8.offset|) (= main_~item~0.offset 0)), 17924#(and (= 0 main_~lItem~0.offset) (= main_~item~0.offset 0)), 17925#(and (= main_~data~0.offset 0) (= main_~item~0.offset 0) (= main_~data~0.base main_~lItem~0.base)), 17926#(= main_~data~0.offset 0), 17927#(and (= main_~data~0.offset 0) (= 8 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 17928#(and (= 0 main_~item~0.offset) (= main_~data~0.offset 0) (= (select |#length| main_~item~0.base) 8)), 17929#(and (= 0 main_~item~0.offset) (= main_~data~0.offset |main_#t~malloc8.offset|) (<= 8 (select |#length| main_~item~0.base)) (= 0 |main_#t~malloc8.offset|)), 17930#(and (or (and (= 0 main_~item~0.offset) (<= 8 (select |#length| main_~item~0.base))) (= main_~lItem~0.base main_~data~0.base)) (= main_~lItem~0.offset 0) (or (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.offset main_~lItem~0.offset))), 17931#(and (or (not (= main_~lItem~0.base main_~data~0.base)) (and (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset)) (<= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.offset (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~data~0.offset)))) (= main_~lItem~0.offset 0) (or (and (= 0 main_~item~0.offset) (<= 8 (select |#length| main_~item~0.base)) (= main_~lItem~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset))) (= main_~lItem~0.base main_~data~0.base))), 17932#(or (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (and (= main_~data~0.offset (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 17933#(or (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (and (= main_~data~0.base |main_#t~mem14.base|) (= |main_#t~mem14.offset| main_~data~0.offset))), 17934#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))), 17935#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) (+ |main_#t~mem16.offset| 4))) (= |main_#t~mem16.offset| 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) (+ |main_#t~mem16.offset| 4))))), 17936#(and (= 0 |main_#t~mem17.offset|) (<= 8 (select |#length| |main_#t~mem17.base|))), 17937#(and (= main_~item2~0.offset 0) (<= 8 (select |#length| main_~item2~0.base))), 17919#true] [2018-02-02 10:10:18,148 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:18,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:10:18,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:10:18,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:10:18,148 INFO L87 Difference]: Start difference. First operand 247 states and 309 transitions. Second operand 19 states. [2018-02-02 10:10:18,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:18,967 INFO L93 Difference]: Finished difference Result 325 states and 375 transitions. [2018-02-02 10:10:18,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:10:18,968 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 73 [2018-02-02 10:10:18,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:18,968 INFO L225 Difference]: With dead ends: 325 [2018-02-02 10:10:18,968 INFO L226 Difference]: Without dead ends: 325 [2018-02-02 10:10:18,969 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=338, Invalid=1384, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 10:10:18,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-02-02 10:10:18,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 259. [2018-02-02 10:10:18,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-02-02 10:10:18,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 329 transitions. [2018-02-02 10:10:18,971 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 329 transitions. Word has length 73 [2018-02-02 10:10:18,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:18,971 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 329 transitions. [2018-02-02 10:10:18,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:10:18,971 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 329 transitions. [2018-02-02 10:10:18,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 10:10:18,971 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:18,971 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-02-02 10:10:18,971 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:10:18,971 INFO L82 PathProgramCache]: Analyzing trace with hash 101816595, now seen corresponding path program 1 times [2018-02-02 10:10:18,972 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:18,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:10:19,383 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:19,384 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:19,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:10:19,384 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:19,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:19,384 INFO L182 omatonBuilderFactory]: Interpolants [18570#true, 18571#false, 18572#(and (= 8 (select |#length| |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|)), 18573#(and (= 8 (select |#length| main_~lItem~0.base)) (= 0 main_~lItem~0.offset)), 18574#(and (= 8 (select |#length| main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (= main_~lItem~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset))), 18575#(and (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= 8 (select |#length| main_~lItem~0.base)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (= (select |#valid| main_~lItem~0.base) 1) (= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)), 18576#(and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= (select |#valid| main_~data~0.base) 1)), 18577#(and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= main_~data~0.base |main_#t~malloc3.base|)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= (select |#valid| main_~data~0.base) 1)), 18578#(and (= 8 (select |#length| main_~data~0.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 0)) main_~data~0.base) main_~data~0.offset)) (not (= main_~item~0.base main_~data~0.base)) (= (select |#valid| main_~data~0.base) 1) (= main_~data~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_~data~0.base) main_~data~0.offset))), 18579#(and (= 8 (select |#length| main_~data~0.base)) (not (= main_~data~0.base |main_#t~malloc8.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 18580#(and (= 8 (select |#length| main_~data~0.base)) (not (= main_~lItem~0.base main_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 18581#(and (= 8 (select |#length| main_~data~0.base)) (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.base |main_#t~mem10.base|) (= 0 |main_#t~mem10.offset|)), 18582#(and (= 8 (select |#length| main_~data~0.base)) (not (= main_~lItem~0.base main_~data~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~data~0.base (store (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset main_~lItem~0.offset)) main_~lItem~0.base) main_~lItem~0.offset)) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~data~0.base (store (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset main_~lItem~0.base)) main_~lItem~0.base) main_~lItem~0.offset))), 18583#(and (= 8 (select |#length| main_~data~0.base)) (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= main_~lItem~0.offset (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (= main_~lItem~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset))), 18584#(and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))), 18585#(and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) |main_#t~mem18.offset|))), 18586#(and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~lItem~0.base) main_~lItem~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~lItem~0.base) main_~lItem~0.offset))), 18587#(and (= 0 |main_#t~mem20.offset|) (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base |main_#t~mem20.base|)), 18588#(and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 18589#(and (= 0 |main_#t~mem30.offset|) (= 8 (select |#length| |main_#t~mem30.base|))), 18590#(and (= main_~data~0.offset 0) (= (select |#length| main_~data~0.base) 8))] [2018-02-02 10:10:19,384 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:19,384 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:10:19,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:10:19,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:10:19,385 INFO L87 Difference]: Start difference. First operand 259 states and 329 transitions. Second operand 21 states. [2018-02-02 10:10:20,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:20,513 INFO L93 Difference]: Finished difference Result 427 states and 520 transitions. [2018-02-02 10:10:20,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:10:20,514 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 78 [2018-02-02 10:10:20,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:20,515 INFO L225 Difference]: With dead ends: 427 [2018-02-02 10:10:20,515 INFO L226 Difference]: Without dead ends: 427 [2018-02-02 10:10:20,515 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=340, Invalid=1466, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:10:20,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-02-02 10:10:20,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 370. [2018-02-02 10:10:20,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-02-02 10:10:20,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 481 transitions. [2018-02-02 10:10:20,518 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 481 transitions. Word has length 78 [2018-02-02 10:10:20,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:20,518 INFO L432 AbstractCegarLoop]: Abstraction has 370 states and 481 transitions. [2018-02-02 10:10:20,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:10:20,518 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 481 transitions. [2018-02-02 10:10:20,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 10:10:20,518 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:20,518 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-02-02 10:10:20,518 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:10:20,519 INFO L82 PathProgramCache]: Analyzing trace with hash 101816594, now seen corresponding path program 1 times [2018-02-02 10:10:20,519 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:20,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:20,998 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:20,998 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:20,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:10:20,998 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:20,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:20,998 INFO L182 omatonBuilderFactory]: Interpolants [19456#(or (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= 0 (select |#valid| main_~data~0.base))), 19457#(= 1 (select |#valid| |main_#t~mem30.base|)), 19458#(= 1 (select |#valid| main_~data~0.base)), 19436#true, 19437#false, 19438#(and (not (= 0 |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|)), 19439#(and (not (= 0 main_~lItem~0.base)) (= 0 main_~lItem~0.offset)), 19440#(and (not (= 0 main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= 0 main_~lItem~0.offset) (= (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset) main_~lItem~0.base)), 19441#(and (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (not (= 0 main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= 0 main_~data~0.offset) (= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)), 19442#(and (= 0 main_~data~0.offset) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= (select |#valid| main_~data~0.base) 1)), 19443#(and (= 0 main_~data~0.offset) (not (= 0 main_~data~0.base)) (not (= main_~data~0.base |main_#t~malloc3.base|)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 19444#(and (= 0 main_~data~0.offset) (not (= main_~item~0.base main_~data~0.base)) (not (= 0 main_~data~0.base)) (= main_~data~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_~data~0.base) main_~data~0.offset))), 19445#(and (= 0 main_~data~0.offset) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 19446#(and (= 0 main_~data~0.offset) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= 0 |main_#t~malloc8.offset|)), 19447#(or (and (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (and (not (= 0 main_~lItem~0.base)) (<= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base))), 19448#(or (and (not (= 0 main_~lItem~0.base)) (<= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)) (and (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.base |main_#t~mem10.base|))), 19449#(or (and (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~data~0.base (store (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset main_~lItem~0.base)) main_~lItem~0.base) main_~lItem~0.offset))) (and (not (= 0 main_~lItem~0.base)) (<= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base))), 19450#(or (and (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset)) (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset))) (<= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)) (and (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= main_~lItem~0.offset (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset)) (= main_~lItem~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset)))), 19451#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))), 19452#(or (= main_~data~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (and (not (= 0 |main_#t~mem18.base|)) (= main_~data~0.base |main_#t~mem18.base|))), 19453#(or (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~lItem~0.base) main_~lItem~0.offset)) (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base))), 19454#(or (= main_~data~0.base |main_#t~mem20.base|) (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base))), 19455#(or (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base)))] [2018-02-02 10:10:20,999 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:20,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:10:20,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:10:20,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:10:20,999 INFO L87 Difference]: Start difference. First operand 370 states and 481 transitions. Second operand 23 states. [2018-02-02 10:10:21,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:21,836 INFO L93 Difference]: Finished difference Result 385 states and 496 transitions. [2018-02-02 10:10:21,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:10:21,836 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 78 [2018-02-02 10:10:21,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:21,837 INFO L225 Difference]: With dead ends: 385 [2018-02-02 10:10:21,837 INFO L226 Difference]: Without dead ends: 385 [2018-02-02 10:10:21,837 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=315, Invalid=1491, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:10:21,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-02-02 10:10:21,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 370. [2018-02-02 10:10:21,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-02-02 10:10:21,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 480 transitions. [2018-02-02 10:10:21,840 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 480 transitions. Word has length 78 [2018-02-02 10:10:21,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:21,840 INFO L432 AbstractCegarLoop]: Abstraction has 370 states and 480 transitions. [2018-02-02 10:10:21,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:10:21,840 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 480 transitions. [2018-02-02 10:10:21,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-02 10:10:21,841 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:21,841 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-02-02 10:10:21,841 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:10:21,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1376143518, now seen corresponding path program 1 times [2018-02-02 10:10:21,841 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:21,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:22,689 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:22,689 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:22,689 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:10:22,689 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:22,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:22,689 INFO L182 omatonBuilderFactory]: Interpolants [20258#true, 20259#false, 20260#(and (not (= 0 |main_#t~malloc8.base|)) (= 8 (select |#length| |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|)), 20261#(and (= 8 (select |#length| main_~lItem~0.base)) (not (= 0 main_~lItem~0.base)) (= 0 main_~lItem~0.offset)), 20262#(and (= 8 (select |#length| main_~lItem~0.base)) (not (= 0 main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (= 0 main_~lItem~0.offset) (= main_~lItem~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset))), 20263#(and (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= 8 (select |#length| main_~lItem~0.base)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (not (= 0 main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= 0 main_~data~0.offset) (= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)), 20264#(and (= 8 (select |#length| main_~data~0.base)) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= (select |#valid| main_~data~0.base) 1)), 20265#(and (= 8 (select |#length| main_~data~0.base)) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= 0 main_~data~0.base)) (not (= main_~data~0.base |main_#t~malloc3.base|)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 20266#(and (= 8 (select |#length| main_~data~0.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 0)) main_~data~0.base) main_~data~0.offset)) (= 0 main_~data~0.offset) (not (= main_~item~0.base main_~data~0.base)) (not (= 0 main_~data~0.base)) (= main_~data~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_~data~0.base) main_~data~0.offset))), 20267#(and (= 8 (select |#length| main_~data~0.base)) (= 0 main_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 20268#(or (and (= main_~data~0.base |main_#t~malloc8.base|) (not (= 0 |main_#t~malloc8.base|)) (= 0 main_~data~0.offset) (= 0 |main_#t~malloc8.offset|)) (and (= 8 (select |#length| main_~data~0.base)) (not (= main_~data~0.base |main_#t~malloc8.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= 0 |main_#t~malloc8.offset|))), 20269#(or (and (= 8 (select |#length| main_~data~0.base)) (not (= main_~lItem~0.base main_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= 0 main_~lItem~0.offset) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (and (not (= main_~data~0.offset (+ main_~lItem~0.offset 4))) (not (= 0 main_~lItem~0.base)) (= main_~data~0.base main_~lItem~0.base))), 20270#(or (and (not (= main_~data~0.offset (+ main_~lItem~0.offset 4))) (not (= 0 main_~lItem~0.base)) (= main_~data~0.base main_~lItem~0.base)) (and (= 8 (select |#length| main_~data~0.base)) (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.base |main_#t~mem10.base|) (= 0 main_~lItem~0.offset) (= 0 |main_#t~mem10.offset|))), 20271#(or (and (= 8 (select |#length| main_~data~0.base)) (not (= main_~lItem~0.base main_~data~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~data~0.base (store (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset main_~lItem~0.offset)) main_~lItem~0.base) main_~lItem~0.offset)) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~data~0.base (store (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset main_~lItem~0.base)) main_~lItem~0.base) main_~lItem~0.offset)) (= 0 main_~lItem~0.offset)) (and (not (= main_~data~0.offset (+ main_~lItem~0.offset 4))) (not (= 0 main_~lItem~0.base)) (= main_~data~0.base main_~lItem~0.base))), 20272#(or (and (not (= main_~data~0.offset (+ main_~lItem~0.offset 4))) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset)) (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset))) (= main_~data~0.base main_~lItem~0.base)) (and (= 8 (select |#length| main_~data~0.base)) (not (= main_~lItem~0.base main_~data~0.base)) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset) main_~lItem~0.offset)) (= main_~lItem~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) (= main_~lItem~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset)))), 20273#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))), 20274#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (= |main_#t~mem16.offset| 0) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))))), 20275#(or (and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 20276#(or (and (not (= 0 |main_#t~mem18.base|)) (= main_~data~0.base |main_#t~mem18.base|)) (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) |main_#t~mem18.offset|)))), 20277#(or (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~lItem~0.base) main_~lItem~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~lItem~0.base) main_~lItem~0.offset))) (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base))), 20278#(or (and (= 0 |main_#t~mem20.offset|) (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base |main_#t~mem20.base|)) (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base))), 20279#(or (and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base))), 20280#(or (and (= 8 (select |#length| main_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 0 (select |#valid| main_~data~0.base))), 20281#(or (and (= 8 (select |#length| main_~data~0.base)) (= main_~data~0.base main_~dst~0.base) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item~0.base) main_~data~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~dst~0.base) main_~dst~0.offset main_~item~0.offset) main_~data~0.offset)) (not (= main_~data~0.offset main_~dst~0.offset))) (= 0 (select |#valid| main_~data~0.base))), 20282#(and (= 0 |main_#t~mem30.offset|) (= 8 (select |#length| |main_#t~mem30.base|))), 20283#(and (= main_~data~0.offset 0) (= (select |#length| main_~data~0.base) 8))] [2018-02-02 10:10:22,690 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:22,690 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:10:22,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:10:22,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:10:22,690 INFO L87 Difference]: Start difference. First operand 370 states and 480 transitions. Second operand 26 states. [2018-02-02 10:10:24,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:24,840 INFO L93 Difference]: Finished difference Result 519 states and 654 transitions. [2018-02-02 10:10:24,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:10:24,840 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 79 [2018-02-02 10:10:24,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:24,841 INFO L225 Difference]: With dead ends: 519 [2018-02-02 10:10:24,841 INFO L226 Difference]: Without dead ends: 519 [2018-02-02 10:10:24,841 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=421, Invalid=2129, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 10:10:24,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-02-02 10:10:24,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 398. [2018-02-02 10:10:24,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-02-02 10:10:24,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 514 transitions. [2018-02-02 10:10:24,845 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 514 transitions. Word has length 79 [2018-02-02 10:10:24,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:24,845 INFO L432 AbstractCegarLoop]: Abstraction has 398 states and 514 transitions. [2018-02-02 10:10:24,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:10:24,845 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 514 transitions. [2018-02-02 10:10:24,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-02 10:10:24,845 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:24,845 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-02-02 10:10:24,845 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:10:24,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1376143517, now seen corresponding path program 1 times [2018-02-02 10:10:24,846 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:24,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:25,526 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:25,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:10:25,526 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:25,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:25,526 INFO L182 omatonBuilderFactory]: Interpolants [21255#true, 21256#false, 21257#(and (not (= 0 |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|)), 21258#(and (not (= 0 main_~lItem~0.base)) (= 0 main_~lItem~0.offset)), 21259#(and (not (= 0 main_~lItem~0.base)) (= (select |#valid| main_~lItem~0.base) 1) (= 0 main_~lItem~0.offset) (= main_~lItem~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset))), 21260#(and (= main_~data~0.offset 0) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= (select |#valid| main_~lItem~0.base) 1) (not (= 0 main_~data~0.base)) (= main_~data~0.offset main_~lItem~0.offset) (= main_~data~0.base main_~lItem~0.base)), 21261#(and (= main_~data~0.offset 0) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= (select |#valid| main_~data~0.base) 1)), 21262#(and (= main_~data~0.offset 0) (not (= 0 main_~data~0.base)) (not (= main_~data~0.base |main_#t~malloc3.base|)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 21263#(and (= main_~data~0.offset 0) (not (= main_~item~0.base main_~data~0.base)) (not (= 0 main_~data~0.base)) (= main_~data~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_~data~0.base) main_~data~0.offset))), 21264#(and (= main_~data~0.offset 0) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))), 21265#(and (= main_~data~0.offset 0) (not (= 0 main_~data~0.base)) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= 0 |main_#t~malloc8.offset|)), 21266#(and (= main_~data~0.offset 0) (or (= main_~lItem~0.base main_~data~0.base) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= 0 main_~lItem~0.offset) (or (not (= main_~lItem~0.base main_~data~0.base)) (not (= 0 main_~data~0.base)))), 21267#(and (= main_~data~0.offset 0) (or (= main_~data~0.base |main_#t~mem10.base|) (= main_~lItem~0.base main_~data~0.base)) (= 0 main_~lItem~0.offset) (or (not (= main_~lItem~0.base main_~data~0.base)) (not (= 0 main_~data~0.base)))), 21268#(and (= main_~data~0.offset 0) (= main_~data~0.base (select (select (store |#memory_$Pointer$.base| main_~data~0.base (store (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset main_~lItem~0.base)) main_~lItem~0.base) main_~lItem~0.offset)) (= 0 main_~lItem~0.offset) (or (not (= main_~lItem~0.base main_~data~0.base)) (not (= 0 main_~data~0.base)))), 21269#(and (or (and (= main_~data~0.offset 0) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~lItem~0.offset)) (= main_~lItem~0.base (select (select (store |#memory_$Pointer$.base| main_~lItem~0.base (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base)) main_~data~0.base) main_~data~0.offset)) (= main_~lItem~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~lItem~0.base (store (select |#memory_$Pointer$.offset| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.offset)) main_~data~0.base) main_~data~0.offset))) (= main_~lItem~0.base main_~data~0.base)) (or (and (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset)) (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~lItem~0.base) (+ main_~lItem~0.offset 4) main_~item~0.base) main_~data~0.offset)))) (not (= main_~lItem~0.base main_~data~0.base))) (<= main_~data~0.offset main_~lItem~0.offset)), 21270#(or (and (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 0)) (= main_~data~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 21271#(or (and (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (= main_~data~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)) (or (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 0)) (= main_~data~0.base |main_#t~mem14.base|))) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 21272#(or (and (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))), 21273#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (and (= |main_#t~mem16.offset| 0) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset))))), 21274#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset))) (= main_~data~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (select (select |#memory_$Pointer$.offset| main_~data~0.base) main_~data~0.offset)))), 21275#(or (= main_~data~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (and (not (= 0 |main_#t~mem18.base|)) (= main_~data~0.base |main_#t~mem18.base|))), 21276#(or (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~lItem~0.base) main_~lItem~0.offset)) (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base))), 21277#(or (= main_~data~0.base |main_#t~mem20.base|) (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base))), 21278#(or (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (and (not (= 0 main_~lItem~0.base)) (= main_~lItem~0.base main_~data~0.base))), 21279#(or (= main_~data~0.base (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)) (= 0 (select |#valid| main_~data~0.base))), 21280#(or (and (= main_~data~0.base main_~dst~0.base) (= main_~data~0.base (select (store (select |#memory_$Pointer$.base| main_~dst~0.base) main_~dst~0.offset main_~item~0.base) main_~data~0.offset)) (not (= main_~data~0.offset main_~dst~0.offset))) (= 0 (select |#valid| main_~data~0.base))), 21281#(= 1 (select |#valid| |main_#t~mem30.base|)), 21282#(= 1 (select |#valid| main_~data~0.base))] [2018-02-02 10:10:25,526 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:25,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:10:25,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:10:25,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:10:25,527 INFO L87 Difference]: Start difference. First operand 398 states and 514 transitions. Second operand 28 states. [2018-02-02 10:10:26,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:26,791 INFO L93 Difference]: Finished difference Result 431 states and 552 transitions. [2018-02-02 10:10:26,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:10:26,791 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 79 [2018-02-02 10:10:26,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:26,792 INFO L225 Difference]: With dead ends: 431 [2018-02-02 10:10:26,792 INFO L226 Difference]: Without dead ends: 431 [2018-02-02 10:10:26,793 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=454, Invalid=2408, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 10:10:26,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-02-02 10:10:26,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 393. [2018-02-02 10:10:26,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-02-02 10:10:26,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 508 transitions. [2018-02-02 10:10:26,796 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 508 transitions. Word has length 79 [2018-02-02 10:10:26,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:26,796 INFO L432 AbstractCegarLoop]: Abstraction has 393 states and 508 transitions. [2018-02-02 10:10:26,796 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 10:10:26,796 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 508 transitions. [2018-02-02 10:10:26,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 10:10:26,796 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:26,796 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 10:10:26,796 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:10:26,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1577747984, now seen corresponding path program 1 times [2018-02-02 10:10:26,797 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:26,831 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:27,271 ERROR L119 erpolLogProxyWrapper]: Could not assert interpolant [2018-02-02 10:10:27,272 ERROR L119 erpolLogProxyWrapper]: Interpolant 68 not inductive: (Check returned sat) [2018-02-02 10:10:27,273 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Asserted terms must be closed at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:654) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:956) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 10:10:27,278 INFO L168 Benchmark]: Toolchain (without parser) took 33753.29 ms. Allocated memory was 403.2 MB in the beginning and 1.2 GB in the end (delta: 820.5 MB). Free memory was 360.1 MB in the beginning and 1.1 GB in the end (delta: -769.1 MB). Peak memory consumption was 785.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:10:27,279 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 403.2 MB. Free memory is still 366.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:10:27,279 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.49 ms. Allocated memory is still 403.2 MB. Free memory was 360.1 MB in the beginning and 348.2 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:10:27,279 INFO L168 Benchmark]: Boogie Preprocessor took 28.10 ms. Allocated memory is still 403.2 MB. Free memory was 348.2 MB in the beginning and 346.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:10:27,279 INFO L168 Benchmark]: RCFGBuilder took 408.77 ms. Allocated memory is still 403.2 MB. Free memory was 346.8 MB in the beginning and 304.9 MB in the end (delta: 41.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:10:27,279 INFO L168 Benchmark]: TraceAbstraction took 33143.80 ms. Allocated memory was 403.2 MB in the beginning and 1.2 GB in the end (delta: 820.5 MB). Free memory was 304.9 MB in the beginning and 1.1 GB in the end (delta: -824.2 MB). Peak memory consumption was 730.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:10:27,281 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.18 ms. Allocated memory is still 403.2 MB. Free memory is still 366.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 169.49 ms. Allocated memory is still 403.2 MB. Free memory was 360.1 MB in the beginning and 348.2 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.10 ms. Allocated memory is still 403.2 MB. Free memory was 348.2 MB in the beginning and 346.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 408.77 ms. Allocated memory is still 403.2 MB. Free memory was 346.8 MB in the beginning and 304.9 MB in the end (delta: 41.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 33143.80 ms. Allocated memory was 403.2 MB in the beginning and 1.2 GB in the end (delta: 820.5 MB). Free memory was 304.9 MB in the beginning and 1.1 GB in the end (delta: -824.2 MB). Peak memory consumption was 730.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Asserted terms must be closed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Asserted terms must be closed: de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:654) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0513_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-10-27-287.csv Received shutdown request...