java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-queue_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:31:32,433 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:31:32,435 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:31:32,447 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:31:32,447 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:31:32,448 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:31:32,449 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:31:32,451 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:31:32,452 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:31:32,453 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:31:32,454 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:31:32,454 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:31:32,455 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:31:32,456 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:31:32,457 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:31:32,458 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:31:32,460 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:31:32,462 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:31:32,463 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:31:32,464 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:31:32,466 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:31:32,466 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:31:32,466 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:31:32,467 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:31:32,468 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:31:32,468 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:31:32,469 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:31:32,469 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:31:32,469 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:31:32,469 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:31:32,470 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:31:32,470 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:31:32,479 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:31:32,479 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:31:32,479 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:31:32,480 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:31:32,480 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:31:32,480 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:31:32,480 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:31:32,480 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:31:32,480 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:31:32,480 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:31:32,480 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:31:32,480 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:31:32,480 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:31:32,481 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:31:32,481 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:31:32,481 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:31:32,481 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:31:32,481 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:31:32,481 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:31:32,481 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:31:32,481 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:31:32,481 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:31:32,482 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:31:32,509 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:31:32,517 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:31:32,519 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:31:32,520 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:31:32,520 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:31:32,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-queue_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:31:32,657 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:31:32,658 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:31:32,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:31:32,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:31:32,666 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:31:32,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:31:32" (1/1) ... [2018-02-02 10:31:32,669 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@294b662f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:31:32, skipping insertion in model container [2018-02-02 10:31:32,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:31:32" (1/1) ... [2018-02-02 10:31:32,686 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:31:32,722 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:31:32,824 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:31:32,845 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:31:32,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:31:32 WrapperNode [2018-02-02 10:31:32,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:31:32,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:31:32,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:31:32,854 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:31:32,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:31:32" (1/1) ... [2018-02-02 10:31:32,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:31:32" (1/1) ... [2018-02-02 10:31:32,871 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:31:32" (1/1) ... [2018-02-02 10:31:32,871 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:31:32" (1/1) ... [2018-02-02 10:31:32,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:31:32" (1/1) ... [2018-02-02 10:31:32,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:31:32" (1/1) ... [2018-02-02 10:31:32,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:31:32" (1/1) ... [2018-02-02 10:31:32,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:31:32,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:31:32,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:31:32,887 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:31:32,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:31:32" (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:31:32,928 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:31:32,929 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:31:32,929 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:31:32,929 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:31:32,929 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:31:32,929 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:31:32,929 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:31:32,929 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:31:32,929 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:31:32,929 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:31:32,929 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:31:32,929 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:31:32,930 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:31:32,930 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 10:31:32,930 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:31:32,930 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:31:32,930 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:31:33,258 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:31:33,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:31:33 BoogieIcfgContainer [2018-02-02 10:31:33,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:31:33,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:31:33,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:31:33,261 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:31:33,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:31:32" (1/3) ... [2018-02-02 10:31:33,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6c73af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:31:33, skipping insertion in model container [2018-02-02 10:31:33,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:31:32" (2/3) ... [2018-02-02 10:31:33,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6c73af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:31:33, skipping insertion in model container [2018-02-02 10:31:33,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:31:33" (3/3) ... [2018-02-02 10:31:33,263 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-queue_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:31:33,269 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:31:33,274 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-02-02 10:31:33,298 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:31:33,298 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:31:33,298 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:31:33,298 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:31:33,298 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:31:33,299 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:31:33,299 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:31:33,299 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:31:33,300 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:31:33,311 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2018-02-02 10:31:33,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:31:33,319 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:33,319 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:33,319 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:33,322 INFO L82 PathProgramCache]: Analyzing trace with hash 865717012, now seen corresponding path program 1 times [2018-02-02 10:31:33,356 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:33,385 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:33,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:33,444 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:33,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:31:33,445 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:33,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:33,446 INFO L182 omatonBuilderFactory]: Interpolants [165#true, 166#false, 167#(= 1 (select |#valid| |main_#t~malloc0.base|)), 168#(= 1 (select |#valid| main_~head~0.base))] [2018-02-02 10:31:33,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:33,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:31:33,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:31:33,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:31:33,534 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 4 states. [2018-02-02 10:31:33,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:33,707 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2018-02-02 10:31:33,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:31:33,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:31:33,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:33,719 INFO L225 Difference]: With dead ends: 164 [2018-02-02 10:31:33,719 INFO L226 Difference]: Without dead ends: 160 [2018-02-02 10:31:33,721 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:31:33,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-02 10:31:33,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 152. [2018-02-02 10:31:33,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 10:31:33,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2018-02-02 10:31:33,750 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 8 [2018-02-02 10:31:33,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:33,750 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2018-02-02 10:31:33,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:31:33,750 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2018-02-02 10:31:33,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:31:33,750 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:33,750 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:33,751 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:33,751 INFO L82 PathProgramCache]: Analyzing trace with hash 865717013, now seen corresponding path program 1 times [2018-02-02 10:31:33,752 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:33,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:33,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:33,806 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:33,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:31:33,806 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:33,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:33,807 INFO L182 omatonBuilderFactory]: Interpolants [487#true, 488#false, 489#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 490#(and (= (select |#length| main_~head~0.base) 8) (= main_~head~0.offset 0))] [2018-02-02 10:31:33,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:33,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:31:33,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:31:33,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:31:33,809 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand 4 states. [2018-02-02 10:31:33,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:33,913 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2018-02-02 10:31:33,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:31:33,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:31:33,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:33,915 INFO L225 Difference]: With dead ends: 146 [2018-02-02 10:31:33,915 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 10:31:33,916 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:31:33,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 10:31:33,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2018-02-02 10:31:33,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 10:31:33,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2018-02-02 10:31:33,924 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 8 [2018-02-02 10:31:33,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:33,924 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2018-02-02 10:31:33,925 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:31:33,925 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2018-02-02 10:31:33,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:31:33,925 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:33,925 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:33,925 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:33,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1721247779, now seen corresponding path program 1 times [2018-02-02 10:31:33,927 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:33,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:34,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:34,003 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:34,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:31:34,004 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:34,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:34,005 INFO L182 omatonBuilderFactory]: Interpolants [784#(= 1 (select |#valid| main_~item~0.base)), 781#true, 782#false, 783#(= (select |#valid| main_~head~0.base) 1)] [2018-02-02 10:31:34,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:34,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:31:34,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:31:34,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:31:34,006 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 4 states. [2018-02-02 10:31:34,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:34,100 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2018-02-02 10:31:34,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:31:34,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 10:31:34,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:34,101 INFO L225 Difference]: With dead ends: 147 [2018-02-02 10:31:34,101 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 10:31:34,102 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:31:34,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 10:31:34,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 142. [2018-02-02 10:31:34,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 10:31:34,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 155 transitions. [2018-02-02 10:31:34,111 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 155 transitions. Word has length 15 [2018-02-02 10:31:34,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:34,111 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 155 transitions. [2018-02-02 10:31:34,111 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:31:34,111 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 155 transitions. [2018-02-02 10:31:34,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:31:34,111 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:34,111 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:34,111 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:34,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1721247778, now seen corresponding path program 1 times [2018-02-02 10:31:34,112 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:34,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:34,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:34,196 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:34,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:31:34,197 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:34,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:31:34,197 INFO L182 omatonBuilderFactory]: Interpolants [1076#true, 1077#false, 1078#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 1079#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base))), 1080#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 1081#(and (= 8 (select |#length| main_~item~0.base)) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.offset 0)), 1082#(and (= (select |#length| main_~item~0.base) 8) (= main_~item~0.offset 0))] [2018-02-02 10:31:34,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:31:34,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:31:34,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:31:34,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:31:34,198 INFO L87 Difference]: Start difference. First operand 142 states and 155 transitions. Second operand 7 states. [2018-02-02 10:31:34,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:34,419 INFO L93 Difference]: Finished difference Result 223 states and 238 transitions. [2018-02-02 10:31:34,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:31:34,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-02-02 10:31:34,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:34,421 INFO L225 Difference]: With dead ends: 223 [2018-02-02 10:31:34,421 INFO L226 Difference]: Without dead ends: 223 [2018-02-02 10:31:34,421 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:31:34,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-02 10:31:34,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 148. [2018-02-02 10:31:34,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 10:31:34,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 161 transitions. [2018-02-02 10:31:34,428 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 161 transitions. Word has length 15 [2018-02-02 10:31:34,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:34,429 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 161 transitions. [2018-02-02 10:31:34,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:31:34,429 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 161 transitions. [2018-02-02 10:31:34,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:31:34,429 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:34,430 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:34,430 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:34,430 INFO L82 PathProgramCache]: Analyzing trace with hash -78043106, now seen corresponding path program 1 times [2018-02-02 10:31:34,431 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:34,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:34,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:34,479 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:34,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:31:34,479 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:34,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:34,480 INFO L182 omatonBuilderFactory]: Interpolants [1464#true, 1465#false, 1466#(= 1 (select |#valid| |main_#t~malloc4.base|)), 1467#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))), 1468#(= 1 (select |#valid| |main_#t~mem6.base|)), 1469#(= 1 (select |#valid| main_~item~0.base))] [2018-02-02 10:31:34,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:34,480 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:31:34,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:31:34,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:31:34,480 INFO L87 Difference]: Start difference. First operand 148 states and 161 transitions. Second operand 6 states. [2018-02-02 10:31:34,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:34,676 INFO L93 Difference]: Finished difference Result 242 states and 260 transitions. [2018-02-02 10:31:34,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:31:34,676 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-02 10:31:34,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:34,677 INFO L225 Difference]: With dead ends: 242 [2018-02-02 10:31:34,677 INFO L226 Difference]: Without dead ends: 242 [2018-02-02 10:31:34,677 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:31:34,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-02 10:31:34,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 147. [2018-02-02 10:31:34,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 10:31:34,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 160 transitions. [2018-02-02 10:31:34,682 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 160 transitions. Word has length 18 [2018-02-02 10:31:34,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:34,683 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 160 transitions. [2018-02-02 10:31:34,683 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:31:34,683 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 160 transitions. [2018-02-02 10:31:34,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:31:34,683 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:34,684 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:34,684 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:34,684 INFO L82 PathProgramCache]: Analyzing trace with hash -78043105, now seen corresponding path program 1 times [2018-02-02 10:31:34,685 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:34,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:34,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:34,745 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:34,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:31:34,745 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:34,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:31:34,746 INFO L182 omatonBuilderFactory]: Interpolants [1866#true, 1867#false, 1868#(and (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 1869#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))), 1870#(and (= 0 |main_#t~mem6.offset|) (= 8 (select |#length| |main_#t~mem6.base|))), 1871#(and (= (select |#length| main_~item~0.base) 8) (= main_~item~0.offset 0))] [2018-02-02 10:31:34,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:31:34,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:31:34,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:31:34,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:31:34,747 INFO L87 Difference]: Start difference. First operand 147 states and 160 transitions. Second operand 6 states. [2018-02-02 10:31:34,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:34,919 INFO L93 Difference]: Finished difference Result 244 states and 265 transitions. [2018-02-02 10:31:34,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:31:34,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-02 10:31:34,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:34,920 INFO L225 Difference]: With dead ends: 244 [2018-02-02 10:31:34,920 INFO L226 Difference]: Without dead ends: 244 [2018-02-02 10:31:34,921 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:31:34,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-02 10:31:34,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 135. [2018-02-02 10:31:34,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 10:31:34,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2018-02-02 10:31:34,923 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 18 [2018-02-02 10:31:34,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:34,924 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2018-02-02 10:31:34,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:31:34,924 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2018-02-02 10:31:34,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:31:34,924 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:34,924 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:34,924 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:34,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1676211553, now seen corresponding path program 1 times [2018-02-02 10:31:34,925 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:34,931 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:34,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:34,995 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:34,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:31:34,996 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:34,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:34,996 INFO L182 omatonBuilderFactory]: Interpolants [2262#true, 2263#false, 2264#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 2265#(and (= 0 |main_#t~mem25.base|) (= 0 |main_#t~mem25.offset|)), 2266#(and (= 0 main_~item~0.base) (= main_~item~0.offset 0)), 2267#(not |main_#t~short27|)] [2018-02-02 10:31:34,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:34,996 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:31:34,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:31:34,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:31:34,997 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand 6 states. [2018-02-02 10:31:35,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:35,134 INFO L93 Difference]: Finished difference Result 218 states and 234 transitions. [2018-02-02 10:31:35,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:31:35,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-02-02 10:31:35,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:35,136 INFO L225 Difference]: With dead ends: 218 [2018-02-02 10:31:35,136 INFO L226 Difference]: Without dead ends: 218 [2018-02-02 10:31:35,137 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:31:35,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-02 10:31:35,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 194. [2018-02-02 10:31:35,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 10:31:35,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 224 transitions. [2018-02-02 10:31:35,144 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 224 transitions. Word has length 28 [2018-02-02 10:31:35,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:35,144 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 224 transitions. [2018-02-02 10:31:35,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:31:35,144 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 224 transitions. [2018-02-02 10:31:35,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:31:35,145 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:35,145 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:35,145 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:35,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1668173361, now seen corresponding path program 1 times [2018-02-02 10:31:35,146 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:35,152 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:35,184 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:35,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:31:35,185 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:35,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:35,185 INFO L182 omatonBuilderFactory]: Interpolants [2688#(= 0 main_~status~0), 2686#true, 2687#false] [2018-02-02 10:31:35,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:35,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:31:35,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:31:35,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:31:35,186 INFO L87 Difference]: Start difference. First operand 194 states and 224 transitions. Second operand 3 states. [2018-02-02 10:31:35,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:35,219 INFO L93 Difference]: Finished difference Result 174 states and 188 transitions. [2018-02-02 10:31:35,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:31:35,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-02-02 10:31:35,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:35,221 INFO L225 Difference]: With dead ends: 174 [2018-02-02 10:31:35,221 INFO L226 Difference]: Without dead ends: 174 [2018-02-02 10:31:35,221 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:31:35,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-02 10:31:35,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 156. [2018-02-02 10:31:35,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 10:31:35,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 169 transitions. [2018-02-02 10:31:35,224 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 169 transitions. Word has length 28 [2018-02-02 10:31:35,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:35,225 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 169 transitions. [2018-02-02 10:31:35,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:31:35,225 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 169 transitions. [2018-02-02 10:31:35,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:31:35,226 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:35,226 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:35,226 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:35,226 INFO L82 PathProgramCache]: Analyzing trace with hash -366492937, now seen corresponding path program 1 times [2018-02-02 10:31:35,227 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:35,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:35,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:35,262 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:35,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:31:35,263 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:35,263 INFO L182 omatonBuilderFactory]: Interpolants [3019#true, 3020#false, 3021#(not (= 0 |main_#t~malloc0.base|)), 3022#(not (= 0 main_~head~0.base))] [2018-02-02 10:31:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:35,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:31:35,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:31:35,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:31:35,264 INFO L87 Difference]: Start difference. First operand 156 states and 169 transitions. Second operand 4 states. [2018-02-02 10:31:35,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:35,295 INFO L93 Difference]: Finished difference Result 156 states and 168 transitions. [2018-02-02 10:31:35,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:31:35,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-02 10:31:35,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:35,304 INFO L225 Difference]: With dead ends: 156 [2018-02-02 10:31:35,304 INFO L226 Difference]: Without dead ends: 156 [2018-02-02 10:31:35,304 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:31:35,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-02 10:31:35,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-02-02 10:31:35,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 10:31:35,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 168 transitions. [2018-02-02 10:31:35,308 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 168 transitions. Word has length 29 [2018-02-02 10:31:35,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:35,308 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 168 transitions. [2018-02-02 10:31:35,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:31:35,309 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 168 transitions. [2018-02-02 10:31:35,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 10:31:35,309 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:35,310 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:35,310 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:35,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1827708399, now seen corresponding path program 1 times [2018-02-02 10:31:35,311 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:35,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:35,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:35,378 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:35,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:31:35,378 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:35,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:35,379 INFO L182 omatonBuilderFactory]: Interpolants [3344#(and (= 0 main_~head~0.base) (= main_~head~0.offset 0)), 3337#true, 3338#false, 3339#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem25.base|) (= |main_#t~mem25.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 3340#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~item~0.base) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 3341#(or |main_#t~short27| (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 3342#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 3343#(and (= 0 |main_#t~mem31.offset|) (= 0 |main_#t~mem31.base|))] [2018-02-02 10:31:35,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:35,379 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:31:35,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:31:35,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:31:35,379 INFO L87 Difference]: Start difference. First operand 156 states and 168 transitions. Second operand 8 states. [2018-02-02 10:31:35,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:35,513 INFO L93 Difference]: Finished difference Result 185 states and 201 transitions. [2018-02-02 10:31:35,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:31:35,514 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-02-02 10:31:35,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:35,515 INFO L225 Difference]: With dead ends: 185 [2018-02-02 10:31:35,515 INFO L226 Difference]: Without dead ends: 185 [2018-02-02 10:31:35,515 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:31:35,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-02 10:31:35,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 167. [2018-02-02 10:31:35,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-02 10:31:35,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-02-02 10:31:35,517 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 33 [2018-02-02 10:31:35,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:35,517 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-02-02 10:31:35,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:31:35,518 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-02-02 10:31:35,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:31:35,518 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:35,519 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:35,519 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:35,519 INFO L82 PathProgramCache]: Analyzing trace with hash -824386741, now seen corresponding path program 1 times [2018-02-02 10:31:35,520 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:35,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:35,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:35,588 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:35,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:31:35,588 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:35,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:35,588 INFO L182 omatonBuilderFactory]: Interpolants [3705#true, 3706#false, 3707#(= |#valid| |old(#valid)|), 3708#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|))), 3709#(and (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|)), 3710#(and (= (store |#valid| main_~item~0.base 0) |old(#valid)|) (not (= 0 main_~item~0.base)))] [2018-02-02 10:31:35,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:35,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:31:35,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:31:35,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:31:35,589 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 6 states. [2018-02-02 10:31:35,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:35,735 INFO L93 Difference]: Finished difference Result 177 states and 189 transitions. [2018-02-02 10:31:35,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:31:35,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-02 10:31:35,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:35,737 INFO L225 Difference]: With dead ends: 177 [2018-02-02 10:31:35,737 INFO L226 Difference]: Without dead ends: 156 [2018-02-02 10:31:35,737 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:31:35,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-02 10:31:35,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-02-02 10:31:35,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 10:31:35,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 168 transitions. [2018-02-02 10:31:35,740 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 168 transitions. Word has length 34 [2018-02-02 10:31:35,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:35,740 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 168 transitions. [2018-02-02 10:31:35,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:31:35,740 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 168 transitions. [2018-02-02 10:31:35,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 10:31:35,741 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:35,741 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:35,741 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:35,741 INFO L82 PathProgramCache]: Analyzing trace with hash 794126113, now seen corresponding path program 1 times [2018-02-02 10:31:35,741 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:35,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:35,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:35,770 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:35,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:31:35,770 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:35,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:35,771 INFO L182 omatonBuilderFactory]: Interpolants [4052#true, 4053#false, 4054#(= main_~status~0 1)] [2018-02-02 10:31:35,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:35,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:31:35,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:31:35,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:31:35,772 INFO L87 Difference]: Start difference. First operand 156 states and 168 transitions. Second operand 3 states. [2018-02-02 10:31:35,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:35,801 INFO L93 Difference]: Finished difference Result 228 states and 246 transitions. [2018-02-02 10:31:35,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:31:35,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-02-02 10:31:35,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:35,803 INFO L225 Difference]: With dead ends: 228 [2018-02-02 10:31:35,803 INFO L226 Difference]: Without dead ends: 228 [2018-02-02 10:31:35,803 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:31:35,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-02-02 10:31:35,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 178. [2018-02-02 10:31:35,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 10:31:35,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 191 transitions. [2018-02-02 10:31:35,808 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 191 transitions. Word has length 45 [2018-02-02 10:31:35,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:35,808 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 191 transitions. [2018-02-02 10:31:35,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:31:35,808 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 191 transitions. [2018-02-02 10:31:35,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:31:35,809 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:35,809 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:35,810 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:35,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1588040751, now seen corresponding path program 1 times [2018-02-02 10:31:35,810 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:35,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:35,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:35,990 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:35,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:31:35,990 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:35,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:35,990 INFO L182 omatonBuilderFactory]: Interpolants [4461#true, 4462#false, 4463#(= (select |#valid| main_~head~0.base) 1), 4464#(and (= main_~item~0.offset main_~head~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 4465#(and (= main_~item~0.offset main_~head~0.offset) (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~item~0.base main_~head~0.base)), 4466#(and (= main_~item~0.offset main_~head~0.offset) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base)), 4467#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|))), 4468#(and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base))), 4469#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base))), 4470#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 4471#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 0)), 4472#(or (= 1 (select |#valid| |main_#t~mem25.base|)) (= main_~status~0 0)), 4473#(or (= main_~status~0 0) (= 1 (select |#valid| main_~item~0.base))), 4474#(or |main_#t~short29| (= 1 (select |#valid| main_~item~0.base))), 4475#(= 1 (select |#valid| main_~item~0.base))] [2018-02-02 10:31:35,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:35,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:31:35,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:31:35,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:31:35,991 INFO L87 Difference]: Start difference. First operand 178 states and 191 transitions. Second operand 15 states. [2018-02-02 10:31:36,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:36,529 INFO L93 Difference]: Finished difference Result 255 states and 274 transitions. [2018-02-02 10:31:36,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:31:36,530 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-02-02 10:31:36,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:36,530 INFO L225 Difference]: With dead ends: 255 [2018-02-02 10:31:36,530 INFO L226 Difference]: Without dead ends: 255 [2018-02-02 10:31:36,531 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=251, Invalid=871, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:31:36,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-02 10:31:36,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 211. [2018-02-02 10:31:36,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-02-02 10:31:36,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 229 transitions. [2018-02-02 10:31:36,533 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 229 transitions. Word has length 52 [2018-02-02 10:31:36,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:36,534 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 229 transitions. [2018-02-02 10:31:36,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:31:36,534 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 229 transitions. [2018-02-02 10:31:36,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:31:36,534 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:36,534 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:36,534 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:36,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1588040750, now seen corresponding path program 1 times [2018-02-02 10:31:36,535 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:36,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:36,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:36,732 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:36,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:31:36,733 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:36,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:36,733 INFO L182 omatonBuilderFactory]: Interpolants [4992#(or |main_#t~short29| (and (= (select |#length| main_~item~0.base) 8) (= main_~item~0.offset 0))), 4993#(and (= (select |#length| main_~item~0.base) 8) (= main_~item~0.offset 0)), 4980#true, 4981#false, 4982#(= (select |#valid| main_~head~0.base) 1), 4983#(and (= main_~item~0.offset main_~head~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 4984#(and (= main_~item~0.offset main_~head~0.offset) (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~item~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 4985#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~head~0.offset)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base)), 4986#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4987#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= 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_~head~0.base) main_~head~0.offset)))), 4988#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4989#(or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 0)), 4990#(or (= main_~status~0 0) (and (= 8 (select |#length| |main_#t~mem25.base|)) (= 0 |main_#t~mem25.offset|))), 4991#(or (= main_~status~0 0) (and (= (select |#length| main_~item~0.base) 8) (= main_~item~0.offset 0)))] [2018-02-02 10:31:36,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:36,733 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:31:36,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:31:36,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:31:36,734 INFO L87 Difference]: Start difference. First operand 211 states and 229 transitions. Second operand 14 states. [2018-02-02 10:31:37,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:37,401 INFO L93 Difference]: Finished difference Result 258 states and 279 transitions. [2018-02-02 10:31:37,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:31:37,402 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2018-02-02 10:31:37,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:37,402 INFO L225 Difference]: With dead ends: 258 [2018-02-02 10:31:37,403 INFO L226 Difference]: Without dead ends: 258 [2018-02-02 10:31:37,403 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=779, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:31:37,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-02 10:31:37,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 215. [2018-02-02 10:31:37,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-02 10:31:37,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 232 transitions. [2018-02-02 10:31:37,406 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 232 transitions. Word has length 52 [2018-02-02 10:31:37,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:37,406 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 232 transitions. [2018-02-02 10:31:37,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:31:37,406 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 232 transitions. [2018-02-02 10:31:37,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 10:31:37,406 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:37,406 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:37,406 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:37,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1393811070, now seen corresponding path program 1 times [2018-02-02 10:31:37,407 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:37,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:37,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:37,447 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:37,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:31:37,448 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:37,448 INFO L182 omatonBuilderFactory]: Interpolants [5504#false, 5505#(= main_~status~0 1), 5506#(not |main_#t~short29|), 5503#true] [2018-02-02 10:31:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:37,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:31:37,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:31:37,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:31:37,449 INFO L87 Difference]: Start difference. First operand 215 states and 232 transitions. Second operand 4 states. [2018-02-02 10:31:37,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:37,468 INFO L93 Difference]: Finished difference Result 261 states and 280 transitions. [2018-02-02 10:31:37,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:31:37,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-02-02 10:31:37,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:37,469 INFO L225 Difference]: With dead ends: 261 [2018-02-02 10:31:37,469 INFO L226 Difference]: Without dead ends: 261 [2018-02-02 10:31:37,469 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:31:37,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-02-02 10:31:37,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 232. [2018-02-02 10:31:37,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-02-02 10:31:37,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 254 transitions. [2018-02-02 10:31:37,473 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 254 transitions. Word has length 54 [2018-02-02 10:31:37,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:37,473 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 254 transitions. [2018-02-02 10:31:37,473 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:31:37,473 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 254 transitions. [2018-02-02 10:31:37,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 10:31:37,473 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:37,474 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:37,474 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:37,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1589506591, now seen corresponding path program 1 times [2018-02-02 10:31:37,474 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:37,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:37,683 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:31:37,683 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:37,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:31:37,684 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:37,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:37,684 INFO L182 omatonBuilderFactory]: Interpolants [6016#(= 1 (select |#valid| main_~head~0.base)), 6002#true, 6003#false, 6004#(not (= 0 |main_#t~malloc0.base|)), 6005#(not (= 0 main_~head~0.base)), 6006#(and (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base))), 6007#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base)) (= main_~item~0.base main_~head~0.base)), 6008#(and (= main_~head~0.offset main_~item~0.offset) (= 1 (select |#valid| |main_#t~malloc4.base|)) (not (= 0 main_~head~0.base)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~item~0.base main_~head~0.base)), 6009#(and (not (= 0 main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~head~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~head~0.offset)))), 6010#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base))), 6011#(and (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (not (= 0 main_~head~0.base))), 6012#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base))), 6013#(and (not (= 0 main_~item~0.base)) (= 1 (select (store |#valid| main_~item~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 6014#(and (= 1 (select (store |#valid| main_~item~0.base 0) |main_#t~mem31.base|)) (not (= 0 main_~item~0.base))), 6015#(and (= 1 (select (store |#valid| main_~item~0.base 0) main_~head~0.base)) (not (= 0 main_~item~0.base)))] [2018-02-02 10:31:37,684 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:31:37,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:31:37,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:31:37,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:31:37,685 INFO L87 Difference]: Start difference. First operand 232 states and 254 transitions. Second operand 15 states. [2018-02-02 10:31:38,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:38,219 INFO L93 Difference]: Finished difference Result 273 states and 297 transitions. [2018-02-02 10:31:38,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:31:38,219 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2018-02-02 10:31:38,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:38,220 INFO L225 Difference]: With dead ends: 273 [2018-02-02 10:31:38,220 INFO L226 Difference]: Without dead ends: 273 [2018-02-02 10:31:38,220 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=524, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:31:38,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-02-02 10:31:38,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 253. [2018-02-02 10:31:38,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-02-02 10:31:38,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 282 transitions. [2018-02-02 10:31:38,224 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 282 transitions. Word has length 57 [2018-02-02 10:31:38,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:38,225 INFO L432 AbstractCegarLoop]: Abstraction has 253 states and 282 transitions. [2018-02-02 10:31:38,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:31:38,225 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 282 transitions. [2018-02-02 10:31:38,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 10:31:38,225 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:38,225 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:38,226 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:38,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1589506590, now seen corresponding path program 1 times [2018-02-02 10:31:38,226 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:38,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:38,440 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:31:38,440 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:38,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:31:38,440 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:38,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:38,441 INFO L182 omatonBuilderFactory]: Interpolants [6576#(and (= 0 |main_#t~mem31.offset|) (= 8 (select |#length| |main_#t~mem31.base|))), 6577#(and (= (select |#length| main_~head~0.base) 8) (= main_~head~0.offset 0)), 6567#true, 6568#false, 6569#(= (select |#valid| main_~head~0.base) 1), 6570#(and (= main_~item~0.offset main_~head~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 6571#(and (= main_~item~0.offset main_~head~0.offset) (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~item~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 6572#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~head~0.offset)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base)), 6573#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 6574#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= 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_~head~0.base) main_~head~0.offset)))), 6575#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 10:31:38,441 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:31:38,441 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:31:38,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:31:38,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:31:38,442 INFO L87 Difference]: Start difference. First operand 253 states and 282 transitions. Second operand 11 states. [2018-02-02 10:31:38,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:38,908 INFO L93 Difference]: Finished difference Result 273 states and 297 transitions. [2018-02-02 10:31:38,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:31:38,909 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2018-02-02 10:31:38,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:38,910 INFO L225 Difference]: With dead ends: 273 [2018-02-02 10:31:38,910 INFO L226 Difference]: Without dead ends: 273 [2018-02-02 10:31:38,910 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:31:38,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-02-02 10:31:38,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 253. [2018-02-02 10:31:38,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-02-02 10:31:38,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 281 transitions. [2018-02-02 10:31:38,915 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 281 transitions. Word has length 57 [2018-02-02 10:31:38,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:38,915 INFO L432 AbstractCegarLoop]: Abstraction has 253 states and 281 transitions. [2018-02-02 10:31:38,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:31:38,915 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 281 transitions. [2018-02-02 10:31:38,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:31:38,916 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:38,916 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:38,916 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:38,916 INFO L82 PathProgramCache]: Analyzing trace with hash -2030065285, now seen corresponding path program 1 times [2018-02-02 10:31:38,917 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:38,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:38,977 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:31:38,977 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:38,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:31:38,977 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:38,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:38,978 INFO L182 omatonBuilderFactory]: Interpolants [7120#true, 7121#false, 7122#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 7123#(or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0))), 7124#(or (not (= |main_#t~mem31.base| 0)) (not (= |main_#t~mem31.offset| 0))), 7125#(or (not (= main_~head~0.base 0)) (not (= main_~head~0.offset 0)))] [2018-02-02 10:31:38,978 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:31:38,978 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:31:38,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:31:38,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:31:38,978 INFO L87 Difference]: Start difference. First operand 253 states and 281 transitions. Second operand 6 states. [2018-02-02 10:31:39,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:39,089 INFO L93 Difference]: Finished difference Result 272 states and 295 transitions. [2018-02-02 10:31:39,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:31:39,090 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-02-02 10:31:39,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:39,091 INFO L225 Difference]: With dead ends: 272 [2018-02-02 10:31:39,091 INFO L226 Difference]: Without dead ends: 264 [2018-02-02 10:31:39,091 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:31:39,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-02-02 10:31:39,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2018-02-02 10:31:39,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-02-02 10:31:39,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 286 transitions. [2018-02-02 10:31:39,096 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 286 transitions. Word has length 58 [2018-02-02 10:31:39,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:39,096 INFO L432 AbstractCegarLoop]: Abstraction has 261 states and 286 transitions. [2018-02-02 10:31:39,096 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:31:39,096 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 286 transitions. [2018-02-02 10:31:39,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:31:39,097 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:39,097 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:39,097 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:39,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1492535714, now seen corresponding path program 1 times [2018-02-02 10:31:39,098 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:39,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:39,227 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:39,227 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:39,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:31:39,228 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:39,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:39,228 INFO L182 omatonBuilderFactory]: Interpolants [7665#true, 7666#false, 7667#(= (select |#valid| main_~head~0.base) 1), 7668#(and (= main_~item~0.offset main_~head~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 7669#(and (= main_~item~0.offset main_~head~0.offset) (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~item~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 7670#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~head~0.offset)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base)), 7671#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 7672#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base))), 7673#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 7674#(= 0 |main_#t~mem31.offset|), 7675#(= 0 main_~head~0.offset), 7676#(= main_~item~0.offset 0)] [2018-02-02 10:31:39,228 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:39,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:31:39,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:31:39,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:31:39,229 INFO L87 Difference]: Start difference. First operand 261 states and 286 transitions. Second operand 12 states. [2018-02-02 10:31:39,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:39,611 INFO L93 Difference]: Finished difference Result 275 states and 297 transitions. [2018-02-02 10:31:39,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:31:39,611 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-02-02 10:31:39,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:39,611 INFO L225 Difference]: With dead ends: 275 [2018-02-02 10:31:39,612 INFO L226 Difference]: Without dead ends: 275 [2018-02-02 10:31:39,612 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:31:39,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-02-02 10:31:39,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 263. [2018-02-02 10:31:39,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-02-02 10:31:39,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 289 transitions. [2018-02-02 10:31:39,615 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 289 transitions. Word has length 59 [2018-02-02 10:31:39,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:39,615 INFO L432 AbstractCegarLoop]: Abstraction has 263 states and 289 transitions. [2018-02-02 10:31:39,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:31:39,616 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 289 transitions. [2018-02-02 10:31:39,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:31:39,616 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:39,616 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:39,616 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:39,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1492535715, now seen corresponding path program 1 times [2018-02-02 10:31:39,617 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:39,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:39,654 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:31:39,654 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:39,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:31:39,654 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:39,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:39,655 INFO L182 omatonBuilderFactory]: Interpolants [8233#true, 8234#false, 8235#(= main_~head~0.base main_~item~0.base), 8236#(= 1 (select |#valid| main_~item~0.base))] [2018-02-02 10:31:39,655 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:31:39,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:31:39,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:31:39,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:31:39,656 INFO L87 Difference]: Start difference. First operand 263 states and 289 transitions. Second operand 4 states. [2018-02-02 10:31:39,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:39,734 INFO L93 Difference]: Finished difference Result 263 states and 287 transitions. [2018-02-02 10:31:39,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:31:39,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-02-02 10:31:39,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:39,735 INFO L225 Difference]: With dead ends: 263 [2018-02-02 10:31:39,735 INFO L226 Difference]: Without dead ends: 263 [2018-02-02 10:31:39,735 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:31:39,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-02 10:31:39,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 257. [2018-02-02 10:31:39,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-02-02 10:31:39,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 282 transitions. [2018-02-02 10:31:39,737 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 282 transitions. Word has length 59 [2018-02-02 10:31:39,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:39,737 INFO L432 AbstractCegarLoop]: Abstraction has 257 states and 282 transitions. [2018-02-02 10:31:39,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:31:39,738 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 282 transitions. [2018-02-02 10:31:39,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:31:39,738 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:39,738 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:39,738 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:39,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1664588139, now seen corresponding path program 2 times [2018-02-02 10:31:39,739 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:39,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:39,977 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:39,978 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:39,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:31:39,978 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:39,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:39,978 INFO L182 omatonBuilderFactory]: Interpolants [8768#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.offset 0)), 8769#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))), 8770#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem31.base|) 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem31.base|) 0))), 8771#(or (not (= 0 main_~head~0.offset)) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 8772#(or (not (= 0 main_~item~0.offset)) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 8773#(or (not (= 0 main_~item~0.offset)) (and (= 0 |main_#t~mem31.offset|) (= 0 |main_#t~mem31.base|))), 8774#(or (not (= 0 main_~item~0.offset)) (and (= 0 main_~head~0.base) (= main_~head~0.offset 0))), 8775#(and (= 0 main_~head~0.base) (= main_~head~0.offset 0)), 8759#true, 8760#false, 8761#(= (select |#valid| main_~head~0.base) 1), 8762#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 8763#(and (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset main_~item~0.offset) (= main_~item~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 8764#(and (= main_~item~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base)), 8765#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 |main_#t~mem6.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 8766#(and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= main_~item~0.offset 0)), 8767#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= main_~item~0.offset 0))] [2018-02-02 10:31:39,978 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:39,978 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:31:39,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:31:39,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:31:39,979 INFO L87 Difference]: Start difference. First operand 257 states and 282 transitions. Second operand 17 states. [2018-02-02 10:31:40,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:40,542 INFO L93 Difference]: Finished difference Result 271 states and 293 transitions. [2018-02-02 10:31:40,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:31:40,543 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 62 [2018-02-02 10:31:40,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:40,543 INFO L225 Difference]: With dead ends: 271 [2018-02-02 10:31:40,543 INFO L226 Difference]: Without dead ends: 271 [2018-02-02 10:31:40,544 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:31:40,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-02-02 10:31:40,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 257. [2018-02-02 10:31:40,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-02-02 10:31:40,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 282 transitions. [2018-02-02 10:31:40,546 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 282 transitions. Word has length 62 [2018-02-02 10:31:40,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:40,546 INFO L432 AbstractCegarLoop]: Abstraction has 257 states and 282 transitions. [2018-02-02 10:31:40,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:31:40,546 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 282 transitions. [2018-02-02 10:31:40,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:31:40,546 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:40,546 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:40,547 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:40,547 INFO L82 PathProgramCache]: Analyzing trace with hash -62625977, now seen corresponding path program 2 times [2018-02-02 10:31:40,547 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:40,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:41,040 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:41,041 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:41,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:31:41,041 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:41,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:41,041 INFO L182 omatonBuilderFactory]: Interpolants [9344#(and (= (store (store |#valid| main_~item~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) |old(#valid)|) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0))) (not (= 0 main_~item~0.base))), 9345#(and (not (= main_~item~0.base |main_#t~mem31.base|)) (or (not (= |main_#t~mem31.base| 0)) (not (= |main_#t~mem31.offset| 0))) (not (= 0 main_~item~0.base)) (= |old(#valid)| (store (store |#valid| main_~item~0.base 0) |main_#t~mem31.base| 0))), 9346#(and (= (store (store |#valid| main_~item~0.base 0) main_~head~0.base 0) |old(#valid)|) (or (not (= main_~head~0.base 0)) (not (= main_~head~0.offset 0))) (not (= main_~item~0.base main_~head~0.base)) (not (= 0 main_~item~0.base))), 9347#(and (or (not (= main_~head~0.base 0)) (not (= main_~head~0.offset 0))) (= (store |#valid| main_~head~0.base 0) |old(#valid)|)), 9348#(and (or (not (= main_~item~0.offset 0)) (not (= main_~item~0.base 0))) (= (store |#valid| main_~item~0.base 0) |old(#valid)|)), 9330#true, 9331#false, 9332#(= |#valid| |old(#valid)|), 9333#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|))), 9334#(and (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|)), 9335#(and (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|)), 9336#(and (= main_~item~0.offset main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|) (= main_~item~0.base main_~head~0.base)), 9337#(and (= main_~item~0.offset main_~head~0.offset) (= |old(#valid)| (store (store |#valid| |main_#t~malloc4.base| 0) main_~head~0.base 0)) (not (= 0 main_~head~0.base)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~item~0.base main_~head~0.base)), 9338#(and (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~head~0.offset) 0) main_~head~0.base 0) |old(#valid)|) (not (= 0 main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~head~0.offset)))), 9339#(and (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) main_~head~0.base 0) |old(#valid)|) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base))), 9340#(and (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= (store (store |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset) 0) main_~head~0.base 0) |old(#valid)|) (not (= main_~item~0.base main_~head~0.base)) (not (= 0 main_~head~0.base))), 9341#(and (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) main_~head~0.base 0) |old(#valid)|) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base))), 9342#(and (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) main_~head~0.base 0) |old(#valid)|) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base))), 9343#(and (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) main_~head~0.base 0) |old(#valid)|) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base)) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0))))] [2018-02-02 10:31:41,041 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:41,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:31:41,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:31:41,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:31:41,042 INFO L87 Difference]: Start difference. First operand 257 states and 282 transitions. Second operand 19 states. [2018-02-02 10:31:41,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:41,637 INFO L93 Difference]: Finished difference Result 270 states and 291 transitions. [2018-02-02 10:31:41,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:31:41,637 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 63 [2018-02-02 10:31:41,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:41,638 INFO L225 Difference]: With dead ends: 270 [2018-02-02 10:31:41,638 INFO L226 Difference]: Without dead ends: 255 [2018-02-02 10:31:41,639 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:31:41,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-02 10:31:41,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 251. [2018-02-02 10:31:41,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-02-02 10:31:41,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 273 transitions. [2018-02-02 10:31:41,641 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 273 transitions. Word has length 63 [2018-02-02 10:31:41,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:41,641 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 273 transitions. [2018-02-02 10:31:41,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:31:41,642 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 273 transitions. [2018-02-02 10:31:41,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:31:41,642 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:41,642 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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:31:41,642 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:41,642 INFO L82 PathProgramCache]: Analyzing trace with hash 880876383, now seen corresponding path program 1 times [2018-02-02 10:31:41,643 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:41,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:41,660 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:31:41,661 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:41,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:31:41,661 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:41,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:31:41,661 INFO L182 omatonBuilderFactory]: Interpolants [9894#true, 9895#false, 9896#(= main_~status~0 2)] [2018-02-02 10:31:41,661 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:31:41,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:31:41,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:31:41,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:31:41,662 INFO L87 Difference]: Start difference. First operand 251 states and 273 transitions. Second operand 3 states. [2018-02-02 10:31:41,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:41,676 INFO L93 Difference]: Finished difference Result 325 states and 353 transitions. [2018-02-02 10:31:41,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:31:41,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-02-02 10:31:41,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:41,677 INFO L225 Difference]: With dead ends: 325 [2018-02-02 10:31:41,677 INFO L226 Difference]: Without dead ends: 325 [2018-02-02 10:31:41,678 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:31:41,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-02-02 10:31:41,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 274. [2018-02-02 10:31:41,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-02-02 10:31:41,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 297 transitions. [2018-02-02 10:31:41,680 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 297 transitions. Word has length 63 [2018-02-02 10:31:41,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:41,681 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 297 transitions. [2018-02-02 10:31:41,681 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:31:41,681 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 297 transitions. [2018-02-02 10:31:41,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:31:41,681 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:41,681 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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:31:41,681 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:41,681 INFO L82 PathProgramCache]: Analyzing trace with hash -69705999, now seen corresponding path program 1 times [2018-02-02 10:31:41,682 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:41,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:41,891 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:41,891 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:41,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:31:41,891 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:41,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:41,891 INFO L182 omatonBuilderFactory]: Interpolants [10496#true, 10497#false, 10498#(= (select |#valid| main_~head~0.base) 1), 10499#(and (= main_~item~0.offset main_~head~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 10500#(and (= main_~item~0.offset main_~head~0.offset) (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~item~0.base main_~head~0.base)), 10501#(and (= main_~item~0.offset main_~head~0.offset) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base)), 10502#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1)), 10503#(and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 10504#(or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base)))), 10505#(or (= main_~status~0 0) (and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)))), 10506#(or (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~item~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))) (= main_~status~0 0)), 10507#(or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|))) (= main_~status~0 0)), 10508#(or (= main_~status~0 0) (and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)))), 10509#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base))), 10510#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 10511#(= 1 (select |#valid| |main_#t~mem13.base|))] [2018-02-02 10:31:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:41,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:31:41,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:31:41,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:31:41,892 INFO L87 Difference]: Start difference. First operand 274 states and 297 transitions. Second operand 16 states. [2018-02-02 10:31:42,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:42,593 INFO L93 Difference]: Finished difference Result 350 states and 379 transitions. [2018-02-02 10:31:42,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:31:42,594 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 63 [2018-02-02 10:31:42,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:42,595 INFO L225 Difference]: With dead ends: 350 [2018-02-02 10:31:42,595 INFO L226 Difference]: Without dead ends: 350 [2018-02-02 10:31:42,595 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=237, Invalid=885, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:31:42,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-02-02 10:31:42,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 307. [2018-02-02 10:31:42,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-02-02 10:31:42,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 332 transitions. [2018-02-02 10:31:42,598 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 332 transitions. Word has length 63 [2018-02-02 10:31:42,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:42,598 INFO L432 AbstractCegarLoop]: Abstraction has 307 states and 332 transitions. [2018-02-02 10:31:42,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:31:42,598 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 332 transitions. [2018-02-02 10:31:42,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:31:42,598 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:42,598 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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:31:42,598 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:42,599 INFO L82 PathProgramCache]: Analyzing trace with hash -69705998, now seen corresponding path program 1 times [2018-02-02 10:31:42,599 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:42,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:42,907 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:42,907 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:42,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:31:42,907 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:42,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:42,908 INFO L182 omatonBuilderFactory]: Interpolants [11205#true, 11206#false, 11207#(= (select |#valid| main_~head~0.base) 1), 11208#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 11209#(and (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset main_~item~0.offset) (= main_~item~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 11210#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~head~0.offset)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base)), 11211#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 11212#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 11213#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (<= 0 main_~item~0.offset) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 11214#(or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (<= 0 main_~item~0.offset) (= main_~status~0 (select |#valid| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 11215#(or (= main_~status~0 0) (and (or (<= (select |#length| main_~item~0.base) 3) (and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)))) (or (< 3 (select |#length| main_~item~0.base)) (<= 0 main_~item~0.offset)))), 11216#(or (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (<= 4 (select |#length| main_~item~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))) (= main_~status~0 0)), 11217#(or (= main_~status~0 0) (and (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))))), 11218#(or (= main_~status~0 0) (and (<= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)))), 11219#(and (not (= main_~item~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 11220#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 11221#(and (= |main_#t~mem13.offset| 0) (<= 4 (select |#length| |main_#t~mem13.base|)))] [2018-02-02 10:31:42,908 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:42,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:31:42,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:31:42,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:31:42,908 INFO L87 Difference]: Start difference. First operand 307 states and 332 transitions. Second operand 17 states. [2018-02-02 10:31:43,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:43,880 INFO L93 Difference]: Finished difference Result 349 states and 378 transitions. [2018-02-02 10:31:43,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:31:43,881 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 63 [2018-02-02 10:31:43,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:43,882 INFO L225 Difference]: With dead ends: 349 [2018-02-02 10:31:43,882 INFO L226 Difference]: Without dead ends: 349 [2018-02-02 10:31:43,882 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=241, Invalid=881, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:31:43,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-02-02 10:31:43,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 307. [2018-02-02 10:31:43,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-02-02 10:31:43,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 331 transitions. [2018-02-02 10:31:43,887 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 331 transitions. Word has length 63 [2018-02-02 10:31:43,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:43,887 INFO L432 AbstractCegarLoop]: Abstraction has 307 states and 331 transitions. [2018-02-02 10:31:43,887 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:31:43,887 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 331 transitions. [2018-02-02 10:31:43,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 10:31:43,888 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:43,888 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:43,888 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:43,888 INFO L82 PathProgramCache]: Analyzing trace with hash 408599608, now seen corresponding path program 1 times [2018-02-02 10:31:43,888 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:43,898 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:44,284 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:44,284 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:44,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:31:44,285 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:44,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:44,285 INFO L182 omatonBuilderFactory]: Interpolants [11912#true, 11913#false, 11914#(= (select |#valid| main_~head~0.base) 1), 11915#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 11916#(and (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset main_~item~0.offset) (= main_~item~0.base main_~head~0.base)), 11917#(and (= main_~head~0.offset main_~item~0.offset) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base)), 11918#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 11919#(and (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base))), 11920#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 11921#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 11922#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 0)), 11923#(or (= main_~status~0 0) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 11924#(or (and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem25.base|) |main_#t~mem25.offset|))) (= main_~status~0 0)), 11925#(or (= main_~status~0 0) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))), 11926#(or (and |main_#t~short29| (= main_~status~0 0)) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))), 11927#(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))), 11928#(and (= 0 |main_#t~mem30.offset|) (= 0 |main_#t~mem30.base|)), 11929#(and (= 0 main_~item~0.base) (= main_~item~0.offset 0)), 11930#(not |main_#t~short27|)] [2018-02-02 10:31:44,285 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:44,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:31:44,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:31:44,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:31:44,286 INFO L87 Difference]: Start difference. First operand 307 states and 331 transitions. Second operand 19 states. [2018-02-02 10:31:44,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:44,984 INFO L93 Difference]: Finished difference Result 299 states and 319 transitions. [2018-02-02 10:31:44,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:31:44,984 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 64 [2018-02-02 10:31:44,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:44,985 INFO L225 Difference]: With dead ends: 299 [2018-02-02 10:31:44,985 INFO L226 Difference]: Without dead ends: 269 [2018-02-02 10:31:44,986 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=196, Invalid=994, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:31:44,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-02 10:31:44,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-02-02 10:31:44,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-02-02 10:31:44,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 289 transitions. [2018-02-02 10:31:44,989 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 289 transitions. Word has length 64 [2018-02-02 10:31:44,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:44,990 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 289 transitions. [2018-02-02 10:31:44,990 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:31:44,990 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 289 transitions. [2018-02-02 10:31:44,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-02 10:31:44,991 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:44,991 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:44,991 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:44,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1151857533, now seen corresponding path program 1 times [2018-02-02 10:31:44,992 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:45,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:45,044 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-02 10:31:45,045 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:45,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:31:45,045 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:45,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:45,046 INFO L182 omatonBuilderFactory]: Interpolants [12531#true, 12532#false, 12533#(= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)), 12534#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 12535#(= 1 (select |#valid| |main_#t~mem25.base|)), 12536#(= 1 (select |#valid| main_~item~0.base))] [2018-02-02 10:31:45,046 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-02 10:31:45,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:31:45,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:31:45,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:31:45,047 INFO L87 Difference]: Start difference. First operand 269 states and 289 transitions. Second operand 6 states. [2018-02-02 10:31:45,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:45,182 INFO L93 Difference]: Finished difference Result 315 states and 341 transitions. [2018-02-02 10:31:45,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:31:45,182 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2018-02-02 10:31:45,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:45,183 INFO L225 Difference]: With dead ends: 315 [2018-02-02 10:31:45,184 INFO L226 Difference]: Without dead ends: 315 [2018-02-02 10:31:45,184 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:31:45,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-02-02 10:31:45,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 278. [2018-02-02 10:31:45,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-02-02 10:31:45,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 302 transitions. [2018-02-02 10:31:45,186 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 302 transitions. Word has length 75 [2018-02-02 10:31:45,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:45,187 INFO L432 AbstractCegarLoop]: Abstraction has 278 states and 302 transitions. [2018-02-02 10:31:45,187 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:31:45,187 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 302 transitions. [2018-02-02 10:31:45,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-02 10:31:45,187 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:45,187 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:45,187 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:45,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1151857532, now seen corresponding path program 1 times [2018-02-02 10:31:45,188 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:45,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:45,725 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:45,725 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:45,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:31:45,725 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:45,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:45,725 INFO L182 omatonBuilderFactory]: Interpolants [13152#(or (and (not (= main_~head~0.base |main_#t~mem6.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 0)), 13153#(or (= main_~status~0 0) (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (<= 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_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)))), 13154#(and (not (= main_~item~0.base main_~head~0.base)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 13155#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 13156#(and (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 13157#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 13158#(and (<= (+ |main_#t~mem25.offset| 8) (select |#length| |main_#t~mem25.base|)) (<= 0 |main_#t~mem25.offset|)), 13159#(and (<= 0 main_~item~0.offset) (<= (+ main_~item~0.offset 8) (select |#length| main_~item~0.base))), 13138#true, 13139#false, 13140#(= (select |#length| |main_#t~malloc0.base|) 8), 13141#(= (select |#length| main_~head~0.base) 8), 13142#(and (= (select |#length| main_~head~0.base) 8) (= (select |#valid| main_~head~0.base) 1)), 13143#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#length| main_~head~0.base) 8) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 13144#(and (= (select |#length| main_~item~0.base) (select |#length| |main_#t~malloc4.base|)) (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset main_~item~0.offset) (= (select |#length| main_~item~0.base) 8) (= main_~item~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 13145#(and (= (select |#length| main_~item~0.base) (select |#length| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~head~0.offset)) (= (select |#length| main_~item~0.base) 8) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base)), 13146#(and (<= 8 (select |#length| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#length| main_~head~0.base) (select |#length| |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 13147#(and (<= 8 (select |#length| main_~head~0.base)) (= (select |#length| main_~head~0.base) (select |#length| main_~item~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_~head~0.base) main_~head~0.offset)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 13148#(and (<= 8 (select |#length| main_~head~0.base)) (= (select |#length| main_~head~0.base) (select |#length| main_~item~0.base)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 13149#(and (or (= main_~status~0 0) (and (<= 8 (select |#length| main_~head~0.base)) (= (select |#length| main_~head~0.base) (select |#length| main_~item~0.base)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= main_~status~0 (select |#valid| main_~head~0.base))), 13150#(or (= main_~status~0 0) (and (<= 8 (select |#length| main_~item~0.base)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)))), 13151#(or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (<= 8 (select |#length| main_~item~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))))] [2018-02-02 10:31:45,726 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:45,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:31:45,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:31:45,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:31:45,726 INFO L87 Difference]: Start difference. First operand 278 states and 302 transitions. Second operand 22 states. [2018-02-02 10:31:46,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:46,798 INFO L93 Difference]: Finished difference Result 331 states and 362 transitions. [2018-02-02 10:31:46,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:31:46,798 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 75 [2018-02-02 10:31:46,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:46,799 INFO L225 Difference]: With dead ends: 331 [2018-02-02 10:31:46,799 INFO L226 Difference]: Without dead ends: 331 [2018-02-02 10:31:46,800 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=382, Invalid=1424, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:31:46,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-02-02 10:31:46,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 294. [2018-02-02 10:31:46,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-02-02 10:31:46,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 321 transitions. [2018-02-02 10:31:46,803 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 321 transitions. Word has length 75 [2018-02-02 10:31:46,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:46,803 INFO L432 AbstractCegarLoop]: Abstraction has 294 states and 321 transitions. [2018-02-02 10:31:46,803 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:31:46,804 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 321 transitions. [2018-02-02 10:31:46,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-02 10:31:46,804 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:46,805 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2018-02-02 10:31:46,805 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:46,805 INFO L82 PathProgramCache]: Analyzing trace with hash 633670767, now seen corresponding path program 1 times [2018-02-02 10:31:46,805 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:46,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:46,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:47,145 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:47,145 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:47,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:31:47,145 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:47,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:47,146 INFO L182 omatonBuilderFactory]: Interpolants [13827#true, 13828#false, 13829#(not (= 0 |main_#t~malloc0.base|)), 13830#(not (= 0 main_~head~0.base)), 13831#(and (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base))), 13832#(and (= main_~item~0.offset main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base)) (= main_~item~0.base main_~head~0.base)), 13833#(and (= main_~item~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~item~0.base main_~head~0.base)), 13834#(and (= (select |#valid| main_~item~0.base) 1) (not (= 0 main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~head~0.offset)))), 13835#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base))), 13836#(and (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base))), 13837#(or (and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (not (= 0 main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base))) (= main_~status~0 0)), 13838#(or (and (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base)) (not (= main_~head~0.base |main_#t~malloc4.base|))) (= main_~status~0 0)), 13839#(or (= main_~status~0 0) (and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))))), 13840#(or (and (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base))) (= main_~status~0 0)), 13841#(or (and (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (not (= 0 main_~head~0.base))) (= main_~status~0 0)), 13842#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (not (= 0 main_~head~0.base))), 13843#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base))), 13844#(and (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem13.base|))), 13845#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base))), 13846#(and (not (= 0 main_~item~0.base)) (= 1 (select (store |#valid| main_~item~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 13847#(and (= 1 (select (store |#valid| main_~item~0.base 0) |main_#t~mem31.base|)) (not (= 0 main_~item~0.base))), 13848#(and (= 1 (select (store |#valid| main_~item~0.base 0) main_~head~0.base)) (not (= 0 main_~item~0.base))), 13849#(= 1 (select |#valid| main_~head~0.base))] [2018-02-02 10:31:47,146 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:47,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:31:47,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:31:47,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:31:47,146 INFO L87 Difference]: Start difference. First operand 294 states and 321 transitions. Second operand 23 states. [2018-02-02 10:31:48,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:48,942 INFO L93 Difference]: Finished difference Result 682 states and 757 transitions. [2018-02-02 10:31:48,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 10:31:48,942 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 80 [2018-02-02 10:31:48,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:48,943 INFO L225 Difference]: With dead ends: 682 [2018-02-02 10:31:48,943 INFO L226 Difference]: Without dead ends: 682 [2018-02-02 10:31:48,944 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=804, Invalid=2978, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 10:31:48,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2018-02-02 10:31:48,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 388. [2018-02-02 10:31:48,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-02-02 10:31:48,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 438 transitions. [2018-02-02 10:31:48,949 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 438 transitions. Word has length 80 [2018-02-02 10:31:48,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:48,949 INFO L432 AbstractCegarLoop]: Abstraction has 388 states and 438 transitions. [2018-02-02 10:31:48,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:31:48,949 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 438 transitions. [2018-02-02 10:31:48,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-02 10:31:48,949 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:48,949 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2018-02-02 10:31:48,949 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:48,950 INFO L82 PathProgramCache]: Analyzing trace with hash 633670768, now seen corresponding path program 1 times [2018-02-02 10:31:48,961 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:48,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:49,284 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:49,284 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:49,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:31:49,284 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:49,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:49,285 INFO L182 omatonBuilderFactory]: Interpolants [15008#(or (= main_~status~0 0) (and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (<= 0 main_~item~0.offset) (not (= main_~head~0.base |main_#t~malloc4.base|)))), 15009#(or (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (<= 4 (select |#length| main_~item~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))) (= main_~status~0 0)), 15010#(or (= main_~status~0 0) (and (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))))), 15011#(or (= main_~status~0 0) (and (<= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)))), 15012#(and (not (= main_~item~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 15013#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 15014#(and (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 15015#(and (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 15016#(and (<= 0 |main_#t~mem31.offset|) (<= (+ |main_#t~mem31.offset| 4) (select |#length| |main_#t~mem31.base|))), 15017#(and (<= (+ main_~head~0.offset 4) (select |#length| main_~head~0.base)) (<= 0 main_~head~0.offset)), 14998#true, 14999#false, 15000#(= (select |#valid| main_~head~0.base) 1), 15001#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 15002#(and (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset main_~item~0.offset) (= main_~item~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 15003#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~head~0.offset)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base)), 15004#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 15005#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 15006#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (<= 0 main_~item~0.offset) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 15007#(or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (<= 0 main_~item~0.offset) (= main_~status~0 (select |#valid| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))] [2018-02-02 10:31:49,285 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:49,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:31:49,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:31:49,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:31:49,285 INFO L87 Difference]: Start difference. First operand 388 states and 438 transitions. Second operand 20 states. [2018-02-02 10:31:50,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:50,397 INFO L93 Difference]: Finished difference Result 432 states and 486 transitions. [2018-02-02 10:31:50,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:31:50,398 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 80 [2018-02-02 10:31:50,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:50,399 INFO L225 Difference]: With dead ends: 432 [2018-02-02 10:31:50,399 INFO L226 Difference]: Without dead ends: 432 [2018-02-02 10:31:50,400 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=322, Invalid=1238, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:31:50,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-02-02 10:31:50,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 412. [2018-02-02 10:31:50,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-02-02 10:31:50,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 471 transitions. [2018-02-02 10:31:50,403 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 471 transitions. Word has length 80 [2018-02-02 10:31:50,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:50,404 INFO L432 AbstractCegarLoop]: Abstraction has 412 states and 471 transitions. [2018-02-02 10:31:50,404 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:31:50,404 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 471 transitions. [2018-02-02 10:31:50,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 10:31:50,404 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:50,404 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:50,404 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:50,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1831043923, now seen corresponding path program 1 times [2018-02-02 10:31:50,405 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:50,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:50,472 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-02 10:31:50,472 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:50,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:31:50,473 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:50,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:50,473 INFO L182 omatonBuilderFactory]: Interpolants [15904#(and (= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 15905#(or (not (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 15906#(or (not (= 0 |main_#t~mem31.base|)) (not (= |main_#t~mem31.offset| 0))), 15907#(or (not (= 0 main_~head~0.base)) (not (= main_~head~0.offset 0))), 15902#true, 15903#false] [2018-02-02 10:31:50,473 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-02 10:31:50,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:31:50,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:31:50,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:31:50,474 INFO L87 Difference]: Start difference. First operand 412 states and 471 transitions. Second operand 6 states. [2018-02-02 10:31:50,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:50,585 INFO L93 Difference]: Finished difference Result 447 states and 507 transitions. [2018-02-02 10:31:50,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:31:50,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-02-02 10:31:50,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:50,586 INFO L225 Difference]: With dead ends: 447 [2018-02-02 10:31:50,586 INFO L226 Difference]: Without dead ends: 439 [2018-02-02 10:31:50,586 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:31:50,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-02-02 10:31:50,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 427. [2018-02-02 10:31:50,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-02-02 10:31:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 489 transitions. [2018-02-02 10:31:50,590 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 489 transitions. Word has length 81 [2018-02-02 10:31:50,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:50,591 INFO L432 AbstractCegarLoop]: Abstraction has 427 states and 489 transitions. [2018-02-02 10:31:50,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:31:50,591 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 489 transitions. [2018-02-02 10:31:50,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 10:31:50,591 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:50,591 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:50,592 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:50,592 INFO L82 PathProgramCache]: Analyzing trace with hash -927736656, now seen corresponding path program 1 times [2018-02-02 10:31:50,592 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:50,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:50,854 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:50,854 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:50,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:31:50,854 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:50,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:50,855 INFO L182 omatonBuilderFactory]: Interpolants [16800#(or (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base))) (= main_~status~0 0)), 16801#(and (not (= main_~item~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 16802#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 16803#(= 0 |main_#t~mem31.offset|), 16804#(= 0 main_~head~0.offset), 16805#(= main_~item~0.offset 0), 16788#true, 16789#false, 16790#(= (select |#valid| main_~head~0.base) 1), 16791#(and (= main_~item~0.offset main_~head~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 16792#(and (= main_~item~0.offset main_~head~0.offset) (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~item~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 16793#(and (= (select |#valid| main_~item~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~head~0.offset)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base)), 16794#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 16795#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 16796#(or (and (not (= main_~item~0.base main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 0)), 16797#(or (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))) (= main_~status~0 0)), 16798#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))) (= main_~status~0 0)), 16799#(or (and (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 0))] [2018-02-02 10:31:50,855 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:50,855 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:31:50,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:31:50,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:31:50,856 INFO L87 Difference]: Start difference. First operand 427 states and 489 transitions. Second operand 18 states. [2018-02-02 10:31:51,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:51,790 INFO L93 Difference]: Finished difference Result 630 states and 706 transitions. [2018-02-02 10:31:51,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:31:51,790 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 82 [2018-02-02 10:31:51,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:51,791 INFO L225 Difference]: With dead ends: 630 [2018-02-02 10:31:51,791 INFO L226 Difference]: Without dead ends: 630 [2018-02-02 10:31:51,792 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=307, Invalid=1175, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:31:51,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2018-02-02 10:31:51,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 513. [2018-02-02 10:31:51,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-02-02 10:31:51,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 605 transitions. [2018-02-02 10:31:51,796 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 605 transitions. Word has length 82 [2018-02-02 10:31:51,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:51,796 INFO L432 AbstractCegarLoop]: Abstraction has 513 states and 605 transitions. [2018-02-02 10:31:51,797 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:31:51,797 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 605 transitions. [2018-02-02 10:31:51,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 10:31:51,797 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:51,797 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:51,798 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:51,798 INFO L82 PathProgramCache]: Analyzing trace with hash 268131050, now seen corresponding path program 1 times [2018-02-02 10:31:51,798 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:51,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:51,823 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-02-02 10:31:51,823 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:51,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:31:51,824 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:51,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:31:51,824 INFO L182 omatonBuilderFactory]: Interpolants [17991#true, 17992#false, 17993#(= main_~status~0 3)] [2018-02-02 10:31:51,824 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-02-02 10:31:51,825 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:31:51,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:31:51,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:31:51,825 INFO L87 Difference]: Start difference. First operand 513 states and 605 transitions. Second operand 3 states. [2018-02-02 10:31:51,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:51,843 INFO L93 Difference]: Finished difference Result 246 states and 262 transitions. [2018-02-02 10:31:51,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:31:51,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-02-02 10:31:51,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:51,844 INFO L225 Difference]: With dead ends: 246 [2018-02-02 10:31:51,844 INFO L226 Difference]: Without dead ends: 246 [2018-02-02 10:31:51,845 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:31:51,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-02-02 10:31:51,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 219. [2018-02-02 10:31:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 10:31:51,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 239 transitions. [2018-02-02 10:31:51,847 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 239 transitions. Word has length 82 [2018-02-02 10:31:51,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:51,848 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 239 transitions. [2018-02-02 10:31:51,848 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:31:51,848 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 239 transitions. [2018-02-02 10:31:51,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 10:31:51,848 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:51,848 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:51,849 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:51,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1087936039, now seen corresponding path program 1 times [2018-02-02 10:31:51,849 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:51,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:52,240 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:52,241 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:52,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:31:52,241 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:52,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:52,241 INFO L182 omatonBuilderFactory]: Interpolants [18464#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base)), 18465#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 18466#(and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 18467#(or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base)))), 18468#(or (and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~status~0 (select |#valid| main_~head~0.base))) (= main_~status~0 0)), 18469#(or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~item~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))))), 18470#(or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= main_~status~0 (select |#valid| main_~head~0.base))) (= main_~status~0 0)), 18471#(or (= main_~status~0 0) (and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base)))), 18472#(and (not (= (select |#valid| main_~head~0.base) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base))), 18473#(and (or (= |main_#t~malloc4.base| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base |main_#t~malloc4.base|))), 18474#(and (or (= (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))), 18475#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (or (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))))), 18476#(and (not (= main_~item~0.base main_~head~0.base)) (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)))), 18477#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base))), 18478#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 18479#(= 1 (select |#valid| |main_#t~mem16.base|)), 18459#true, 18460#false, 18461#(= (select |#valid| main_~head~0.base) 1), 18462#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 18463#(and (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset main_~item~0.offset) (= main_~item~0.base main_~head~0.base))] [2018-02-02 10:31:52,241 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:52,241 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:31:52,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:31:52,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:31:52,242 INFO L87 Difference]: Start difference. First operand 219 states and 239 transitions. Second operand 21 states. [2018-02-02 10:31:53,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:53,043 INFO L93 Difference]: Finished difference Result 218 states and 238 transitions. [2018-02-02 10:31:53,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:31:53,043 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 83 [2018-02-02 10:31:53,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:53,044 INFO L225 Difference]: With dead ends: 218 [2018-02-02 10:31:53,044 INFO L226 Difference]: Without dead ends: 218 [2018-02-02 10:31:53,044 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=1195, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:31:53,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-02 10:31:53,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-02-02 10:31:53,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 10:31:53,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 238 transitions. [2018-02-02 10:31:53,046 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 238 transitions. Word has length 83 [2018-02-02 10:31:53,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:53,047 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 238 transitions. [2018-02-02 10:31:53,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:31:53,047 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 238 transitions. [2018-02-02 10:31:53,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 10:31:53,047 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:53,048 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:53,048 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:53,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1087936040, now seen corresponding path program 1 times [2018-02-02 10:31:53,048 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:53,064 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:53,740 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:53,740 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:53,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:31:53,740 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:53,741 INFO L182 omatonBuilderFactory]: Interpolants [18952#true, 18953#false, 18954#(= |main_#t~malloc0.offset| 0), 18955#(= main_~head~0.offset 0), 18956#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 18957#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset 0)), 18958#(and (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset main_~item~0.offset) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 18959#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~head~0.offset)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~head~0.offset 0) (= main_~item~0.base main_~head~0.base)), 18960#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 8 (select |#length| |main_#t~mem6.base|)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 18961#(and (= 8 (select |#length| main_~item~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_~head~0.base) main_~head~0.offset)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 18962#(and (= 8 (select |#length| main_~item~0.base)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18963#(and (or (= main_~status~0 0) (and (= 8 (select |#length| main_~item~0.base)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 1) (not (= main_~item~0.base main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= main_~status~0 (select |#valid| main_~item~0.base))), 18964#(or (and (= 8 (select |#length| main_~item~0.base)) (= main_~status~0 1) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0)) (= main_~status~0 0)), 18965#(or (= main_~status~0 0) (and (= 8 (select |#length| main_~item~0.base)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~item~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))))), 18966#(or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 0)), 18967#(or (= main_~status~0 0) (and (= main_~status~0 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 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_~head~0.base) main_~head~0.offset))))), 18968#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18969#(and (= main_~head~0.offset |main_#t~malloc4.offset|) (= 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 |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))), 18970#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset))), 18971#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset |main_#t~mem6.offset|)), 18972#(or (and (= main_~item~0.offset main_~head~0.offset) (= main_~item~0.base main_~head~0.base)) (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= 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_~head~0.base) main_~head~0.offset))))), 18973#(or (and (= main_~item~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base main_~head~0.base)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 18974#(or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 18975#(or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= 0 |main_#t~mem15.base|) (= |main_#t~mem15.offset| 0))), 18976#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18977#(and (= |main_#t~mem16.offset| 0) (= (select |#length| |main_#t~mem16.base|) 8))] [2018-02-02 10:31:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:53,741 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:31:53,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:31:53,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:31:53,742 INFO L87 Difference]: Start difference. First operand 218 states and 238 transitions. Second operand 26 states. [2018-02-02 10:31:55,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:55,458 INFO L93 Difference]: Finished difference Result 221 states and 241 transitions. [2018-02-02 10:31:55,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:31:55,458 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 83 [2018-02-02 10:31:55,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:55,459 INFO L225 Difference]: With dead ends: 221 [2018-02-02 10:31:55,459 INFO L226 Difference]: Without dead ends: 221 [2018-02-02 10:31:55,460 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=679, Invalid=2183, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 10:31:55,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-02-02 10:31:55,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 217. [2018-02-02 10:31:55,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-02 10:31:55,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 237 transitions. [2018-02-02 10:31:55,462 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 237 transitions. Word has length 83 [2018-02-02 10:31:55,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:55,462 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 237 transitions. [2018-02-02 10:31:55,462 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:31:55,462 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 237 transitions. [2018-02-02 10:31:55,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 10:31:55,462 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:55,462 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:55,462 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:55,462 INFO L82 PathProgramCache]: Analyzing trace with hash -87797561, now seen corresponding path program 2 times [2018-02-02 10:31:55,463 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:55,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:56,093 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:56,094 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:56,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 10:31:56,094 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:56,095 INFO L182 omatonBuilderFactory]: Interpolants [19472#true, 19473#false, 19474#(not (= 0 |main_#t~malloc0.base|)), 19475#(not (= 0 main_~head~0.base)), 19476#(and (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base))), 19477#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (not (= 0 main_~head~0.base)) (= main_~item~0.base main_~head~0.base)), 19478#(and (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset main_~item~0.offset) (not (= 0 main_~head~0.base)) (= main_~item~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 19479#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (not (= 0 main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base)), 19480#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base)) (= 0 |main_#t~mem6.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 19481#(and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base)) (= main_~item~0.offset 0)), 19482#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base)) (= main_~item~0.offset 0)), 19483#(and (= main_~status~0 (select |#valid| main_~item~0.base)) (or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base)) (= main_~item~0.offset 0))) (not (= 0 main_~head~0.base))), 19484#(and (or (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~status~0 0)) (not (= 0 main_~head~0.base)) (or (= main_~status~0 0) (and (= 1 (select |#valid| |main_#t~malloc4.base|)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~item~0.offset 0)))), 19485#(and (or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.offset 0) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))))) (or (= main_~status~0 0) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))) (not (= 0 main_~head~0.base))), 19486#(and (or (and (not (= main_~head~0.base |main_#t~mem6.base|)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))) (= main_~status~0 0)) (not (= 0 main_~head~0.base))), 19487#(or (= main_~status~0 0) (and (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~item~0.base main_~head~0.base)) (not (= 0 main_~head~0.base)) (not (= (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0))))), 19488#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~item~0.base main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 19489#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= 0 main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 19490#(and (= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (= |main_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= 0 main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 19491#(and (or (not (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= 0 main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 19492#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) 0))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) 0))) (or (not (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 main_~head~0.base))), 19493#(and (or (not (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (= 1 (select (store |#valid| main_~item~0.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= 0 main_~item~0.base))), 19494#(and (= 1 (select (store |#valid| main_~item~0.base 0) (select (select |#memory_$Pointer$.base| |main_#t~mem31.base|) 0))) (or (not (= 0 |main_#t~mem31.base|)) (not (= |main_#t~mem31.offset| 0))) (not (= 0 main_~item~0.base)) (not (= |main_#t~mem31.base| (select (select |#memory_$Pointer$.base| |main_#t~mem31.base|) 0)))), 19495#(and (or (and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select (store |#valid| main_~item~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= 0 main_~head~0.offset))) (or (not (= 0 main_~head~0.base)) (not (= main_~head~0.offset 0))) (not (= 0 main_~item~0.base))), 19496#(and (or (not (= 0 main_~head~0.base)) (not (= main_~head~0.offset 0))) (or (not (= 0 main_~head~0.offset)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))))), 19497#(and (or (not (= 0 main_~item~0.offset)) (= 1 (select (store |#valid| main_~item~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base)))), 19498#(and (or (not (= 0 main_~item~0.offset)) (= 1 (select (store |#valid| main_~item~0.base 0) |main_#t~mem31.base|))) (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base)))), 19499#(and (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base))) (or (not (= 0 main_~item~0.offset)) (= 1 (select (store |#valid| main_~item~0.base 0) main_~head~0.base)))), 19500#(= 1 (select |#valid| main_~head~0.base))] [2018-02-02 10:31:56,095 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:56,095 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 10:31:56,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 10:31:56,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:31:56,096 INFO L87 Difference]: Start difference. First operand 217 states and 237 transitions. Second operand 29 states. [2018-02-02 10:31:57,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:57,652 INFO L93 Difference]: Finished difference Result 235 states and 251 transitions. [2018-02-02 10:31:57,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:31:57,652 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 85 [2018-02-02 10:31:57,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:57,653 INFO L225 Difference]: With dead ends: 235 [2018-02-02 10:31:57,653 INFO L226 Difference]: Without dead ends: 235 [2018-02-02 10:31:57,654 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=551, Invalid=2989, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 10:31:57,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-02-02 10:31:57,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 222. [2018-02-02 10:31:57,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-02 10:31:57,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 244 transitions. [2018-02-02 10:31:57,655 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 244 transitions. Word has length 85 [2018-02-02 10:31:57,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:57,656 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 244 transitions. [2018-02-02 10:31:57,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 10:31:57,656 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 244 transitions. [2018-02-02 10:31:57,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 10:31:57,656 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:57,656 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:57,656 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:57,656 INFO L82 PathProgramCache]: Analyzing trace with hash -87797560, now seen corresponding path program 2 times [2018-02-02 10:31:57,657 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:57,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:58,112 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:58,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:31:58,112 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:58,112 INFO L182 omatonBuilderFactory]: Interpolants [20032#(or (= main_~status~0 0) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)))), 20033#(or (and (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~item~0.base main_~head~0.base)) (= 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)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0)))) (= main_~status~0 0)), 20034#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~item~0.base main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 20035#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 20036#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) 0))) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) 0))), 20037#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem31.base|) 0))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem31.base|) 0))), 20038#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) 0))), 20039#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) 0))) (= main_~head~0.offset main_~item~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) 0))), 20040#(and (or (not (= main_~item~0.offset 0)) (= 8 (select |#length| |main_#t~mem31.base|))) (or (= 0 |main_#t~mem31.offset|) (not (= main_~item~0.offset 0)))), 20041#(and (or (not (= main_~item~0.offset 0)) (= main_~head~0.offset 0)) (or (not (= main_~item~0.offset 0)) (= (select |#length| main_~head~0.base) 8))), 20042#(and (= (select |#length| main_~head~0.base) 8) (= main_~head~0.offset 0)), 20020#true, 20021#false, 20022#(= (select |#valid| main_~head~0.base) 1), 20023#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 20024#(and (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset main_~item~0.offset) (= |main_#t~malloc4.offset| 0) (= main_~item~0.base main_~head~0.base)), 20025#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base) (= (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset) 0)), 20026#(and (= |main_#t~mem6.offset| 0) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 20027#(and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~item~0.offset 0)), 20028#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~item~0.offset 0)), 20029#(and (= main_~status~0 (select |#valid| main_~item~0.base)) (or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base)) (= main_~item~0.offset 0)))), 20030#(and (or (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~status~0 0)) (or (= main_~status~0 0) (and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|)) (= main_~item~0.offset 0)))), 20031#(and (or (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~item~0.base) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))) (= main_~status~0 0)) (or (= main_~status~0 0) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))))] [2018-02-02 10:31:58,113 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:58,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:31:58,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:31:58,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:31:58,113 INFO L87 Difference]: Start difference. First operand 222 states and 244 transitions. Second operand 23 states. [2018-02-02 10:31:59,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:59,031 INFO L93 Difference]: Finished difference Result 235 states and 251 transitions. [2018-02-02 10:31:59,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:31:59,031 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 85 [2018-02-02 10:31:59,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:59,032 INFO L225 Difference]: With dead ends: 235 [2018-02-02 10:31:59,032 INFO L226 Difference]: Without dead ends: 235 [2018-02-02 10:31:59,032 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=206, Invalid=1434, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 10:31:59,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-02-02 10:31:59,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 222. [2018-02-02 10:31:59,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-02 10:31:59,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 243 transitions. [2018-02-02 10:31:59,034 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 243 transitions. Word has length 85 [2018-02-02 10:31:59,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:59,034 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 243 transitions. [2018-02-02 10:31:59,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:31:59,034 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 243 transitions. [2018-02-02 10:31:59,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 10:31:59,035 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:59,035 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:59,035 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:59,035 INFO L82 PathProgramCache]: Analyzing trace with hash -882397041, now seen corresponding path program 1 times [2018-02-02 10:31:59,036 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:59,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:59,068 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:31:59,068 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:59,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:31:59,068 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:59,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:59,069 INFO L182 omatonBuilderFactory]: Interpolants [20536#true, 20537#false, 20538#(= main_~status~0 2), 20539#(and (not (= main_~status~0 0)) (not |main_#t~short29|))] [2018-02-02 10:31:59,069 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:31:59,069 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:31:59,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:31:59,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:31:59,069 INFO L87 Difference]: Start difference. First operand 222 states and 243 transitions. Second operand 4 states. [2018-02-02 10:31:59,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:59,089 INFO L93 Difference]: Finished difference Result 243 states and 257 transitions. [2018-02-02 10:31:59,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:31:59,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-02-02 10:31:59,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:59,090 INFO L225 Difference]: With dead ends: 243 [2018-02-02 10:31:59,090 INFO L226 Difference]: Without dead ends: 243 [2018-02-02 10:31:59,090 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:31:59,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-02 10:31:59,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 219. [2018-02-02 10:31:59,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 10:31:59,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 236 transitions. [2018-02-02 10:31:59,092 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 236 transitions. Word has length 85 [2018-02-02 10:31:59,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:59,092 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 236 transitions. [2018-02-02 10:31:59,092 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:31:59,092 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 236 transitions. [2018-02-02 10:31:59,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 10:31:59,093 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:59,093 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:59,093 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:59,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1573241685, now seen corresponding path program 2 times [2018-02-02 10:31:59,093 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:59,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:59,194 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-02 10:31:59,195 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:59,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:31:59,195 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:59,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:31:59,195 INFO L182 omatonBuilderFactory]: Interpolants [21008#(or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))), 21009#(or (not (= (select (select |#memory_$Pointer$.offset| |main_#t~mem31.base|) |main_#t~mem31.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem31.base|) |main_#t~mem31.offset|) 0))), 21010#(or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0))), 21011#(or (not (= |main_#t~mem31.base| 0)) (not (= |main_#t~mem31.offset| 0))), 21012#(or (not (= main_~head~0.base 0)) (not (= main_~head~0.offset 0))), 21004#true, 21005#false, 21006#(and (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 21007#(and (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))] [2018-02-02 10:31:59,195 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-02 10:31:59,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:31:59,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:31:59,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:31:59,196 INFO L87 Difference]: Start difference. First operand 219 states and 236 transitions. Second operand 9 states. [2018-02-02 10:31:59,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:59,365 INFO L93 Difference]: Finished difference Result 222 states and 235 transitions. [2018-02-02 10:31:59,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:31:59,365 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2018-02-02 10:31:59,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:59,366 INFO L225 Difference]: With dead ends: 222 [2018-02-02 10:31:59,366 INFO L226 Difference]: Without dead ends: 222 [2018-02-02 10:31:59,366 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:31:59,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-02 10:31:59,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 219. [2018-02-02 10:31:59,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 10:31:59,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 235 transitions. [2018-02-02 10:31:59,369 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 235 transitions. Word has length 86 [2018-02-02 10:31:59,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:59,369 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 235 transitions. [2018-02-02 10:31:59,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:31:59,369 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 235 transitions. [2018-02-02 10:31:59,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 10:31:59,370 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:59,370 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1] [2018-02-02 10:31:59,370 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:59,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1525902088, now seen corresponding path program 2 times [2018-02-02 10:31:59,371 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:59,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:59,862 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:59,863 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:59,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:31:59,863 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:59,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:59,864 INFO L182 omatonBuilderFactory]: Interpolants [21472#(and (= |main_#t~mem6.offset| 0) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 21473#(and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~item~0.offset 0)), 21474#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~item~0.offset 0)), 21475#(or (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base)) (= main_~item~0.offset 0)) (= main_~status~0 0)), 21476#(or (= main_~status~0 0) (and (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|) (= main_~item~0.offset 0))), 21477#(or (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) 0)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))) (= main_~status~0 0)), 21478#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|))) (= main_~status~0 0)), 21479#(or (and (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~item~0.base main_~head~0.base))) (= main_~status~0 0)), 21480#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~item~0.base main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 21481#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)), 21482#(and (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) 0))), 21483#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem31.base|) 0)), 21484#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) 0)), 21485#(and (= main_~head~0.offset main_~item~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) 0))), 21486#(or (= 0 |main_#t~mem31.offset|) (not (= main_~item~0.offset 0))), 21487#(or (= 0 main_~head~0.offset) (not (= main_~item~0.offset 0))), 21488#(= 0 main_~head~0.offset), 21489#(= main_~item~0.offset 0), 21466#true, 21467#false, 21468#(= (select |#valid| main_~head~0.base) 1), 21469#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 21470#(and (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset main_~item~0.offset) (= |main_#t~malloc4.offset| 0) (= main_~item~0.base main_~head~0.base)), 21471#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base) (= (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset) 0))] [2018-02-02 10:31:59,864 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:59,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:31:59,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:31:59,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:31:59,864 INFO L87 Difference]: Start difference. First operand 219 states and 235 transitions. Second operand 24 states. [2018-02-02 10:32:00,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:00,768 INFO L93 Difference]: Finished difference Result 229 states and 242 transitions. [2018-02-02 10:32:00,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:32:00,768 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 87 [2018-02-02 10:32:00,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:00,769 INFO L225 Difference]: With dead ends: 229 [2018-02-02 10:32:00,769 INFO L226 Difference]: Without dead ends: 229 [2018-02-02 10:32:00,769 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=273, Invalid=1797, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:32:00,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-02 10:32:00,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 219. [2018-02-02 10:32:00,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 10:32:00,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 235 transitions. [2018-02-02 10:32:00,771 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 235 transitions. Word has length 87 [2018-02-02 10:32:00,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:00,771 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 235 transitions. [2018-02-02 10:32:00,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:32:00,771 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 235 transitions. [2018-02-02 10:32:00,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 10:32:00,771 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:00,771 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:00,771 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:00,772 INFO L82 PathProgramCache]: Analyzing trace with hash -419110422, now seen corresponding path program 1 times [2018-02-02 10:32:00,772 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:00,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:01,086 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:01,086 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:01,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:32:01,086 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:01,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:01,087 INFO L182 omatonBuilderFactory]: Interpolants [21984#(= (select |#valid| main_~head~0.base) 1), 21985#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 21986#(and (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset main_~item~0.offset) (= main_~item~0.base main_~head~0.base)), 21987#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base)), 21988#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 21989#(and (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 21990#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21991#(or (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base)) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~head~0.base))) (= main_~status~0 0)), 21992#(or (and (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))) (= main_~status~0 0)), 21993#(or (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))) (= main_~status~0 0)), 21994#(or (and (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= main_~status~0 0)), 21995#(or (and (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base))) (= main_~status~0 0)), 21996#(or (and (not (= main_~item~0.base main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) (= main_~status~0 0)), 21997#(and (not (= main_~item~0.base main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 21998#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 21999#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 22000#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset|))), 22001#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))), 22002#(= 1 (select |#valid| |main_#t~mem30.base|)), 22003#(= 1 (select |#valid| main_~item~0.base)), 21982#true, 21983#false] [2018-02-02 10:32:01,087 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:01,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:32:01,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:32:01,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:32:01,087 INFO L87 Difference]: Start difference. First operand 219 states and 235 transitions. Second operand 22 states. [2018-02-02 10:32:02,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:02,581 INFO L93 Difference]: Finished difference Result 242 states and 256 transitions. [2018-02-02 10:32:02,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:32:02,581 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 87 [2018-02-02 10:32:02,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:02,581 INFO L225 Difference]: With dead ends: 242 [2018-02-02 10:32:02,581 INFO L226 Difference]: Without dead ends: 242 [2018-02-02 10:32:02,582 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=312, Invalid=1668, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 10:32:02,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-02 10:32:02,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 227. [2018-02-02 10:32:02,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-02-02 10:32:02,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 246 transitions. [2018-02-02 10:32:02,584 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 246 transitions. Word has length 87 [2018-02-02 10:32:02,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:02,584 INFO L432 AbstractCegarLoop]: Abstraction has 227 states and 246 transitions. [2018-02-02 10:32:02,584 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:32:02,584 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 246 transitions. [2018-02-02 10:32:02,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 10:32:02,584 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:02,584 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:02,584 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:02,584 INFO L82 PathProgramCache]: Analyzing trace with hash -419110421, now seen corresponding path program 1 times [2018-02-02 10:32:02,585 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:02,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:02,938 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:02,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:32:02,938 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:02,939 INFO L182 omatonBuilderFactory]: Interpolants [22528#(and (or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~head~0.base)))) (= main_~status~0 (select |#valid| main_~item~0.base))), 22529#(and (or (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~status~0 0)) (or (and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|)) (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))) (= main_~status~0 0))), 22530#(and (or (= main_~status~0 0) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))) (or (= main_~status~0 0) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~item~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))))), 22531#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|))) (= main_~status~0 0)), 22532#(or (and (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 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)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~item~0.base main_~head~0.base))) (= main_~status~0 0)), 22533#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= main_~item~0.base main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 22534#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 22535#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 22536#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem25.base|) |main_#t~mem25.offset|))), 22537#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))), 22538#(and (= 0 |main_#t~mem30.offset|) (= 8 (select |#length| |main_#t~mem30.base|))), 22539#(and (= (select |#length| main_~item~0.base) 8) (= main_~item~0.offset 0)), 22519#true, 22520#false, 22521#(= (select |#valid| main_~head~0.base) 1), 22522#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 22523#(and (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset main_~item~0.offset) (= main_~item~0.base main_~head~0.base)), 22524#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base)), 22525#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 22526#(and (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 22527#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 10:32:02,939 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:02,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:32:02,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:32:02,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:32:02,939 INFO L87 Difference]: Start difference. First operand 227 states and 246 transitions. Second operand 21 states. [2018-02-02 10:32:03,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:03,966 INFO L93 Difference]: Finished difference Result 245 states and 260 transitions. [2018-02-02 10:32:03,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:32:03,966 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 87 [2018-02-02 10:32:03,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:03,967 INFO L225 Difference]: With dead ends: 245 [2018-02-02 10:32:03,967 INFO L226 Difference]: Without dead ends: 245 [2018-02-02 10:32:03,967 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=210, Invalid=1272, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:32:03,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-02-02 10:32:03,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 231. [2018-02-02 10:32:03,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 10:32:03,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 249 transitions. [2018-02-02 10:32:03,969 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 249 transitions. Word has length 87 [2018-02-02 10:32:03,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:03,969 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 249 transitions. [2018-02-02 10:32:03,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:32:03,969 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 249 transitions. [2018-02-02 10:32:03,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 10:32:03,970 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:03,970 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:03,970 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:03,970 INFO L82 PathProgramCache]: Analyzing trace with hash -843092644, now seen corresponding path program 1 times [2018-02-02 10:32:03,970 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:03,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:03,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:04,003 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-02-02 10:32:04,003 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:04,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:32:04,004 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:04,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:04,004 INFO L182 omatonBuilderFactory]: Interpolants [23056#(= 1 (select |#valid| |main_#t~mem18.base|)), 23052#true, 23053#false, 23054#(= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)), 23055#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 10:32:04,004 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-02-02 10:32:04,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:32:04,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:32:04,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:32:04,005 INFO L87 Difference]: Start difference. First operand 231 states and 249 transitions. Second operand 5 states. [2018-02-02 10:32:04,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:04,085 INFO L93 Difference]: Finished difference Result 233 states and 248 transitions. [2018-02-02 10:32:04,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:32:04,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2018-02-02 10:32:04,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:04,086 INFO L225 Difference]: With dead ends: 233 [2018-02-02 10:32:04,086 INFO L226 Difference]: Without dead ends: 233 [2018-02-02 10:32:04,086 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:32:04,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-02 10:32:04,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2018-02-02 10:32:04,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-02 10:32:04,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 248 transitions. [2018-02-02 10:32:04,088 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 248 transitions. Word has length 88 [2018-02-02 10:32:04,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:04,088 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 248 transitions. [2018-02-02 10:32:04,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:32:04,088 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 248 transitions. [2018-02-02 10:32:04,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 10:32:04,089 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:04,089 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:04,089 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:04,089 INFO L82 PathProgramCache]: Analyzing trace with hash -843092643, now seen corresponding path program 1 times [2018-02-02 10:32:04,089 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:04,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:04,133 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-02-02 10:32:04,133 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:04,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:32:04,134 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:04,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:04,134 INFO L182 omatonBuilderFactory]: Interpolants [23524#true, 23525#false, 23526#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23527#(and (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 23528#(and (<= (+ |main_#t~mem18.offset| 4) (select |#length| |main_#t~mem18.base|)) (<= 0 |main_#t~mem18.offset|))] [2018-02-02 10:32:04,134 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-02-02 10:32:04,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:32:04,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:32:04,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:32:04,134 INFO L87 Difference]: Start difference. First operand 230 states and 248 transitions. Second operand 5 states. [2018-02-02 10:32:04,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:04,206 INFO L93 Difference]: Finished difference Result 232 states and 247 transitions. [2018-02-02 10:32:04,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:32:04,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2018-02-02 10:32:04,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:04,207 INFO L225 Difference]: With dead ends: 232 [2018-02-02 10:32:04,207 INFO L226 Difference]: Without dead ends: 232 [2018-02-02 10:32:04,207 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:32:04,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-02 10:32:04,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 229. [2018-02-02 10:32:04,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-02-02 10:32:04,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 247 transitions. [2018-02-02 10:32:04,208 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 247 transitions. Word has length 88 [2018-02-02 10:32:04,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:04,209 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 247 transitions. [2018-02-02 10:32:04,209 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:32:04,209 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 247 transitions. [2018-02-02 10:32:04,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 10:32:04,209 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:04,209 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:04,209 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:04,209 INFO L82 PathProgramCache]: Analyzing trace with hash -366067921, now seen corresponding path program 1 times [2018-02-02 10:32:04,210 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:04,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:04,704 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:04,704 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:04,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:32:04,704 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:04,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:04,705 INFO L182 omatonBuilderFactory]: Interpolants [24000#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 24001#(and (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 24002#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 24003#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 1) (= main_~status~0 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base)) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~head~0.base))), 24004#(or (= main_~status~0 0) (and (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~status~0 1) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~status~0 (select |#valid| main_~head~0.base)) (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)))), 24005#(or (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~item~0.base)) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))) (= main_~status~0 0)), 24006#(or (= main_~status~0 0) (and (= main_~status~0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 (select |#valid| main_~head~0.base)))), 24007#(or (and (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~status~0 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base))) (= main_~status~0 0)), 24008#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select |#valid| main_~head~0.base) 0)) (not (= main_~item~0.base main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))), 24009#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc4.base|)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc4.base|))), 24010#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))), 24011#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 24012#(and (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))))), 24013#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 24014#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 24015#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|))), 24016#(= 1 (select |#valid| |main_#t~mem19.base|)), 23994#true, 23995#false, 23996#(= (select |#valid| main_~head~0.base) 1), 23997#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 23998#(and (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset main_~item~0.offset) (= main_~item~0.base main_~head~0.base)), 23999#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base))] [2018-02-02 10:32:04,705 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:04,705 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:32:04,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:32:04,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:32:04,705 INFO L87 Difference]: Start difference. First operand 229 states and 247 transitions. Second operand 23 states. [2018-02-02 10:32:05,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:05,859 INFO L93 Difference]: Finished difference Result 325 states and 349 transitions. [2018-02-02 10:32:05,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:32:05,860 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 89 [2018-02-02 10:32:05,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:05,860 INFO L225 Difference]: With dead ends: 325 [2018-02-02 10:32:05,860 INFO L226 Difference]: Without dead ends: 325 [2018-02-02 10:32:05,861 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=244, Invalid=1648, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:32:05,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-02-02 10:32:05,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 270. [2018-02-02 10:32:05,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-02-02 10:32:05,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 290 transitions. [2018-02-02 10:32:05,863 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 290 transitions. Word has length 89 [2018-02-02 10:32:05,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:05,863 INFO L432 AbstractCegarLoop]: Abstraction has 270 states and 290 transitions. [2018-02-02 10:32:05,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:32:05,863 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 290 transitions. [2018-02-02 10:32:05,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 10:32:05,864 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:05,864 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:05,864 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:05,864 INFO L82 PathProgramCache]: Analyzing trace with hash -366067920, now seen corresponding path program 1 times [2018-02-02 10:32:05,864 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:05,874 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:06,404 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:06,404 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:06,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:32:06,405 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:06,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:06,405 INFO L182 omatonBuilderFactory]: Interpolants [24672#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 24673#(and (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (<= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))))), 24674#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 24675#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 24676#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)))), 24677#(and (<= 4 (select |#length| |main_#t~mem19.base|)) (= |main_#t~mem19.offset| 0)), 24654#true, 24655#false, 24656#(= (select |#valid| main_~head~0.base) 1), 24657#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 24658#(and (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset main_~item~0.offset) (= main_~item~0.base main_~head~0.base)), 24659#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base)), 24660#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 24661#(and (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 24662#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 24663#(or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 1) (= main_~status~0 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base)) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~head~0.base)))), 24664#(or (and (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~status~0 1) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~status~0 (select |#valid| main_~head~0.base)) (= 0 |main_#t~malloc4.offset|) (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))) (= main_~status~0 0)), 24665#(or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 (select |#valid| main_~item~0.base)) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~status~0 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))))), 24666#(or (= main_~status~0 0) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) |main_#t~mem6.base|) (= main_~status~0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= main_~status~0 (select |#valid| main_~head~0.base)))), 24667#(or (= main_~status~0 0) (and (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~status~0 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base)))), 24668#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~item~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (<= 0 main_~item~0.offset) (not (= main_~item~0.base main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base))) (= main_~status~0 0)), 24669#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~item~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select |#valid| main_~head~0.base) 0)) (not (= main_~item~0.base main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (<= 0 main_~item~0.offset) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))), 24670#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc4.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.offset|)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))) (<= 0 main_~item~0.offset) (not (= main_~head~0.base |main_#t~malloc4.base|))), 24671#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~item~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (<= 4 (select |#length| main_~item~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))))] [2018-02-02 10:32:06,405 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:06,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:32:06,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:32:06,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:32:06,406 INFO L87 Difference]: Start difference. First operand 270 states and 290 transitions. Second operand 24 states. [2018-02-02 10:32:07,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:07,805 INFO L93 Difference]: Finished difference Result 324 states and 348 transitions. [2018-02-02 10:32:07,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:32:07,805 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 89 [2018-02-02 10:32:07,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:07,806 INFO L225 Difference]: With dead ends: 324 [2018-02-02 10:32:07,806 INFO L226 Difference]: Without dead ends: 324 [2018-02-02 10:32:07,807 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=301, Invalid=1955, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 10:32:07,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-02-02 10:32:07,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 270. [2018-02-02 10:32:07,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-02-02 10:32:07,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 289 transitions. [2018-02-02 10:32:07,809 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 289 transitions. Word has length 89 [2018-02-02 10:32:07,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:07,809 INFO L432 AbstractCegarLoop]: Abstraction has 270 states and 289 transitions. [2018-02-02 10:32:07,809 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:32:07,809 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 289 transitions. [2018-02-02 10:32:07,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-02-02 10:32:07,809 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:07,810 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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:32:07,810 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:07,810 INFO L82 PathProgramCache]: Analyzing trace with hash 215614319, now seen corresponding path program 3 times [2018-02-02 10:32:07,810 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:07,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:08,414 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:08,414 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:08,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 10:32:08,414 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:08,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:08,415 INFO L182 omatonBuilderFactory]: Interpolants [25344#(or (not (= 0 main_~head~0.offset)) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 25345#(or (not (= 0 main_~item~0.offset)) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 25346#(or (not (= 0 main_~item~0.offset)) (and (= 0 |main_#t~mem31.offset|) (= 0 |main_#t~mem31.base|))), 25347#(or (not (= 0 main_~item~0.offset)) (and (= 0 main_~head~0.base) (= main_~head~0.offset 0))), 25348#(and (= 0 main_~head~0.base) (= main_~head~0.offset 0)), 25320#true, 25321#false, 25322#(= (select |#valid| main_~head~0.base) 1), 25323#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 25324#(and (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset main_~item~0.offset) (= |main_#t~malloc4.offset| 0) (= main_~item~0.base main_~head~0.base)), 25325#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base) (= (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset) 0)), 25326#(and (= |main_#t~mem6.offset| 0) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 25327#(and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~item~0.offset 0)), 25328#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~item~0.offset 0)), 25329#(or (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base)) (= main_~item~0.offset 0)) (= main_~status~0 0)), 25330#(or (= main_~status~0 0) (and (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|) (= main_~item~0.offset 0))), 25331#(or (= main_~status~0 0) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.offset 0) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))))), 25332#(or (= main_~status~0 0) (and (not (= main_~head~0.base |main_#t~mem6.base|)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= 0 |main_#t~mem6.offset|))), 25333#(or (= main_~status~0 0) (and (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~item~0.base main_~head~0.base)) (= main_~item~0.offset 0))), 25334#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~item~0.base main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~item~0.offset 0)) (= main_~status~0 0)), 25335#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~item~0.base main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~item~0.offset 0)), 25336#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= main_~item~0.offset 0)), 25337#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) 0))), 25338#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) 0)) 0)) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) 0)) 0))), 25339#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem31.base|) 0)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem31.base|) 0)) 0))), 25340#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.offset 0))), 25341#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~item~0.offset 0))), 25342#(or (and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem31.base|) 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem31.base|) 0))) (not (= main_~item~0.offset 0))), 25343#(or (not (= 0 main_~head~0.offset)) (not (= main_~item~0.offset 0)) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))] [2018-02-02 10:32:08,415 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:08,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 10:32:08,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 10:32:08,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:32:08,415 INFO L87 Difference]: Start difference. First operand 270 states and 289 transitions. Second operand 29 states. [2018-02-02 10:32:09,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:09,537 INFO L93 Difference]: Finished difference Result 277 states and 293 transitions. [2018-02-02 10:32:09,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:32:09,537 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 90 [2018-02-02 10:32:09,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:09,538 INFO L225 Difference]: With dead ends: 277 [2018-02-02 10:32:09,538 INFO L226 Difference]: Without dead ends: 277 [2018-02-02 10:32:09,539 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=301, Invalid=2351, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 10:32:09,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-02-02 10:32:09,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 267. [2018-02-02 10:32:09,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-02-02 10:32:09,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 286 transitions. [2018-02-02 10:32:09,540 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 286 transitions. Word has length 90 [2018-02-02 10:32:09,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:09,541 INFO L432 AbstractCegarLoop]: Abstraction has 267 states and 286 transitions. [2018-02-02 10:32:09,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 10:32:09,541 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 286 transitions. [2018-02-02 10:32:09,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-02 10:32:09,541 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:09,541 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:09,541 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:09,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1905891923, now seen corresponding path program 3 times [2018-02-02 10:32:09,542 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:09,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:11,169 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:11,169 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:11,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 10:32:11,169 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:11,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:11,170 INFO L182 omatonBuilderFactory]: Interpolants [25939#true, 25940#false, 25941#(= |#valid| |old(#valid)|), 25942#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|))), 25943#(and (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|)), 25944#(and (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|)), 25945#(and (= main_~item~0.offset main_~head~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~head~0.base main_~item~0.base) (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|)), 25946#(and (= main_~item~0.offset main_~head~0.offset) (= main_~head~0.base main_~item~0.base) (= |old(#valid)| (store (store |#valid| |main_#t~malloc4.base| 0) main_~head~0.base 0)) (= |main_#t~malloc4.offset| 0) (not (= 0 main_~head~0.base)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 25947#(and (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~head~0.offset) 0) main_~head~0.base 0) |old(#valid)|) (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (not (= 0 main_~head~0.base)) (= main_~item~0.base main_~head~0.base) (= (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset) 0) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~head~0.offset)))), 25948#(and (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) main_~head~0.base 0) |old(#valid)|) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base)) (= 0 |main_#t~mem6.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 25949#(and (= (store (store |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset) 0) main_~head~0.base 0) |old(#valid)|) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base)) (= main_~item~0.offset 0)), 25950#(and (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) main_~head~0.base 0) |old(#valid)|) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base)) (= main_~item~0.offset 0)), 25951#(or (= main_~status~0 0) (and (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) main_~head~0.base 0) |old(#valid)|) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base)) (not (= 0 main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base)) (= main_~item~0.offset 0))), 25952#(or (= main_~status~0 0) (and (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset))) (= (store (store (store |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset) 0) |main_#t~malloc4.base| 0) main_~head~0.base 0) |old(#valid)|) (not (= (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc4.base|)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= 0 main_~head~0.base)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~item~0.offset 0))), 25953#(or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base)) (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset) 0) main_~head~0.base 0) |old(#valid)|) (= main_~item~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~item~0.base) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))))), 25954#(or (= main_~status~0 0) (and (not (= main_~head~0.base |main_#t~mem6.base|)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) 0) main_~head~0.base 0) |old(#valid)|) (not (= 0 main_~head~0.base)))), 25955#(or (= main_~status~0 0) (and (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= (store (store (store |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset) 0) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0) 0) main_~head~0.base 0) |old(#valid)|) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~item~0.base main_~head~0.base)) (not (= 0 main_~head~0.base)) (not (= (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0))))), 25956#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) 0) main_~head~0.base 0) |old(#valid)|) (not (= 0 main_~head~0.base))), 25957#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) 0) main_~head~0.base 0) |old(#valid)|) (not (= 0 main_~head~0.base))), 25958#(and (= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (= |main_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) 0) main_~head~0.base 0) |old(#valid)|) (not (= 0 main_~head~0.base))), 25959#(and (or (not (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) 0) main_~head~0.base 0) |old(#valid)|) (not (= 0 main_~head~0.base))), 25960#(and (or (not (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |old(#valid)| (store (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) 0) 0) main_~head~0.base 0)) (not (= 0 main_~head~0.base))), 25961#(and (= (store (store (store |#valid| main_~item~0.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) |old(#valid)|) (or (not (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~item~0.base))), 25962#(and (or (not (= 0 |main_#t~mem31.base|)) (not (= |main_#t~mem31.offset| 0))) (= (store (store (store |#valid| main_~item~0.base 0) (select (select |#memory_$Pointer$.base| |main_#t~mem31.base|) 0) 0) |main_#t~mem31.base| 0) |old(#valid)|) (not (= main_~item~0.base |main_#t~mem31.base|)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem31.base|) 0))) (not (= 0 main_~item~0.base)) (not (= |main_#t~mem31.base| (select (select |#memory_$Pointer$.base| |main_#t~mem31.base|) 0)))), 25963#(and (or (not (= 0 main_~head~0.base)) (not (= main_~head~0.offset 0))) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) 0))) (not (= main_~item~0.base main_~head~0.base)) (or (not (= 0 main_~head~0.offset)) (= |old(#valid)| (store (store (store |#valid| main_~item~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) main_~head~0.base 0))) (not (= 0 main_~item~0.base))), 25964#(and (or (not (= 0 main_~head~0.base)) (not (= main_~head~0.offset 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) 0))) (or (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) main_~head~0.base 0) |old(#valid)|) (not (= 0 main_~head~0.offset)))), 25965#(and (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) 0))) (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base))) (or (not (= 0 main_~item~0.offset)) (= (store (store |#valid| main_~item~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) |old(#valid)|)) (= main_~head~0.offset main_~item~0.offset)), 25966#(and (or (not (= main_~item~0.offset 0)) (= |old(#valid)| (store (store |#valid| main_~item~0.base 0) |main_#t~mem31.base| 0))) (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base))) (or (not (= main_~item~0.offset 0)) (not (= main_~item~0.base |main_#t~mem31.base|)))), 25967#(and (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base))) (or (not (= main_~item~0.offset 0)) (= (store (store |#valid| main_~item~0.base 0) main_~head~0.base 0) |old(#valid)|)) (or (not (= main_~item~0.offset 0)) (not (= main_~item~0.base main_~head~0.base)))), 25968#(= (store |#valid| main_~head~0.base 0) |old(#valid)|), 25969#(and (or (not (= main_~item~0.offset 0)) (not (= 0 main_~item~0.base))) (= (store |#valid| main_~item~0.base 0) |old(#valid)|))] [2018-02-02 10:32:11,170 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:11,170 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 10:32:11,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 10:32:11,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=857, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:32:11,170 INFO L87 Difference]: Start difference. First operand 267 states and 286 transitions. Second operand 31 states. [2018-02-02 10:32:12,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:12,725 INFO L93 Difference]: Finished difference Result 279 states and 294 transitions. [2018-02-02 10:32:12,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 10:32:12,725 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 91 [2018-02-02 10:32:12,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:12,726 INFO L225 Difference]: With dead ends: 279 [2018-02-02 10:32:12,726 INFO L226 Difference]: Without dead ends: 259 [2018-02-02 10:32:12,727 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=247, Invalid=2723, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 10:32:12,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-02-02 10:32:12,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2018-02-02 10:32:12,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-02-02 10:32:12,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 270 transitions. [2018-02-02 10:32:12,729 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 270 transitions. Word has length 91 [2018-02-02 10:32:12,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:12,729 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 270 transitions. [2018-02-02 10:32:12,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 10:32:12,729 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 270 transitions. [2018-02-02 10:32:12,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 10:32:12,730 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:12,730 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:12,730 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:12,730 INFO L82 PathProgramCache]: Analyzing trace with hash 598524654, now seen corresponding path program 1 times [2018-02-02 10:32:12,730 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:12,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:12,766 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-02-02 10:32:12,767 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:12,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:32:12,767 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:12,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:12,767 INFO L182 omatonBuilderFactory]: Interpolants [26553#true, 26554#false, 26555#(= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)), 26556#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 26557#(= 1 (select |#valid| |main_#t~mem21.base|))] [2018-02-02 10:32:12,767 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-02-02 10:32:12,768 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:32:12,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:32:12,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:32:12,768 INFO L87 Difference]: Start difference. First operand 256 states and 270 transitions. Second operand 5 states. [2018-02-02 10:32:12,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:12,825 INFO L93 Difference]: Finished difference Result 258 states and 269 transitions. [2018-02-02 10:32:12,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:32:12,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-02-02 10:32:12,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:12,826 INFO L225 Difference]: With dead ends: 258 [2018-02-02 10:32:12,826 INFO L226 Difference]: Without dead ends: 258 [2018-02-02 10:32:12,826 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:32:12,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-02 10:32:12,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 255. [2018-02-02 10:32:12,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-02-02 10:32:12,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 269 transitions. [2018-02-02 10:32:12,828 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 269 transitions. Word has length 94 [2018-02-02 10:32:12,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:12,828 INFO L432 AbstractCegarLoop]: Abstraction has 255 states and 269 transitions. [2018-02-02 10:32:12,828 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:32:12,828 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 269 transitions. [2018-02-02 10:32:12,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 10:32:12,828 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:12,828 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:12,828 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:12,828 INFO L82 PathProgramCache]: Analyzing trace with hash 598524655, now seen corresponding path program 1 times [2018-02-02 10:32:12,829 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:12,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:12,895 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-02-02 10:32:12,895 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:12,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:32:12,896 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:12,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:12,896 INFO L182 omatonBuilderFactory]: Interpolants [27075#true, 27076#false, 27077#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 27078#(and (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 4) (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 27079#(and (= |main_#t~mem18.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 4) (select |#length| |main_#t~mem18.base|))), 27080#(and (<= 0 |main_#t~mem21.offset|) (<= (+ |main_#t~mem21.offset| 4) (select |#length| |main_#t~mem21.base|)))] [2018-02-02 10:32:12,896 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-02-02 10:32:12,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:32:12,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:32:12,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:32:12,896 INFO L87 Difference]: Start difference. First operand 255 states and 269 transitions. Second operand 6 states. [2018-02-02 10:32:12,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:12,967 INFO L93 Difference]: Finished difference Result 257 states and 268 transitions. [2018-02-02 10:32:12,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:32:12,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-02-02 10:32:12,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:12,968 INFO L225 Difference]: With dead ends: 257 [2018-02-02 10:32:12,968 INFO L226 Difference]: Without dead ends: 257 [2018-02-02 10:32:12,969 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:32:12,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-02 10:32:12,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 254. [2018-02-02 10:32:12,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-02 10:32:12,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 268 transitions. [2018-02-02 10:32:12,970 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 268 transitions. Word has length 94 [2018-02-02 10:32:12,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:12,971 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 268 transitions. [2018-02-02 10:32:12,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:32:12,971 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 268 transitions. [2018-02-02 10:32:12,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-02 10:32:12,971 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:12,971 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:12,971 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:12,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1374395383, now seen corresponding path program 1 times [2018-02-02 10:32:12,972 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:12,977 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:13,007 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-02-02 10:32:13,007 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:13,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:32:13,007 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:13,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:13,008 INFO L182 omatonBuilderFactory]: Interpolants [27600#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 27601#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) |main_#t~mem21.offset|))), 27602#(= 1 (select |#valid| |main_#t~mem22.base|)), 27596#true, 27597#false, 27598#(and (= |main_#t~mem18.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem18.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 27599#(= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 10:32:13,008 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-02-02 10:32:13,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:32:13,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:32:13,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:32:13,009 INFO L87 Difference]: Start difference. First operand 254 states and 268 transitions. Second operand 7 states. [2018-02-02 10:32:13,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:13,114 INFO L93 Difference]: Finished difference Result 256 states and 267 transitions. [2018-02-02 10:32:13,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:32:13,115 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-02-02 10:32:13,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:13,115 INFO L225 Difference]: With dead ends: 256 [2018-02-02 10:32:13,115 INFO L226 Difference]: Without dead ends: 256 [2018-02-02 10:32:13,116 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:32:13,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-02-02 10:32:13,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 253. [2018-02-02 10:32:13,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-02-02 10:32:13,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 267 transitions. [2018-02-02 10:32:13,117 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 267 transitions. Word has length 95 [2018-02-02 10:32:13,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:13,118 INFO L432 AbstractCegarLoop]: Abstraction has 253 states and 267 transitions. [2018-02-02 10:32:13,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:32:13,118 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 267 transitions. [2018-02-02 10:32:13,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-02 10:32:13,118 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:13,118 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:13,118 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:13,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1374395384, now seen corresponding path program 1 times [2018-02-02 10:32:13,119 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:13,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:13,196 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-02-02 10:32:13,196 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:13,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:32:13,196 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:13,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:32:13,197 INFO L182 omatonBuilderFactory]: Interpolants [28120#true, 28121#false, 28122#(and (= |main_#t~mem18.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem18.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 28123#(and (= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem19.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 28124#(and (<= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 4) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 28125#(and (<= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) |main_#t~mem21.offset|)) (<= (+ (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) |main_#t~mem21.offset|) 4) (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) |main_#t~mem21.offset|)))), 28126#(and (<= (+ |main_#t~mem22.offset| 4) (select |#length| |main_#t~mem22.base|)) (<= 0 |main_#t~mem22.offset|))] [2018-02-02 10:32:13,197 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-02-02 10:32:13,197 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:32:13,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:32:13,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:32:13,198 INFO L87 Difference]: Start difference. First operand 253 states and 267 transitions. Second operand 7 states. [2018-02-02 10:32:13,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:13,383 INFO L93 Difference]: Finished difference Result 255 states and 266 transitions. [2018-02-02 10:32:13,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:32:13,383 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-02-02 10:32:13,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:13,384 INFO L225 Difference]: With dead ends: 255 [2018-02-02 10:32:13,384 INFO L226 Difference]: Without dead ends: 255 [2018-02-02 10:32:13,384 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:32:13,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-02 10:32:13,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2018-02-02 10:32:13,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-02-02 10:32:13,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 266 transitions. [2018-02-02 10:32:13,386 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 266 transitions. Word has length 95 [2018-02-02 10:32:13,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:13,386 INFO L432 AbstractCegarLoop]: Abstraction has 252 states and 266 transitions. [2018-02-02 10:32:13,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:32:13,386 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 266 transitions. [2018-02-02 10:32:13,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-02 10:32:13,387 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:13,387 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:13,387 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:13,387 INFO L82 PathProgramCache]: Analyzing trace with hash -343415791, now seen corresponding path program 1 times [2018-02-02 10:32:13,388 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:13,404 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:14,227 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:14,228 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:14,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 10:32:14,228 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:14,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:14,228 INFO L182 omatonBuilderFactory]: Interpolants [28642#true, 28643#false, 28644#(= (select |#valid| main_~head~0.base) 1), 28645#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 28646#(and (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset main_~item~0.offset) (= main_~item~0.base main_~head~0.base)), 28647#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base)), 28648#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 28649#(and (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 28650#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 28651#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 1) (= main_~status~0 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base)) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~head~0.base))), 28652#(or (= main_~status~0 0) (and (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~status~0 1) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~status~0 (select |#valid| main_~head~0.base)) (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)))), 28653#(or (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 1) (= main_~status~0 (select |#valid| main_~item~0.base)) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~status~0 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))) (= main_~status~0 0)), 28654#(or (= main_~status~0 0) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) |main_#t~mem6.base|) (= main_~status~0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 1) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= main_~status~0 (select |#valid| main_~head~0.base)) (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 28655#(or (and (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~status~0 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~status~0 1) (not (= main_~item~0.base main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base)) (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (= main_~status~0 0)), 28656#(or (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 (select |#valid| main_~head~0.base))) (= main_~status~0 0)), 28657#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select |#valid| main_~head~0.base) 0)) (not (= main_~item~0.base main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select |#valid| main_~item~0.base) 0))), 28658#(and (not (= main_~item~0.base |main_#t~malloc4.base|)) (not (= (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc4.base|)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.offset|)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)))), 28659#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))), 28660#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) |main_#t~mem6.base|)) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 28661#(and (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~item~0.base main_~head~0.base)) (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))))), 28662#(and (= 1 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= main_~item~0.base main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~item~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 28663#(and (= 1 (select |#valid| main_~item~0.base)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 28664#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 28665#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))), 28666#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) (= |main_#t~mem18.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem18.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 28667#(and (= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))), 28668#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) |main_#t~mem21.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) |main_#t~mem21.offset|)))), 28669#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|))), 28670#(= 1 (select |#valid| |main_#t~mem23.base|))] [2018-02-02 10:32:14,228 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:14,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 10:32:14,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 10:32:14,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:32:14,229 INFO L87 Difference]: Start difference. First operand 252 states and 266 transitions. Second operand 29 states. [2018-02-02 10:32:15,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:15,783 INFO L93 Difference]: Finished difference Result 301 states and 320 transitions. [2018-02-02 10:32:15,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:32:15,784 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 96 [2018-02-02 10:32:15,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:15,784 INFO L225 Difference]: With dead ends: 301 [2018-02-02 10:32:15,784 INFO L226 Difference]: Without dead ends: 301 [2018-02-02 10:32:15,785 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=328, Invalid=2752, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 10:32:15,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-02 10:32:15,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 259. [2018-02-02 10:32:15,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-02-02 10:32:15,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 274 transitions. [2018-02-02 10:32:15,786 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 274 transitions. Word has length 96 [2018-02-02 10:32:15,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:15,786 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 274 transitions. [2018-02-02 10:32:15,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 10:32:15,786 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 274 transitions. [2018-02-02 10:32:15,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-02 10:32:15,787 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:15,787 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:15,787 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:15,787 INFO L82 PathProgramCache]: Analyzing trace with hash -343415790, now seen corresponding path program 1 times [2018-02-02 10:32:15,788 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:15,800 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:16,413 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:16,413 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:16,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:32:16,414 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:16,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:16,414 INFO L182 omatonBuilderFactory]: Interpolants [29285#true, 29286#false, 29287#(= (select |#valid| main_~head~0.base) 1), 29288#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 29289#(and (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset main_~item~0.offset) (= main_~item~0.base main_~head~0.base)), 29290#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base)), 29291#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 29292#(and (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 29293#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 29294#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 1) (= main_~status~0 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base)) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~head~0.base))), 29295#(and (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~status~0 1) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~status~0 (select |#valid| main_~head~0.base)) (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))), 29296#(and (or (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 1) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))) (= main_~status~0 0)) (or (= main_~status~0 0) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))) (= main_~status~0 (select |#valid| main_~item~0.base))), 29297#(or (= main_~status~0 0) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) |main_#t~mem6.base|) (= main_~status~0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 1) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= main_~status~0 (select |#valid| main_~head~0.base)) (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 29298#(or (and (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~status~0 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~status~0 1) (not (= main_~item~0.base main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base)) (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (= main_~status~0 0)), 29299#(or (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 (select |#valid| main_~head~0.base))) (= main_~status~0 0)), 29300#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select |#valid| main_~head~0.base) 0)) (not (= main_~item~0.base main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select |#valid| main_~item~0.base) 0))), 29301#(and (not (= main_~item~0.base |main_#t~malloc4.base|)) (not (= (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc4.base|)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|) (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.offset|)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| |main_#t~malloc4.base|))), 29302#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~item~0.base) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))), 29303#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) |main_#t~mem6.base|)) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))), 29304#(and (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 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)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))))) (not (= main_~item~0.base main_~head~0.base)) (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))))), 29305#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))), 29306#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))), 29307#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= |main_#t~mem18.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem18.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 29308#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) (= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 29309#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) |main_#t~mem21.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) |main_#t~mem21.offset|))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) |main_#t~mem21.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) |main_#t~mem21.offset|))))), 29310#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)))), 29311#(and (= |main_#t~mem23.offset| 0) (= 8 (select |#length| |main_#t~mem23.base|)))] [2018-02-02 10:32:16,415 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:16,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:32:16,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:32:16,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:32:16,415 INFO L87 Difference]: Start difference. First operand 259 states and 274 transitions. Second operand 27 states. [2018-02-02 10:32:18,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:18,026 INFO L93 Difference]: Finished difference Result 300 states and 319 transitions. [2018-02-02 10:32:18,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:32:18,027 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 96 [2018-02-02 10:32:18,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:18,027 INFO L225 Difference]: With dead ends: 300 [2018-02-02 10:32:18,027 INFO L226 Difference]: Without dead ends: 300 [2018-02-02 10:32:18,028 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=286, Invalid=2366, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 10:32:18,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-02-02 10:32:18,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 259. [2018-02-02 10:32:18,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-02-02 10:32:18,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 273 transitions. [2018-02-02 10:32:18,029 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 273 transitions. Word has length 96 [2018-02-02 10:32:18,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:18,030 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 273 transitions. [2018-02-02 10:32:18,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:32:18,030 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 273 transitions. [2018-02-02 10:32:18,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-02 10:32:18,030 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:18,030 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:18,030 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:18,030 INFO L82 PathProgramCache]: Analyzing trace with hash -338570031, now seen corresponding path program 2 times [2018-02-02 10:32:18,031 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:18,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:18,576 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:18,576 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:18,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:32:18,576 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:18,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:18,577 INFO L182 omatonBuilderFactory]: Interpolants [29921#true, 29922#false, 29923#(= (select |#valid| main_~head~0.base) 1), 29924#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 29925#(and (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset main_~item~0.offset) (= main_~item~0.base main_~head~0.base)), 29926#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base)), 29927#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 29928#(and (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 29929#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 29930#(and (or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~head~0.base)))) (= main_~status~0 (select |#valid| main_~item~0.base))), 29931#(and (or (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~status~0 0)) (or (and (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))) (= main_~status~0 0))), 29932#(and (or (= main_~status~0 0) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))) (or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))))), 29933#(or (= main_~status~0 0) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) |main_#t~mem6.offset|) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 29934#(or (and (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (= main_~status~0 0)), 29935#(or (= main_~status~0 0) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))))), 29936#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 29937#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))), 29938#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 29939#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 29940#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem25.base|) |main_#t~mem25.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem25.base|) |main_#t~mem25.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem25.base|) |main_#t~mem25.offset|)))), 29941#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset)))), 29942#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem30.base|) |main_#t~mem30.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem30.base|) |main_#t~mem30.offset|))), 29943#(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))), 29944#(and (= 0 |main_#t~mem30.offset|) (= 0 |main_#t~mem30.base|)), 29945#(and (= 0 main_~item~0.base) (= main_~item~0.offset 0)), 29946#(not |main_#t~short27|)] [2018-02-02 10:32:18,577 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:18,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:32:18,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:32:18,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:32:18,577 INFO L87 Difference]: Start difference. First operand 259 states and 273 transitions. Second operand 26 states. [2018-02-02 10:32:19,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:19,680 INFO L93 Difference]: Finished difference Result 251 states and 261 transitions. [2018-02-02 10:32:19,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:32:19,680 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 99 [2018-02-02 10:32:19,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:19,681 INFO L225 Difference]: With dead ends: 251 [2018-02-02 10:32:19,681 INFO L226 Difference]: Without dead ends: 204 [2018-02-02 10:32:19,681 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=280, Invalid=2072, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 10:32:19,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-02-02 10:32:19,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-02-02 10:32:19,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-02 10:32:19,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 214 transitions. [2018-02-02 10:32:19,682 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 214 transitions. Word has length 99 [2018-02-02 10:32:19,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:19,683 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 214 transitions. [2018-02-02 10:32:19,683 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:32:19,683 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 214 transitions. [2018-02-02 10:32:19,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-02 10:32:19,683 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:19,683 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:19,683 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:19,683 INFO L82 PathProgramCache]: Analyzing trace with hash -994080941, now seen corresponding path program 1 times [2018-02-02 10:32:19,684 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:19,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:19,715 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-02-02 10:32:19,715 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:19,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:32:19,716 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:19,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:19,716 INFO L182 omatonBuilderFactory]: Interpolants [30448#true, 30449#false, 30450#(= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)), 30451#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 30452#(= 1 (select |#valid| |main_#t~mem25.base|)), 30453#(= 1 (select |#valid| main_~item~0.base))] [2018-02-02 10:32:19,716 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-02-02 10:32:19,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:32:19,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:32:19,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:32:19,716 INFO L87 Difference]: Start difference. First operand 204 states and 214 transitions. Second operand 6 states. [2018-02-02 10:32:19,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:19,791 INFO L93 Difference]: Finished difference Result 215 states and 227 transitions. [2018-02-02 10:32:19,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:32:19,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 107 [2018-02-02 10:32:19,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:19,792 INFO L225 Difference]: With dead ends: 215 [2018-02-02 10:32:19,792 INFO L226 Difference]: Without dead ends: 215 [2018-02-02 10:32:19,792 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:32:19,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-02 10:32:19,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 208. [2018-02-02 10:32:19,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 10:32:19,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 221 transitions. [2018-02-02 10:32:19,794 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 221 transitions. Word has length 107 [2018-02-02 10:32:19,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:19,794 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 221 transitions. [2018-02-02 10:32:19,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:32:19,794 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 221 transitions. [2018-02-02 10:32:19,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-02 10:32:19,794 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:19,794 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:19,794 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:19,794 INFO L82 PathProgramCache]: Analyzing trace with hash -994080940, now seen corresponding path program 1 times [2018-02-02 10:32:19,795 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:19,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:20,594 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:20,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:20,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 10:32:20,595 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:20,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:20,595 INFO L182 omatonBuilderFactory]: Interpolants [30912#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 30913#(and (<= (+ |main_#t~mem25.offset| 8) (select |#length| |main_#t~mem25.base|)) (<= 0 |main_#t~mem25.offset|)), 30914#(and (<= 0 main_~item~0.offset) (<= (+ main_~item~0.offset 8) (select |#length| main_~item~0.base))), 30885#true, 30886#false, 30887#(= 0 (select |#valid| 0)), 30888#(and (= 0 (select |#valid| 0)) (= |main_#t~malloc0.offset| 0)), 30889#(and (= 0 (select |#valid| 0)) (= main_~head~0.offset 0)), 30890#(and (= 0 (select |#valid| 0)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 30891#(and (= main_~head~0.offset main_~item~0.offset) (= 0 (select |#valid| 0)) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset 0)), 30892#(and (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset main_~item~0.offset) (= 0 (select |#valid| 0)) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 30893#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~head~0.offset main_~item~0.offset) (= 0 (select |#valid| 0)) (= (select |#valid| main_~item~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~head~0.offset)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base) (= main_~head~0.offset 0)), 30894#(and (= 0 (select |#valid| 0)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 8 (select |#length| |main_#t~mem6.base|)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 30895#(and (= 8 (select |#length| main_~item~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_~head~0.base) main_~head~0.offset)) (= 0 (select |#valid| 0)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 30896#(and (= 8 (select |#length| main_~item~0.base)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select |#valid| 0)) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 30897#(or (and (= 8 (select |#length| main_~item~0.base)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 1) (= 0 (select |#valid| 0)) (= main_~status~0 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 0)), 30898#(or (and (= 8 (select |#length| main_~item~0.base)) (= main_~status~0 1) (= 0 (select |#valid| 0)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0)) (= main_~status~0 0)), 30899#(or (and (= 8 (select |#length| main_~item~0.base)) (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 1) (= 0 (select |#valid| 0)) (= main_~status~0 (select |#valid| main_~item~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))) (= main_~status~0 0)), 30900#(or (= main_~status~0 0) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 1) (= 0 (select |#valid| 0)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 30901#(or (= main_~status~0 0) (and (= main_~status~0 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~status~0 1) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 0 (select |#valid| 0)) (not (= main_~item~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 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_~head~0.base) main_~head~0.offset))))), 30902#(and (not (= 1 (select |#valid| 0))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 30903#(and (not (= 1 (select |#valid| 0))) (= main_~head~0.offset |main_#t~malloc4.offset|) (= 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 |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))), 30904#(and (not (= 1 (select |#valid| 0))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset))), 30905#(and (not (= 1 (select |#valid| 0))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset |main_#t~mem6.offset|)), 30906#(or (and (not (= 1 (select |#valid| 0))) (= main_~item~0.offset main_~head~0.offset) (= main_~item~0.base main_~head~0.base)) (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= 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_~head~0.base) main_~head~0.offset))))), 30907#(or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= main_~item~0.offset main_~head~0.offset) (not (= 1 (select |#valid| 0))) (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)) (= main_~item~0.base main_~head~0.base))), 30908#(or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (not (= 1 (select |#valid| 0))) (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 30909#(and (or (and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem16.offset| 0) (= 8 (select |#length| |main_#t~mem16.base|))) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 1 (select |#valid| |main_#t~mem16.base|))))) (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 30910#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (<= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 30911#(and (<= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= |main_#t~mem18.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#length| |main_#t~mem18.base|) 8))] [2018-02-02 10:32:20,595 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:20,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 10:32:20,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 10:32:20,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:32:20,596 INFO L87 Difference]: Start difference. First operand 208 states and 221 transitions. Second operand 30 states. [2018-02-02 10:32:22,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:22,499 INFO L93 Difference]: Finished difference Result 215 states and 227 transitions. [2018-02-02 10:32:22,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 10:32:22,499 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 107 [2018-02-02 10:32:22,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:22,500 INFO L225 Difference]: With dead ends: 215 [2018-02-02 10:32:22,500 INFO L226 Difference]: Without dead ends: 215 [2018-02-02 10:32:22,500 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=828, Invalid=3078, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 10:32:22,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-02 10:32:22,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2018-02-02 10:32:22,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-02 10:32:22,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 224 transitions. [2018-02-02 10:32:22,502 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 224 transitions. Word has length 107 [2018-02-02 10:32:22,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:22,502 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 224 transitions. [2018-02-02 10:32:22,502 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 10:32:22,502 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 224 transitions. [2018-02-02 10:32:22,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-02-02 10:32:22,502 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:22,502 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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:32:22,503 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:22,503 INFO L82 PathProgramCache]: Analyzing trace with hash 323737338, now seen corresponding path program 2 times [2018-02-02 10:32:22,503 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:22,512 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:23,180 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:23,181 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:23,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:32:23,181 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:23,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:23,181 INFO L182 omatonBuilderFactory]: Interpolants [31424#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select |#valid| main_~head~0.base) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= 1 (select |#valid| main_~item~0.base)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))), 31425#(and (not (= (select |#valid| main_~head~0.base) 0)) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 31426#(and (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= (select |#valid| main_~head~0.base) 0)) (not (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~item~0.base main_~head~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))))), 31427#(and (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)))) (= |main_#t~malloc4.base| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)))) (not (= (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc4.base|)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 31428#(and (or (= (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))), 31429#(and (or (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|))), 31430#(and (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (or (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)))))), 31431#(and (not (= main_~item~0.base main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 31432#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 31433#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 31434#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|))), 31435#(= 1 (select |#valid| |main_#t~mem19.base|)), 31408#true, 31409#false, 31410#(= (select |#valid| main_~head~0.base) 1), 31411#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (= main_~item~0.base main_~head~0.base)), 31412#(and (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset main_~item~0.offset) (= main_~item~0.base main_~head~0.base)), 31413#(and (= main_~head~0.offset main_~item~0.offset) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~item~0.base main_~head~0.base)), 31414#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 31415#(and (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 31416#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~item~0.base) 1) (not (= main_~item~0.base main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 31417#(or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 1) (= main_~status~0 (select |#valid| main_~item~0.base)) (not (= main_~item~0.base main_~head~0.base)) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~head~0.base)))), 31418#(or (= main_~status~0 0) (and (not (= main_~item~0.base |main_#t~malloc4.base|)) (= main_~status~0 1) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~status~0 (select |#valid| main_~head~0.base)) (= main_~item~0.offset (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)))), 31419#(or (= main_~status~0 0) (and (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~status~0 (select |#valid| main_~item~0.base)) (= main_~item~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))) (= main_~status~0 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset))))), 31420#(or (= main_~status~0 0) (and (= main_~status~0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~status~0 (select |#valid| main_~head~0.base)))), 31421#(or (and (not (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~status~0 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~item~0.base main_~head~0.base)) (= main_~status~0 (select |#valid| main_~head~0.base))) (= main_~status~0 0)), 31422#(and (= main_~item~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select |#valid| main_~head~0.base) 0)) (not (= main_~item~0.base main_~head~0.base)) (not (= main_~item~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))), 31423#(and (not (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc4.base|)) (not (= (select |#valid| main_~head~0.base) 0)) (= main_~item~0.base (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) (select (select (store |#memory_$Pointer$.base| main_~item~0.base (store (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~item~0.base (store (select |#memory_$Pointer$.offset| main_~item~0.base) main_~item~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc4.base|)))] [2018-02-02 10:32:23,181 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:23,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:32:23,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:32:23,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:32:23,182 INFO L87 Difference]: Start difference. First operand 212 states and 224 transitions. Second operand 28 states. Received shutdown request... [2018-02-02 10:32:23,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:32:23,432 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:32:23,437 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:32:23,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:32:23 BoogieIcfgContainer [2018-02-02 10:32:23,438 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:32:23,439 INFO L168 Benchmark]: Toolchain (without parser) took 50781.04 ms. Allocated memory was 407.4 MB in the beginning and 1.2 GB in the end (delta: 784.9 MB). Free memory was 363.8 MB in the beginning and 873.1 MB in the end (delta: -509.3 MB). Peak memory consumption was 275.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:32:23,440 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 407.4 MB. Free memory is still 369.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:32:23,440 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.25 ms. Allocated memory is still 407.4 MB. Free memory was 363.8 MB in the beginning and 350.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:32:23,440 INFO L168 Benchmark]: Boogie Preprocessor took 33.24 ms. Allocated memory is still 407.4 MB. Free memory was 350.6 MB in the beginning and 348.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:32:23,440 INFO L168 Benchmark]: RCFGBuilder took 371.17 ms. Allocated memory is still 407.4 MB. Free memory was 348.0 MB in the beginning and 307.0 MB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:32:23,440 INFO L168 Benchmark]: TraceAbstraction took 50179.11 ms. Allocated memory was 407.4 MB in the beginning and 1.2 GB in the end (delta: 784.9 MB). Free memory was 307.0 MB in the beginning and 873.1 MB in the end (delta: -566.1 MB). Peak memory consumption was 218.8 MB. Max. memory is 5.3 GB. [2018-02-02 10:32:23,442 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 407.4 MB. Free memory is still 369.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 194.25 ms. Allocated memory is still 407.4 MB. Free memory was 363.8 MB in the beginning and 350.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.24 ms. Allocated memory is still 407.4 MB. Free memory was 350.6 MB in the beginning and 348.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 371.17 ms. Allocated memory is still 407.4 MB. Free memory was 348.0 MB in the beginning and 307.0 MB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 50179.11 ms. Allocated memory was 407.4 MB in the beginning and 1.2 GB in the end (delta: 784.9 MB). Free memory was 307.0 MB in the beginning and 873.1 MB in the end (delta: -566.1 MB). Peak memory consumption was 218.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 994). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 982]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 982). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1051). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1051). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 994). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was constructing difference of abstraction (212states) and interpolant automaton (currently 7 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 85. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 162 locations, 55 error locations. TIMEOUT Result, 50.1s OverallTime, 58 OverallIterations, 5 TraceHistogramMax, 34.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6324 SDtfs, 17859 SDslu, 38468 SDs, 0 SdLazy, 34117 SolverSat, 2448 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1539 GetRequests, 143 SyntacticMatches, 41 SemanticMatches, 1354 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10960 ImplicationChecksByTransitivity, 27.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=513occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 586/1568 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 57 MinimizatonAttempts, 1610 StatesRemovedByMinimization, 52 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 14.4s InterpolantComputationTime, 3954 NumberOfCodeBlocks, 3954 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 3896 ConstructedInterpolants, 0 QuantifiedInterpolants, 5635052 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 58 InterpolantComputations, 23 PerfectInterpolantSequences, 586/1568 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-queue_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-32-23-448.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-queue_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-32-23-448.csv Completed graceful shutdown