java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-circular_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:44:54,103 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:44:54,104 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:44:54,117 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:44:54,117 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:44:54,118 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:44:54,118 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:44:54,120 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:44:54,122 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:44:54,122 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:44:54,123 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:44:54,123 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:44:54,124 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:44:54,125 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:44:54,126 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:44:54,128 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:44:54,130 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:44:54,131 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:44:54,132 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:44:54,133 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:44:54,135 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:44:54,135 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:44:54,135 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:44:54,136 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:44:54,137 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:44:54,138 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:44:54,138 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:44:54,138 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:44:54,139 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:44:54,139 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:44:54,139 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:44:54,140 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 20:44:54,149 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:44:54,149 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:44:54,150 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:44:54,150 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:44:54,150 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:44:54,150 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:44:54,150 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:44:54,151 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:44:54,151 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:44:54,151 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:44:54,151 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:44:54,151 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:44:54,151 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:44:54,151 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:44:54,151 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:44:54,151 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:44:54,151 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:44:54,152 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:44:54,152 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:44:54,152 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:44:54,152 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:44:54,152 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:44:54,152 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:44:54,185 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:44:54,198 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:44:54,201 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:44:54,202 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:44:54,203 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:44:54,204 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-circular_true-unreach-call_true-valid-memsafety.i [2018-02-02 20:44:54,350 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:44:54,351 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:44:54,351 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:44:54,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:44:54,355 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:44:54,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:44:54" (1/1) ... [2018-02-02 20:44:54,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6525d2fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:54, skipping insertion in model container [2018-02-02 20:44:54,358 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:44:54" (1/1) ... [2018-02-02 20:44:54,370 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:44:54,403 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:44:54,491 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:44:54,508 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:44:54,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:54 WrapperNode [2018-02-02 20:44:54,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:44:54,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:44:54,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:44:54,516 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:44:54,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:54" (1/1) ... [2018-02-02 20:44:54,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:54" (1/1) ... [2018-02-02 20:44:54,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:54" (1/1) ... [2018-02-02 20:44:54,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:54" (1/1) ... [2018-02-02 20:44:54,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:54" (1/1) ... [2018-02-02 20:44:54,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:54" (1/1) ... [2018-02-02 20:44:54,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:54" (1/1) ... [2018-02-02 20:44:54,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:44:54,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:44:54,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:44:54,547 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:44:54,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:54" (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 20:44:54,584 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:44:54,584 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:44:54,584 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:44:54,584 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 20:44:54,584 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 20:44:54,585 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 20:44:54,585 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 20:44:54,585 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:44:54,585 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:44:54,585 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:44:54,585 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 20:44:54,585 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 20:44:54,585 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:44:54,585 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 20:44:54,585 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:44:54,585 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:44:54,585 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:44:54,881 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:44:54,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:44:54 BoogieIcfgContainer [2018-02-02 20:44:54,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:44:54,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:44:54,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:44:54,885 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:44:54,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:44:54" (1/3) ... [2018-02-02 20:44:54,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4534c92e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:44:54, skipping insertion in model container [2018-02-02 20:44:54,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:54" (2/3) ... [2018-02-02 20:44:54,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4534c92e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:44:54, skipping insertion in model container [2018-02-02 20:44:54,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:44:54" (3/3) ... [2018-02-02 20:44:54,888 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-circular_true-unreach-call_true-valid-memsafety.i [2018-02-02 20:44:54,895 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:44:54,901 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-02-02 20:44:54,925 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:44:54,925 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:44:54,925 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:44:54,925 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:44:54,925 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:44:54,926 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:44:54,926 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:44:54,926 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:44:54,927 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:44:54,936 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2018-02-02 20:44:54,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 20:44:54,943 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:54,944 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:54,944 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:54,947 INFO L82 PathProgramCache]: Analyzing trace with hash 414289043, now seen corresponding path program 1 times [2018-02-02 20:44:54,980 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:55,010 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:55,051 INFO 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 20:44:55,053 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:55,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:44:55,054 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:55,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:55,054 INFO L182 omatonBuilderFactory]: Interpolants [116#true, 117#false, 118#(= 1 (select |#valid| |main_#t~malloc0.base|)), 119#(= 1 (select |#valid| main_~head~0.base))] [2018-02-02 20:44:55,055 INFO 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 20:44:55,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:44:55,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:44:55,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:44:55,066 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 4 states. [2018-02-02 20:44:55,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:55,279 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2018-02-02 20:44:55,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:44:55,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 20:44:55,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:55,285 INFO L225 Difference]: With dead ends: 123 [2018-02-02 20:44:55,285 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 20:44:55,286 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 20:44:55,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 20:44:55,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2018-02-02 20:44:55,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-02 20:44:55,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-02-02 20:44:55,312 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 8 [2018-02-02 20:44:55,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:55,312 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-02-02 20:44:55,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:44:55,312 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-02-02 20:44:55,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 20:44:55,312 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:55,312 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:55,313 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:55,313 INFO L82 PathProgramCache]: Analyzing trace with hash 414289044, now seen corresponding path program 1 times [2018-02-02 20:44:55,313 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:55,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:55,373 INFO 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 20:44:55,373 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:55,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:44:55,373 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:55,373 INFO 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 20:44:55,374 INFO L182 omatonBuilderFactory]: Interpolants [352#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 353#(and (= (select |#length| main_~head~0.base) 12) (= main_~head~0.offset 0)), 350#true, 351#false] [2018-02-02 20:44:55,374 INFO 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 20:44:55,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:44:55,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:44:55,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:44:55,376 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 4 states. [2018-02-02 20:44:55,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:55,451 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-02-02 20:44:55,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:44:55,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 20:44:55,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:55,452 INFO L225 Difference]: With dead ends: 111 [2018-02-02 20:44:55,452 INFO L226 Difference]: Without dead ends: 111 [2018-02-02 20:44:55,453 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 20:44:55,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-02 20:44:55,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-02-02 20:44:55,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-02 20:44:55,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-02-02 20:44:55,459 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 8 [2018-02-02 20:44:55,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:55,460 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-02-02 20:44:55,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:44:55,460 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-02-02 20:44:55,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 20:44:55,460 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:55,460 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:55,460 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:55,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1743556376, now seen corresponding path program 1 times [2018-02-02 20:44:55,461 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:55,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:55,508 INFO 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 20:44:55,508 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:55,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:44:55,508 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:55,509 INFO 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 20:44:55,509 INFO L182 omatonBuilderFactory]: Interpolants [567#true, 568#false, 569#(= 1 (select |#valid| main_~head~0.base)), 570#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 20:44:55,509 INFO 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 20:44:55,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:44:55,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:44:55,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:44:55,510 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 4 states. [2018-02-02 20:44:55,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:55,591 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2018-02-02 20:44:55,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:44:55,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 20:44:55,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:55,592 INFO L225 Difference]: With dead ends: 95 [2018-02-02 20:44:55,592 INFO L226 Difference]: Without dead ends: 95 [2018-02-02 20:44:55,593 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 20:44:55,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-02 20:44:55,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2018-02-02 20:44:55,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 20:44:55,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-02-02 20:44:55,598 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 15 [2018-02-02 20:44:55,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:55,598 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-02-02 20:44:55,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:44:55,599 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-02-02 20:44:55,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 20:44:55,599 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:55,599 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:55,599 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:55,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1743556377, now seen corresponding path program 1 times [2018-02-02 20:44:55,600 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:55,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:55,665 INFO 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 20:44:55,666 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:55,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:44:55,666 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:55,666 INFO 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 20:44:55,666 INFO L182 omatonBuilderFactory]: Interpolants [756#true, 757#false, 758#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 759#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base))), 760#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12))] [2018-02-02 20:44:55,666 INFO 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 20:44:55,666 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:44:55,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:44:55,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:44:55,667 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 5 states. [2018-02-02 20:44:55,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:55,767 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2018-02-02 20:44:55,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:44:55,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 20:44:55,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:55,768 INFO L225 Difference]: With dead ends: 113 [2018-02-02 20:44:55,768 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 20:44:55,769 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:44:55,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 20:44:55,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 98. [2018-02-02 20:44:55,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-02 20:44:55,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2018-02-02 20:44:55,774 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 15 [2018-02-02 20:44:55,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:55,774 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2018-02-02 20:44:55,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:44:55,774 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2018-02-02 20:44:55,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 20:44:55,775 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:55,775 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 20:44:55,775 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:55,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1046426684, now seen corresponding path program 1 times [2018-02-02 20:44:55,776 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:55,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:55,858 INFO 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 20:44:55,858 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:55,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:44:55,859 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:55,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:55,859 INFO L182 omatonBuilderFactory]: Interpolants [976#true, 977#false, 978#(and (= 0 |main_#t~malloc5.offset|) (= 12 (select |#length| |main_#t~malloc5.base|))), 979#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 980#(and (= (select |#length| |main_#t~mem7.base|) 12) (= |main_#t~mem7.offset| 0))] [2018-02-02 20:44:55,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:55,860 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:44:55,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:44:55,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:44:55,860 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand 5 states. [2018-02-02 20:44:56,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:56,014 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2018-02-02 20:44:56,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:44:56,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 20:44:56,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:56,015 INFO L225 Difference]: With dead ends: 145 [2018-02-02 20:44:56,016 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 20:44:56,016 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:44:56,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 20:44:56,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 97. [2018-02-02 20:44:56,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-02 20:44:56,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2018-02-02 20:44:56,019 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 18 [2018-02-02 20:44:56,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:56,020 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2018-02-02 20:44:56,020 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:44:56,020 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2018-02-02 20:44:56,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 20:44:56,020 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:56,020 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 20:44:56,021 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:56,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1046426685, now seen corresponding path program 1 times [2018-02-02 20:44:56,022 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:56,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:56,057 INFO 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 20:44:56,057 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:56,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:44:56,057 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:56,058 INFO 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 20:44:56,058 INFO L182 omatonBuilderFactory]: Interpolants [1232#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 1233#(= 1 (select |#valid| |main_#t~mem7.base|)), 1229#true, 1230#false, 1231#(= 1 (select |#valid| |main_#t~malloc5.base|))] [2018-02-02 20:44:56,058 INFO 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 20:44:56,058 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:44:56,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:44:56,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:44:56,059 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 5 states. [2018-02-02 20:44:56,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:56,210 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2018-02-02 20:44:56,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:44:56,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 20:44:56,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:56,211 INFO L225 Difference]: With dead ends: 141 [2018-02-02 20:44:56,211 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 20:44:56,211 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:44:56,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 20:44:56,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 96. [2018-02-02 20:44:56,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 20:44:56,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-02-02 20:44:56,214 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 18 [2018-02-02 20:44:56,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:56,214 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-02-02 20:44:56,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:44:56,214 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-02-02 20:44:56,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 20:44:56,215 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:56,215 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:56,215 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:56,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1771867382, now seen corresponding path program 1 times [2018-02-02 20:44:56,216 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:56,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:56,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 20:44:56,406 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:56,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:44:56,406 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:56,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:56,406 INFO L182 omatonBuilderFactory]: Interpolants [1475#true, 1476#false, 1477#(= 0 |main_#t~malloc0.offset|), 1478#(= main_~head~0.offset 0), 1479#(and (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 1480#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))), 1481#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1)), 1482#(= 1 (select |#valid| |main_#t~mem14.base|)), 1483#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 20:44:56,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:56,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:44:56,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:44:56,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:44:56,407 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 9 states. [2018-02-02 20:44:56,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:56,632 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2018-02-02 20:44:56,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:44:56,632 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-02 20:44:56,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:56,633 INFO L225 Difference]: With dead ends: 139 [2018-02-02 20:44:56,633 INFO L226 Difference]: Without dead ends: 139 [2018-02-02 20:44:56,633 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:44:56,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-02 20:44:56,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 103. [2018-02-02 20:44:56,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 20:44:56,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-02-02 20:44:56,637 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 22 [2018-02-02 20:44:56,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:56,637 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-02-02 20:44:56,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:44:56,637 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-02-02 20:44:56,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 20:44:56,637 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:56,637 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:56,637 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:56,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1771867381, now seen corresponding path program 1 times [2018-02-02 20:44:56,638 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:56,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:56,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 20:44:56,807 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:56,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:44:56,807 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:56,808 INFO 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 20:44:56,808 INFO L182 omatonBuilderFactory]: Interpolants [1744#(and (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 1745#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base)), 1746#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 1747#(and (= 0 |main_#t~mem14.offset|) (= 12 (select |#length| |main_#t~mem14.base|))), 1748#(and (= (select |#length| main_~x~0.base) 12) (= 0 main_~x~0.offset)), 1740#true, 1741#false, 1742#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 1743#(and (= 12 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0))] [2018-02-02 20:44:56,808 INFO 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 20:44:56,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:44:56,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:44:56,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:44:56,809 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 9 states. [2018-02-02 20:44:57,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:57,066 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2018-02-02 20:44:57,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:44:57,067 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-02 20:44:57,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:57,067 INFO L225 Difference]: With dead ends: 172 [2018-02-02 20:44:57,068 INFO L226 Difference]: Without dead ends: 172 [2018-02-02 20:44:57,068 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:44:57,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-02 20:44:57,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 116. [2018-02-02 20:44:57,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 20:44:57,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2018-02-02 20:44:57,071 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 22 [2018-02-02 20:44:57,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:57,071 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2018-02-02 20:44:57,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:44:57,071 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2018-02-02 20:44:57,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 20:44:57,071 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:57,072 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:57,072 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:57,072 INFO L82 PathProgramCache]: Analyzing trace with hash 687906629, now seen corresponding path program 1 times [2018-02-02 20:44:57,072 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:57,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:57,140 INFO 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 20:44:57,140 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:57,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:44:57,141 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:57,141 INFO 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 20:44:57,141 INFO L182 omatonBuilderFactory]: Interpolants [2049#true, 2050#false, 2051#(= (select |#valid| main_~head~0.base) 1), 2052#(= (select |#valid| main_~x~0.base) 1), 2053#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= 1 (select |#valid| |main_#t~malloc5.base|))), 2054#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 2055#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem7.base|))), 2056#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 2057#(= 1 (select |#valid| |main_#t~mem9.base|))] [2018-02-02 20:44:57,141 INFO 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 20:44:57,141 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:44:57,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:44:57,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:44:57,142 INFO L87 Difference]: Start difference. First operand 116 states and 129 transitions. Second operand 9 states. [2018-02-02 20:44:57,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:57,392 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2018-02-02 20:44:57,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:44:57,392 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-02 20:44:57,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:57,393 INFO L225 Difference]: With dead ends: 122 [2018-02-02 20:44:57,393 INFO L226 Difference]: Without dead ends: 122 [2018-02-02 20:44:57,393 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:44:57,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-02 20:44:57,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 115. [2018-02-02 20:44:57,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 20:44:57,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2018-02-02 20:44:57,396 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 22 [2018-02-02 20:44:57,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:57,396 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2018-02-02 20:44:57,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:44:57,397 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2018-02-02 20:44:57,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 20:44:57,397 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:57,397 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:57,397 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:57,397 INFO L82 PathProgramCache]: Analyzing trace with hash 687906630, now seen corresponding path program 1 times [2018-02-02 20:44:57,398 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:57,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:57,505 INFO 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 20:44:57,505 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:57,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:44:57,506 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:57,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:57,506 INFO L182 omatonBuilderFactory]: Interpolants [2309#true, 2310#false, 2311#(= (select |#valid| main_~head~0.base) 1), 2312#(= (select |#valid| main_~x~0.base) 1), 2313#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= 12 (select |#length| |main_#t~malloc5.base|))), 2314#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 2315#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 2316#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 2317#(and (= 0 |main_#t~mem9.offset|) (= 12 (select |#length| |main_#t~mem9.base|))), 2318#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12))] [2018-02-02 20:44:57,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:57,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:44:57,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:44:57,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:44:57,506 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand 10 states. [2018-02-02 20:44:57,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:57,920 INFO L93 Difference]: Finished difference Result 117 states and 131 transitions. [2018-02-02 20:44:57,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:44:57,920 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-02 20:44:57,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:57,921 INFO L225 Difference]: With dead ends: 117 [2018-02-02 20:44:57,921 INFO L226 Difference]: Without dead ends: 117 [2018-02-02 20:44:57,921 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:44:57,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-02 20:44:57,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2018-02-02 20:44:57,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 20:44:57,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2018-02-02 20:44:57,924 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 22 [2018-02-02 20:44:57,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:57,924 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2018-02-02 20:44:57,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:44:57,925 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2018-02-02 20:44:57,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 20:44:57,925 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:57,925 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:57,925 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:57,926 INFO L82 PathProgramCache]: Analyzing trace with hash 36223985, now seen corresponding path program 1 times [2018-02-02 20:44:57,926 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:57,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:58,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:58,078 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:58,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:44:58,079 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:58,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:58,079 INFO L182 omatonBuilderFactory]: Interpolants [2561#true, 2562#false, 2563#(= 0 |main_#t~malloc0.offset|), 2564#(= main_~head~0.offset 0), 2565#(and (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 2566#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))), 2567#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 2568#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 2569#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 2570#(= 1 (select |#valid| |main_#t~mem16.base|))] [2018-02-02 20:44:58,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:58,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:44:58,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:44:58,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:44:58,080 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 10 states. [2018-02-02 20:44:58,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:58,349 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2018-02-02 20:44:58,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:44:58,350 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-02-02 20:44:58,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:58,350 INFO L225 Difference]: With dead ends: 146 [2018-02-02 20:44:58,351 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 20:44:58,351 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:44:58,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 20:44:58,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 103. [2018-02-02 20:44:58,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 20:44:58,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2018-02-02 20:44:58,352 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 26 [2018-02-02 20:44:58,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:58,353 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2018-02-02 20:44:58,353 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:44:58,353 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2018-02-02 20:44:58,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 20:44:58,353 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:58,353 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:58,353 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:58,353 INFO L82 PathProgramCache]: Analyzing trace with hash 36223986, now seen corresponding path program 1 times [2018-02-02 20:44:58,354 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:58,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:58,524 INFO 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 20:44:58,525 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:58,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:44:58,525 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:58,525 INFO 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 20:44:58,526 INFO L182 omatonBuilderFactory]: Interpolants [2836#true, 2837#false, 2838#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 2839#(and (= 12 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 2840#(and (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset))) (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 2841#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))), 2842#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 2843#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 2844#(and (= |main_#t~mem16.offset| 0) (= (select |#length| |main_#t~mem16.base|) 12))] [2018-02-02 20:44:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:58,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:44:58,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:44:58,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:44:58,527 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 9 states. [2018-02-02 20:44:58,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:58,772 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2018-02-02 20:44:58,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:44:58,772 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-02-02 20:44:58,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:58,773 INFO L225 Difference]: With dead ends: 158 [2018-02-02 20:44:58,773 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 20:44:58,773 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:44:58,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 20:44:58,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 103. [2018-02-02 20:44:58,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 20:44:58,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2018-02-02 20:44:58,776 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 26 [2018-02-02 20:44:58,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:58,776 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2018-02-02 20:44:58,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:44:58,776 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2018-02-02 20:44:58,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 20:44:58,777 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:58,777 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:58,777 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:58,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1122483890, now seen corresponding path program 1 times [2018-02-02 20:44:58,778 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:58,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:58,828 INFO 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 20:44:58,828 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:58,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:44:58,829 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:58,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:58,829 INFO L182 omatonBuilderFactory]: Interpolants [3120#true, 3121#false, 3122#(= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)), 3123#(= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)), 3124#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 3125#(= 1 (select |#valid| |main_#t~mem23.base|)), 3126#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 20:44:58,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:58,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:44:58,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:44:58,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:44:58,830 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand 7 states. [2018-02-02 20:44:59,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:59,001 INFO L93 Difference]: Finished difference Result 139 states and 153 transitions. [2018-02-02 20:44:59,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:44:59,002 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-02 20:44:59,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:59,002 INFO L225 Difference]: With dead ends: 139 [2018-02-02 20:44:59,002 INFO L226 Difference]: Without dead ends: 139 [2018-02-02 20:44:59,003 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:44:59,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-02 20:44:59,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 105. [2018-02-02 20:44:59,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-02 20:44:59,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-02-02 20:44:59,006 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 27 [2018-02-02 20:44:59,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:59,006 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-02-02 20:44:59,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:44:59,006 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-02-02 20:44:59,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 20:44:59,008 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:59,009 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:59,009 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:59,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1122483891, now seen corresponding path program 1 times [2018-02-02 20:44:59,009 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:59,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:59,276 INFO 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 20:44:59,277 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:59,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 20:44:59,277 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:59,277 INFO 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 20:44:59,277 INFO L182 omatonBuilderFactory]: Interpolants [3381#true, 3382#false, 3383#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 3384#(and (= 12 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 3385#(and (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 3386#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base)), 3387#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 3388#(and (= 0 |main_#t~mem14.offset|) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem14.offset|) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 3389#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 main_~x~0.offset)), 3390#(and (<= 0 |main_#t~mem23.offset|) (<= |main_#t~mem23.offset| 0) (= 12 (select |#length| |main_#t~mem23.base|))), 3391#(and (<= main_~x~0.offset 0) (<= 0 main_~x~0.offset) (= (select |#length| main_~x~0.base) 12))] [2018-02-02 20:44:59,277 INFO 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 20:44:59,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:44:59,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:44:59,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:44:59,278 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 11 states. [2018-02-02 20:44:59,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:44:59,601 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2018-02-02 20:44:59,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:44:59,601 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-02-02 20:44:59,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:44:59,602 INFO L225 Difference]: With dead ends: 165 [2018-02-02 20:44:59,602 INFO L226 Difference]: Without dead ends: 165 [2018-02-02 20:44:59,602 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:44:59,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-02 20:44:59,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 130. [2018-02-02 20:44:59,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-02 20:44:59,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 155 transitions. [2018-02-02 20:44:59,605 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 155 transitions. Word has length 27 [2018-02-02 20:44:59,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:44:59,605 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 155 transitions. [2018-02-02 20:44:59,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:44:59,605 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 155 transitions. [2018-02-02 20:44:59,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 20:44:59,606 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:44:59,606 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:44:59,606 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:44:59,606 INFO L82 PathProgramCache]: Analyzing trace with hash -152260992, now seen corresponding path program 1 times [2018-02-02 20:44:59,607 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:44:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:44:59,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:44:59,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:44:59,861 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:44:59,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 20:44:59,862 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:44:59,862 INFO 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 20:44:59,862 INFO L182 omatonBuilderFactory]: Interpolants [3712#(and (= |old(#valid)| (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 3713#(and (= 0 |main_#t~mem14.offset|) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |old(#valid)| (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0))), 3714#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |old(#valid)| (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (= 0 main_~x~0.offset)), 3715#(and (= |old(#valid)| (store |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 3716#(and (= (store |#valid| |main_#t~mem23.base| 0) |old(#valid)|) (not (= 0 |main_#t~mem23.base|))), 3717#(and (not (= 0 main_~x~0.base)) (= (store |#valid| main_~x~0.base 0) |old(#valid)|)), 3705#true, 3706#false, 3707#(= |#valid| |old(#valid)|), 3708#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (= 0 |main_#t~malloc0.offset|)), 3709#(and (= (store |#valid| main_~head~0.base 0) |old(#valid)|) (= main_~head~0.offset 0)), 3710#(and (= (store |#valid| (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset) 0) |old(#valid)|) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 3711#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= (store |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) 0) |old(#valid)|) (= main_~head~0.base main_~x~0.base))] [2018-02-02 20:44:59,862 INFO 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 20:44:59,863 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:44:59,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:44:59,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:44:59,863 INFO L87 Difference]: Start difference. First operand 130 states and 155 transitions. Second operand 13 states. [2018-02-02 20:45:00,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:00,392 INFO L93 Difference]: Finished difference Result 148 states and 160 transitions. [2018-02-02 20:45:00,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:45:00,392 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-02-02 20:45:00,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:00,393 INFO L225 Difference]: With dead ends: 148 [2018-02-02 20:45:00,393 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 20:45:00,393 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:45:00,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 20:45:00,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 129. [2018-02-02 20:45:00,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 20:45:00,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 153 transitions. [2018-02-02 20:45:00,395 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 153 transitions. Word has length 31 [2018-02-02 20:45:00,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:00,396 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 153 transitions. [2018-02-02 20:45:00,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:45:00,396 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 153 transitions. [2018-02-02 20:45:00,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 20:45:00,397 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:00,397 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:00,397 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:00,397 INFO L82 PathProgramCache]: Analyzing trace with hash -771319912, now seen corresponding path program 1 times [2018-02-02 20:45:00,398 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:00,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:00,532 INFO 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 20:45:00,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:45:00,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:45:00,535 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:00,536 INFO 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 20:45:00,536 INFO L182 omatonBuilderFactory]: Interpolants [4021#true, 4022#false, 4023#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 4024#(and (= 12 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 4025#(and (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset))) (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 4026#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))), 4027#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 4028#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 4029#(and (= |main_#t~mem18.offset| 0) (= (select |#length| |main_#t~mem18.base|) 12))] [2018-02-02 20:45:00,536 INFO 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 20:45:00,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:45:00,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:45:00,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:45:00,536 INFO L87 Difference]: Start difference. First operand 129 states and 153 transitions. Second operand 9 states. [2018-02-02 20:45:00,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:00,729 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2018-02-02 20:45:00,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:45:00,729 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-02-02 20:45:00,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:00,729 INFO L225 Difference]: With dead ends: 153 [2018-02-02 20:45:00,729 INFO L226 Difference]: Without dead ends: 153 [2018-02-02 20:45:00,730 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:45:00,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-02 20:45:00,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 129. [2018-02-02 20:45:00,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 20:45:00,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2018-02-02 20:45:00,732 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 31 [2018-02-02 20:45:00,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:00,733 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2018-02-02 20:45:00,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:45:00,733 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2018-02-02 20:45:00,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 20:45:00,733 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:00,733 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:00,734 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:00,734 INFO L82 PathProgramCache]: Analyzing trace with hash -771319913, now seen corresponding path program 1 times [2018-02-02 20:45:00,734 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:00,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:00,835 INFO 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 20:45:00,836 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:45:00,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:45:00,836 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:00,836 INFO 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 20:45:00,836 INFO L182 omatonBuilderFactory]: Interpolants [4326#true, 4327#false, 4328#(= 0 |main_#t~malloc0.offset|), 4329#(= main_~head~0.offset 0), 4330#(and (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 4331#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))), 4332#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4333#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 4334#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 4335#(= 1 (select |#valid| |main_#t~mem18.base|))] [2018-02-02 20:45:00,836 INFO 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 20:45:00,836 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:45:00,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:45:00,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:45:00,837 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand 10 states. [2018-02-02 20:45:01,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:01,060 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2018-02-02 20:45:01,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:45:01,060 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-02-02 20:45:01,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:01,060 INFO L225 Difference]: With dead ends: 147 [2018-02-02 20:45:01,060 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 20:45:01,061 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:45:01,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 20:45:01,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 129. [2018-02-02 20:45:01,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 20:45:01,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 151 transitions. [2018-02-02 20:45:01,062 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 151 transitions. Word has length 31 [2018-02-02 20:45:01,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:01,062 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 151 transitions. [2018-02-02 20:45:01,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:45:01,062 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 151 transitions. [2018-02-02 20:45:01,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 20:45:01,063 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:01,063 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] [2018-02-02 20:45:01,063 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:01,063 INFO L82 PathProgramCache]: Analyzing trace with hash -246205034, now seen corresponding path program 1 times [2018-02-02 20:45:01,063 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:01,068 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:01,225 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:45:01,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 20:45:01,225 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:01,225 INFO 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 20:45:01,225 INFO L182 omatonBuilderFactory]: Interpolants [4640#(= 0 |main_#t~mem24|), 4628#true, 4629#false, 4630#(= 0 |main_#t~malloc0.offset|), 4631#(= main_~head~0.offset 0), 4632#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 4633#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.offset 0)), 4634#(and (= 0 |main_#t~mem14.offset|) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4635#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4636#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8)) |main_#t~mem15|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4637#(and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4638#(and (= 0 |main_#t~mem23.offset|) (= 0 (select (select |#memory_int| |main_#t~mem23.base|) (+ 0 8)))), 4639#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))] [2018-02-02 20:45:01,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:01,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:45:01,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:45:01,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:45:01,226 INFO L87 Difference]: Start difference. First operand 129 states and 151 transitions. Second operand 13 states. [2018-02-02 20:45:01,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:01,579 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2018-02-02 20:45:01,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:45:01,579 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-02-02 20:45:01,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:01,579 INFO L225 Difference]: With dead ends: 147 [2018-02-02 20:45:01,579 INFO L226 Difference]: Without dead ends: 142 [2018-02-02 20:45:01,580 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:45:01,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-02 20:45:01,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 129. [2018-02-02 20:45:01,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 20:45:01,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2018-02-02 20:45:01,582 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 33 [2018-02-02 20:45:01,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:01,582 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2018-02-02 20:45:01,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:45:01,582 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2018-02-02 20:45:01,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 20:45:01,583 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:01,583 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 20:45:01,583 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:01,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1646590979, now seen corresponding path program 1 times [2018-02-02 20:45:01,584 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:01,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:01,880 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 20:45:01,880 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:01,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 20:45:01,881 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:01,881 INFO 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 20:45:01,881 INFO L182 omatonBuilderFactory]: Interpolants [4944#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 4945#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 4946#(= 1 (select |#valid| |main_#t~mem22.base|)), 4947#(= 1 (select |#valid| main_~x~0.base)), 4937#true, 4938#false, 4939#(= 0 |main_#t~malloc0.offset|), 4940#(= main_~head~0.offset 0), 4941#(and (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 4942#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))), 4943#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 20:45:01,881 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 20:45:01,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:45:01,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:45:01,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:45:01,882 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 11 states. [2018-02-02 20:45:02,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:02,196 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2018-02-02 20:45:02,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:45:02,196 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-02-02 20:45:02,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:02,196 INFO L225 Difference]: With dead ends: 145 [2018-02-02 20:45:02,196 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 20:45:02,197 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:45:02,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 20:45:02,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2018-02-02 20:45:02,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-02 20:45:02,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 154 transitions. [2018-02-02 20:45:02,199 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 154 transitions. Word has length 34 [2018-02-02 20:45:02,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:02,199 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 154 transitions. [2018-02-02 20:45:02,199 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:45:02,199 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 154 transitions. [2018-02-02 20:45:02,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 20:45:02,199 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:02,199 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 20:45:02,199 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:02,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1646590978, now seen corresponding path program 1 times [2018-02-02 20:45:02,200 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:02,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:02,379 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 20:45:02,379 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:02,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 20:45:02,379 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:02,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 20:45:02,379 INFO L182 omatonBuilderFactory]: Interpolants [5248#(and (= 12 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 5249#(and (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset))) (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 5250#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))), 5251#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 5252#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 5253#(and (= 12 (select |#length| |main_#t~mem22.base|)) (= 0 |main_#t~mem22.offset|)), 5254#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12)), 5245#true, 5246#false, 5247#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|)))] [2018-02-02 20:45:02,379 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 20:45:02,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:45:02,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:45:02,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:45:02,380 INFO L87 Difference]: Start difference. First operand 132 states and 154 transitions. Second operand 10 states. [2018-02-02 20:45:02,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:02,674 INFO L93 Difference]: Finished difference Result 176 states and 188 transitions. [2018-02-02 20:45:02,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:45:02,674 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-02-02 20:45:02,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:02,674 INFO L225 Difference]: With dead ends: 176 [2018-02-02 20:45:02,674 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 20:45:02,675 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:45:02,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 20:45:02,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 145. [2018-02-02 20:45:02,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 20:45:02,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 172 transitions. [2018-02-02 20:45:02,677 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 172 transitions. Word has length 34 [2018-02-02 20:45:02,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:02,677 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 172 transitions. [2018-02-02 20:45:02,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:45:02,677 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 172 transitions. [2018-02-02 20:45:02,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 20:45:02,678 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:02,678 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:02,678 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:02,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1352500762, now seen corresponding path program 1 times [2018-02-02 20:45:02,679 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:02,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:02,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:02,752 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:45:02,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:45:02,752 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:02,753 INFO 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 20:45:02,753 INFO L182 omatonBuilderFactory]: Interpolants [5594#true, 5595#false, 5596#(= main_~state~0 1)] [2018-02-02 20:45:02,753 INFO 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 20:45:02,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:45:02,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:45:02,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:45:02,753 INFO L87 Difference]: Start difference. First operand 145 states and 172 transitions. Second operand 3 states. [2018-02-02 20:45:02,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:02,828 INFO L93 Difference]: Finished difference Result 214 states and 246 transitions. [2018-02-02 20:45:02,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:45:02,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-02-02 20:45:02,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:02,830 INFO L225 Difference]: With dead ends: 214 [2018-02-02 20:45:02,830 INFO L226 Difference]: Without dead ends: 214 [2018-02-02 20:45:02,830 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 20:45:02,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-02-02 20:45:02,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 163. [2018-02-02 20:45:02,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 20:45:02,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 192 transitions. [2018-02-02 20:45:02,834 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 192 transitions. Word has length 34 [2018-02-02 20:45:02,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:02,834 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 192 transitions. [2018-02-02 20:45:02,834 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:45:02,834 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 192 transitions. [2018-02-02 20:45:02,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 20:45:02,835 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:02,835 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:02,835 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:02,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1891146596, now seen corresponding path program 1 times [2018-02-02 20:45:02,836 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:02,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:02,973 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 20:45:02,973 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:02,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:45:02,973 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:02,973 INFO 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 20:45:02,973 INFO L182 omatonBuilderFactory]: Interpolants [5984#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 5985#(= 1 (select |#valid| |main_#t~mem16.base|)), 5974#true, 5975#false, 5976#(= 0 |main_#t~malloc0.offset|), 5977#(= main_~head~0.offset 0), 5978#(and (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 5979#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))), 5980#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 5981#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|)))), 5982#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 5983#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)))] [2018-02-02 20:45:02,973 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 20:45:02,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:45:02,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:45:02,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:45:02,974 INFO L87 Difference]: Start difference. First operand 163 states and 192 transitions. Second operand 12 states. [2018-02-02 20:45:03,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:03,408 INFO L93 Difference]: Finished difference Result 181 states and 196 transitions. [2018-02-02 20:45:03,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:45:03,410 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-02-02 20:45:03,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:03,411 INFO L225 Difference]: With dead ends: 181 [2018-02-02 20:45:03,411 INFO L226 Difference]: Without dead ends: 181 [2018-02-02 20:45:03,411 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:45:03,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-02 20:45:03,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2018-02-02 20:45:03,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 20:45:03,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 191 transitions. [2018-02-02 20:45:03,413 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 191 transitions. Word has length 38 [2018-02-02 20:45:03,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:03,414 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 191 transitions. [2018-02-02 20:45:03,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:45:03,414 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 191 transitions. [2018-02-02 20:45:03,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 20:45:03,414 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:03,414 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:03,414 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:03,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1891146597, now seen corresponding path program 1 times [2018-02-02 20:45:03,415 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:03,420 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:03,597 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 20:45:03,597 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:03,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 20:45:03,598 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:03,598 INFO 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 20:45:03,598 INFO L182 omatonBuilderFactory]: Interpolants [6354#true, 6355#false, 6356#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 6357#(and (= 12 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 6358#(and (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset))) (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 6359#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))), 6360#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))))), 6361#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 6362#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)))), 6363#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 6364#(and (= |main_#t~mem16.offset| 0) (= (select |#length| |main_#t~mem16.base|) 12))] [2018-02-02 20:45:03,598 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 20:45:03,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:45:03,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:45:03,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:45:03,598 INFO L87 Difference]: Start difference. First operand 163 states and 191 transitions. Second operand 11 states. [2018-02-02 20:45:03,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:03,919 INFO L93 Difference]: Finished difference Result 187 states and 201 transitions. [2018-02-02 20:45:03,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:45:03,919 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-02-02 20:45:03,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:03,920 INFO L225 Difference]: With dead ends: 187 [2018-02-02 20:45:03,920 INFO L226 Difference]: Without dead ends: 187 [2018-02-02 20:45:03,920 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:45:03,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-02 20:45:03,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 163. [2018-02-02 20:45:03,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 20:45:03,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 190 transitions. [2018-02-02 20:45:03,923 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 190 transitions. Word has length 38 [2018-02-02 20:45:03,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:03,923 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 190 transitions. [2018-02-02 20:45:03,923 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:45:03,923 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 190 transitions. [2018-02-02 20:45:03,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 20:45:03,923 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:03,923 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] [2018-02-02 20:45:03,923 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:03,923 INFO L82 PathProgramCache]: Analyzing trace with hash 102012898, now seen corresponding path program 1 times [2018-02-02 20:45:03,924 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:03,933 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:04,072 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 20:45:04,072 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:04,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:45:04,072 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:04,072 INFO 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 20:45:04,073 INFO L182 omatonBuilderFactory]: Interpolants [6736#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 6737#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 6738#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base)), 6739#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 6740#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 6741#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 6742#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 6743#(= 1 (select |#valid| |main_#t~mem14.base|)), 6744#(= 1 (select |#valid| main_~x~0.base)), 6733#true, 6734#false, 6735#(= (select |#valid| main_~head~0.base) 1)] [2018-02-02 20:45:04,073 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 20:45:04,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:45:04,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:45:04,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:45:04,073 INFO L87 Difference]: Start difference. First operand 163 states and 190 transitions. Second operand 12 states. [2018-02-02 20:45:04,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:04,447 INFO L93 Difference]: Finished difference Result 261 states and 298 transitions. [2018-02-02 20:45:04,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:45:04,447 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-02-02 20:45:04,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:04,448 INFO L225 Difference]: With dead ends: 261 [2018-02-02 20:45:04,448 INFO L226 Difference]: Without dead ends: 261 [2018-02-02 20:45:04,448 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:45:04,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-02-02 20:45:04,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 196. [2018-02-02 20:45:04,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-02 20:45:04,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 227 transitions. [2018-02-02 20:45:04,453 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 227 transitions. Word has length 39 [2018-02-02 20:45:04,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:04,453 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 227 transitions. [2018-02-02 20:45:04,453 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:45:04,453 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 227 transitions. [2018-02-02 20:45:04,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 20:45:04,453 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:04,454 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] [2018-02-02 20:45:04,454 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:04,454 INFO L82 PathProgramCache]: Analyzing trace with hash 102012899, now seen corresponding path program 1 times [2018-02-02 20:45:04,455 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:04,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:04,640 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 20:45:04,640 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:04,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:45:04,640 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:04,640 INFO 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 20:45:04,640 INFO L182 omatonBuilderFactory]: Interpolants [7232#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 7233#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 7234#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)))), 7235#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 7236#(and (= 0 |main_#t~mem14.offset|) (= 12 (select |#length| |main_#t~mem14.base|))), 7237#(and (= (select |#length| main_~x~0.base) 12) (= 0 main_~x~0.offset)), 7226#true, 7227#false, 7228#(= (select |#valid| main_~head~0.base) 1), 7229#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 7230#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 7231#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base))] [2018-02-02 20:45:04,640 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 20:45:04,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:45:04,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:45:04,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:45:04,641 INFO L87 Difference]: Start difference. First operand 196 states and 227 transitions. Second operand 12 states. [2018-02-02 20:45:05,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:05,129 INFO L93 Difference]: Finished difference Result 265 states and 299 transitions. [2018-02-02 20:45:05,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:45:05,129 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-02-02 20:45:05,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:05,130 INFO L225 Difference]: With dead ends: 265 [2018-02-02 20:45:05,130 INFO L226 Difference]: Without dead ends: 265 [2018-02-02 20:45:05,130 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:45:05,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-02-02 20:45:05,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 209. [2018-02-02 20:45:05,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 20:45:05,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 245 transitions. [2018-02-02 20:45:05,134 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 245 transitions. Word has length 39 [2018-02-02 20:45:05,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:05,134 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 245 transitions. [2018-02-02 20:45:05,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:45:05,134 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 245 transitions. [2018-02-02 20:45:05,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 20:45:05,135 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:05,135 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:05,135 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:05,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1908893701, now seen corresponding path program 1 times [2018-02-02 20:45:05,136 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:05,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:05,391 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 20:45:05,391 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:05,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:45:05,391 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:05,391 INFO 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 20:45:05,392 INFO L182 omatonBuilderFactory]: Interpolants [7728#true, 7729#false, 7730#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 7731#(and (= 12 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 7732#(and (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset))) (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 7733#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))), 7734#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))))), 7735#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 7736#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)))), 7737#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 7738#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem16.offset| 0)), 7739#(and (<= |main_#t~mem18.offset| 0) (<= 0 |main_#t~mem18.offset|) (= (select |#length| |main_#t~mem18.base|) 12))] [2018-02-02 20:45:05,392 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 20:45:05,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:45:05,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:45:05,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:45:05,393 INFO L87 Difference]: Start difference. First operand 209 states and 245 transitions. Second operand 12 states. [2018-02-02 20:45:05,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:05,870 INFO L93 Difference]: Finished difference Result 231 states and 254 transitions. [2018-02-02 20:45:05,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:45:05,870 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2018-02-02 20:45:05,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:05,871 INFO L225 Difference]: With dead ends: 231 [2018-02-02 20:45:05,871 INFO L226 Difference]: Without dead ends: 231 [2018-02-02 20:45:05,871 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:45:05,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-02-02 20:45:05,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 209. [2018-02-02 20:45:05,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 20:45:05,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 244 transitions. [2018-02-02 20:45:05,875 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 244 transitions. Word has length 43 [2018-02-02 20:45:05,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:05,875 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 244 transitions. [2018-02-02 20:45:05,875 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:45:05,875 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 244 transitions. [2018-02-02 20:45:05,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 20:45:05,876 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:05,876 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:05,876 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:05,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1908893700, now seen corresponding path program 1 times [2018-02-02 20:45:05,877 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:05,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:05,907 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 20:45:05,907 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:45:05,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:45:05,907 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:05,908 INFO 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 20:45:05,908 INFO L182 omatonBuilderFactory]: Interpolants [8200#true, 8201#false, 8202#(= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)), 8203#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 8204#(= 1 (select |#valid| |main_#t~mem18.base|))] [2018-02-02 20:45:05,908 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 20:45:05,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:45:05,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:45:05,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:45:05,909 INFO L87 Difference]: Start difference. First operand 209 states and 244 transitions. Second operand 5 states. [2018-02-02 20:45:05,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:05,984 INFO L93 Difference]: Finished difference Result 213 states and 245 transitions. [2018-02-02 20:45:05,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:45:05,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-02-02 20:45:05,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:05,985 INFO L225 Difference]: With dead ends: 213 [2018-02-02 20:45:05,985 INFO L226 Difference]: Without dead ends: 213 [2018-02-02 20:45:05,985 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:45:05,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-02-02 20:45:05,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 208. [2018-02-02 20:45:05,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 20:45:05,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 240 transitions. [2018-02-02 20:45:05,988 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 240 transitions. Word has length 43 [2018-02-02 20:45:05,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:05,988 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 240 transitions. [2018-02-02 20:45:05,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:45:05,989 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 240 transitions. [2018-02-02 20:45:05,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 20:45:05,989 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:05,989 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] [2018-02-02 20:45:05,989 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:05,990 INFO L82 PathProgramCache]: Analyzing trace with hash 948679881, now seen corresponding path program 1 times [2018-02-02 20:45:05,990 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:05,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:06,176 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 20:45:06,176 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:06,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:45:06,176 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:06,176 INFO 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 20:45:06,176 INFO L182 omatonBuilderFactory]: Interpolants [8640#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 8641#(= main_~head~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))), 8642#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 8643#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 8644#(= 1 (select |#valid| |main_#t~mem16.base|)), 8631#true, 8632#false, 8633#(= (select |#valid| main_~head~0.base) 1), 8634#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 8635#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 8636#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 8637#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 8638#(and (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.offset|) (not (= main_~head~0.base |main_#t~mem9.base|))), 8639#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)))] [2018-02-02 20:45:06,176 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 20:45:06,177 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:45:06,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:45:06,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:45:06,177 INFO L87 Difference]: Start difference. First operand 208 states and 240 transitions. Second operand 14 states. [2018-02-02 20:45:06,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:06,565 INFO L93 Difference]: Finished difference Result 267 states and 298 transitions. [2018-02-02 20:45:06,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:45:06,565 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-02-02 20:45:06,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:06,566 INFO L225 Difference]: With dead ends: 267 [2018-02-02 20:45:06,566 INFO L226 Difference]: Without dead ends: 267 [2018-02-02 20:45:06,566 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:45:06,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-02-02 20:45:06,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 208. [2018-02-02 20:45:06,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 20:45:06,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 239 transitions. [2018-02-02 20:45:06,568 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 239 transitions. Word has length 43 [2018-02-02 20:45:06,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:06,568 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 239 transitions. [2018-02-02 20:45:06,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:45:06,569 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 239 transitions. [2018-02-02 20:45:06,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 20:45:06,569 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:06,569 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] [2018-02-02 20:45:06,569 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:06,569 INFO L82 PathProgramCache]: Analyzing trace with hash 948679882, now seen corresponding path program 1 times [2018-02-02 20:45:06,569 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:06,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:06,868 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 20:45:06,868 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:06,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:45:06,868 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:06,869 INFO 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 20:45:06,869 INFO L182 omatonBuilderFactory]: Interpolants [9152#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~x~0.base)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 9153#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 9154#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 9155#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.offset|) (not (= main_~head~0.base |main_#t~mem9.base|))), 9156#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 9157#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 9158#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 9159#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 9160#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 9161#(and (= |main_#t~mem16.offset| 0) (= (select |#length| |main_#t~mem16.base|) 12)), 9146#true, 9147#false, 9148#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 9149#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base))), 9150#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 9151#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))] [2018-02-02 20:45:06,869 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 20:45:06,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:45:06,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:45:06,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:45:06,870 INFO L87 Difference]: Start difference. First operand 208 states and 239 transitions. Second operand 16 states. [2018-02-02 20:45:07,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:07,532 INFO L93 Difference]: Finished difference Result 269 states and 299 transitions. [2018-02-02 20:45:07,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:45:07,533 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-02-02 20:45:07,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:07,533 INFO L225 Difference]: With dead ends: 269 [2018-02-02 20:45:07,534 INFO L226 Difference]: Without dead ends: 269 [2018-02-02 20:45:07,534 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:45:07,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-02 20:45:07,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 208. [2018-02-02 20:45:07,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 20:45:07,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 238 transitions. [2018-02-02 20:45:07,537 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 238 transitions. Word has length 43 [2018-02-02 20:45:07,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:07,537 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 238 transitions. [2018-02-02 20:45:07,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:45:07,537 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 238 transitions. [2018-02-02 20:45:07,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 20:45:07,537 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:07,537 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] [2018-02-02 20:45:07,537 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:07,538 INFO L82 PathProgramCache]: Analyzing trace with hash -656154405, now seen corresponding path program 1 times [2018-02-02 20:45:07,538 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:07,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:07,788 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 20:45:07,788 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:07,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:45:07,788 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:07,788 INFO 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 20:45:07,789 INFO L182 omatonBuilderFactory]: Interpolants [9669#true, 9670#false, 9671#(= (select |#valid| main_~head~0.base) 1), 9672#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 9673#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 9674#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 9675#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 9676#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 9677#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 9678#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 9679#(and (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem14.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 9680#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0)), 9681#(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) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 9682#(and (<= 0 |main_#t~mem23.offset|) (<= (+ |main_#t~mem23.offset| 12) (select |#length| |main_#t~mem23.base|))), 9683#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset))] [2018-02-02 20:45:07,789 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 20:45:07,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:45:07,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:45:07,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:45:07,789 INFO L87 Difference]: Start difference. First operand 208 states and 238 transitions. Second operand 15 states. [2018-02-02 20:45:08,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:08,266 INFO L93 Difference]: Finished difference Result 261 states and 292 transitions. [2018-02-02 20:45:08,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:45:08,267 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-02-02 20:45:08,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:08,267 INFO L225 Difference]: With dead ends: 261 [2018-02-02 20:45:08,267 INFO L226 Difference]: Without dead ends: 261 [2018-02-02 20:45:08,268 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:45:08,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-02-02 20:45:08,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 230. [2018-02-02 20:45:08,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-02 20:45:08,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 272 transitions. [2018-02-02 20:45:08,271 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 272 transitions. Word has length 44 [2018-02-02 20:45:08,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:08,271 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 272 transitions. [2018-02-02 20:45:08,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:45:08,271 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 272 transitions. [2018-02-02 20:45:08,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 20:45:08,272 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:08,272 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] [2018-02-02 20:45:08,272 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:08,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1541300541, now seen corresponding path program 1 times [2018-02-02 20:45:08,273 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:08,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:08,602 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:45:08,602 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:45:08,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 20:45:08,602 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:08,603 INFO 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 20:45:08,603 INFO L182 omatonBuilderFactory]: Interpolants [10208#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))), 10209#(and (= main_~head~0.base |main_#t~mem14.base|) (= main_~head~0.offset |main_#t~mem14.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) |main_#t~mem14.offset|) |main_#t~mem14.base|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10210#(and (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.base main_~x~0.base) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~x~0.offset)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10211#(and (= |main_#t~mem15| (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.base main_~x~0.base) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~x~0.offset)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10212#(and (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.base main_~x~0.base) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~x~0.offset)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10213#(and (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (= main_~head~0.offset main_~x~0.offset) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset |main_#t~mem16.offset|) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 10214#(and (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ main_~x~0.offset 8)) |main_#t~mem17|) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 10215#(and (= main_~head~0.offset main_~x~0.offset) (not |main_#t~short21|) (= main_~head~0.offset 0)), 10203#true, 10204#false, 10205#(= 0 |main_#t~malloc0.offset|), 10206#(= main_~head~0.offset 0), 10207#(and (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0))] [2018-02-02 20:45:08,603 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:45:08,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:45:08,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:45:08,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:45:08,603 INFO L87 Difference]: Start difference. First operand 230 states and 272 transitions. Second operand 13 states. [2018-02-02 20:45:08,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:08,848 INFO L93 Difference]: Finished difference Result 239 states and 271 transitions. [2018-02-02 20:45:08,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:45:08,848 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2018-02-02 20:45:08,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:08,849 INFO L225 Difference]: With dead ends: 239 [2018-02-02 20:45:08,849 INFO L226 Difference]: Without dead ends: 239 [2018-02-02 20:45:08,849 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:45:08,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-02 20:45:08,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 230. [2018-02-02 20:45:08,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-02 20:45:08,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 271 transitions. [2018-02-02 20:45:08,851 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 271 transitions. Word has length 45 [2018-02-02 20:45:08,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:08,851 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 271 transitions. [2018-02-02 20:45:08,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:45:08,851 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 271 transitions. [2018-02-02 20:45:08,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 20:45:08,852 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:08,852 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] [2018-02-02 20:45:08,852 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:08,852 INFO L82 PathProgramCache]: Analyzing trace with hash 795813223, now seen corresponding path program 1 times [2018-02-02 20:45:08,852 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:08,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:09,153 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 20:45:09,153 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:09,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:45:09,153 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:09,154 INFO 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 20:45:09,154 INFO L182 omatonBuilderFactory]: Interpolants [10703#true, 10704#false, 10705#(= (select |#valid| main_~head~0.base) 1), 10706#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 10707#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 10708#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 10709#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 10710#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10711#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)))), 10712#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10713#(and (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10714#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~x~0.offset 0)), 10715#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10716#(and (<= 0 |main_#t~mem23.offset|) (= 12 (select |#length| |main_#t~mem23.base|))), 10717#(and (<= 0 main_~x~0.offset) (= (select |#length| main_~x~0.base) 12)), 10718#(and (<= main_~x~0.offset 0) (<= 0 main_~x~0.offset))] [2018-02-02 20:45:09,154 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 20:45:09,154 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:45:09,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:45:09,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:45:09,154 INFO L87 Difference]: Start difference. First operand 230 states and 271 transitions. Second operand 16 states. [2018-02-02 20:45:09,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:09,603 INFO L93 Difference]: Finished difference Result 260 states and 290 transitions. [2018-02-02 20:45:09,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:45:09,604 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-02-02 20:45:09,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:09,604 INFO L225 Difference]: With dead ends: 260 [2018-02-02 20:45:09,604 INFO L226 Difference]: Without dead ends: 260 [2018-02-02 20:45:09,605 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=707, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:45:09,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-02-02 20:45:09,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 231. [2018-02-02 20:45:09,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 20:45:09,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 272 transitions. [2018-02-02 20:45:09,607 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 272 transitions. Word has length 46 [2018-02-02 20:45:09,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:09,607 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 272 transitions. [2018-02-02 20:45:09,607 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:45:09,607 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 272 transitions. [2018-02-02 20:45:09,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 20:45:09,608 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:09,608 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] [2018-02-02 20:45:09,608 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:09,608 INFO L82 PathProgramCache]: Analyzing trace with hash 272333992, now seen corresponding path program 1 times [2018-02-02 20:45:09,608 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:09,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:09,903 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 20:45:09,904 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:09,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:45:09,904 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:09,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:09,904 INFO L182 omatonBuilderFactory]: Interpolants [11238#true, 11239#false, 11240#(= 0 |main_#t~malloc0.offset|), 11241#(= main_~head~0.offset 0), 11242#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 11243#(and (= main_~head~0.offset main_~x~0.offset) (= main_~state~0 1) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 11244#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~state~0 1) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 11245#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~state~0 1) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0)), 11246#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~state~0 1) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0)), 11247#(and (= 0 |main_#t~mem9.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= main_~state~0 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 11248#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (= main_~state~0 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 11249#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8)) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 11250#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8)) 1) (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 11251#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~x~0.offset 8)) 1) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 11252#(and (= |main_#t~mem15| 1) (= main_~head~0.offset 0))] [2018-02-02 20:45:09,905 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 20:45:09,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:45:09,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:45:09,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:45:09,905 INFO L87 Difference]: Start difference. First operand 231 states and 272 transitions. Second operand 15 states. [2018-02-02 20:45:10,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:10,369 INFO L93 Difference]: Finished difference Result 299 states and 343 transitions. [2018-02-02 20:45:10,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:45:10,369 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-02-02 20:45:10,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:10,369 INFO L225 Difference]: With dead ends: 299 [2018-02-02 20:45:10,369 INFO L226 Difference]: Without dead ends: 299 [2018-02-02 20:45:10,370 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:45:10,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-02-02 20:45:10,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 240. [2018-02-02 20:45:10,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-02-02 20:45:10,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 281 transitions. [2018-02-02 20:45:10,372 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 281 transitions. Word has length 48 [2018-02-02 20:45:10,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:10,372 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 281 transitions. [2018-02-02 20:45:10,372 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:45:10,372 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 281 transitions. [2018-02-02 20:45:10,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 20:45:10,373 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:10,373 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] [2018-02-02 20:45:10,373 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:10,373 INFO L82 PathProgramCache]: Analyzing trace with hash -346724928, now seen corresponding path program 1 times [2018-02-02 20:45:10,373 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:10,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:10,582 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 20:45:10,582 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:10,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:45:10,583 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:10,583 INFO 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 20:45:10,583 INFO L182 omatonBuilderFactory]: Interpolants [11818#true, 11819#false, 11820#(= 0 |main_#t~malloc0.offset|), 11821#(= 0 main_~head~0.offset), 11822#(and (= 0 main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1)), 11823#(and (= 0 main_~head~0.offset) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 11824#(and (= 0 main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 11825#(and (= 0 main_~head~0.offset) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 11826#(and (= 0 main_~head~0.offset) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 11827#(and (= 0 main_~head~0.offset) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.offset|) (not (= main_~head~0.base |main_#t~mem9.base|))), 11828#(and (= 0 main_~head~0.offset) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 11829#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 11830#(= 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))), 11831#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|)), 11832#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 11833#(and (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem16.offset| 0) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 11834#(and (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 11835#(and (<= 0 |main_#t~mem18.offset|) (<= (+ |main_#t~mem18.offset| 12) (select |#length| |main_#t~mem18.base|)))] [2018-02-02 20:45:10,583 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 20:45:10,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:45:10,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:45:10,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:45:10,584 INFO L87 Difference]: Start difference. First operand 240 states and 281 transitions. Second operand 18 states. [2018-02-02 20:45:11,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:11,150 INFO L93 Difference]: Finished difference Result 274 states and 304 transitions. [2018-02-02 20:45:11,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:45:11,150 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2018-02-02 20:45:11,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:11,151 INFO L225 Difference]: With dead ends: 274 [2018-02-02 20:45:11,151 INFO L226 Difference]: Without dead ends: 274 [2018-02-02 20:45:11,151 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=254, Invalid=1006, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 20:45:11,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-02-02 20:45:11,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 240. [2018-02-02 20:45:11,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-02-02 20:45:11,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 280 transitions. [2018-02-02 20:45:11,153 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 280 transitions. Word has length 48 [2018-02-02 20:45:11,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:11,153 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 280 transitions. [2018-02-02 20:45:11,153 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:45:11,154 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 280 transitions. [2018-02-02 20:45:11,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 20:45:11,154 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:11,154 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:11,154 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:11,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1817072699, now seen corresponding path program 1 times [2018-02-02 20:45:11,155 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:11,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:11,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:45:11,429 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:11,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:45:11,430 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:11,430 INFO 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 20:45:11,430 INFO L182 omatonBuilderFactory]: Interpolants [12386#true, 12387#false, 12388#(= 0 |main_#t~malloc0.offset|), 12389#(= main_~head~0.offset 0), 12390#(and (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 12391#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))), 12392#(and (= main_~head~0.base |main_#t~mem14.base|) (= main_~head~0.offset |main_#t~mem14.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) |main_#t~mem14.offset|) |main_#t~mem14.base|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 12393#(and (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.base main_~x~0.base) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~x~0.offset)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 12394#(and (= |main_#t~mem15| (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.base main_~x~0.base) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~x~0.offset)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 12395#(and (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.base main_~x~0.base) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~x~0.offset)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 12396#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem22.offset|) (not (= 0 (select (select |#memory_int| |main_#t~mem22.base|) (+ main_~head~0.offset 8)))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 12397#(and (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 12398#(and (= main_~head~0.offset 0) (not (= 0 |main_#t~mem15|)))] [2018-02-02 20:45:11,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:45:11,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:45:11,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:45:11,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:45:11,430 INFO L87 Difference]: Start difference. First operand 240 states and 280 transitions. Second operand 13 states. [2018-02-02 20:45:11,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:11,624 INFO L93 Difference]: Finished difference Result 250 states and 280 transitions. [2018-02-02 20:45:11,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:45:11,624 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2018-02-02 20:45:11,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:11,625 INFO L225 Difference]: With dead ends: 250 [2018-02-02 20:45:11,625 INFO L226 Difference]: Without dead ends: 250 [2018-02-02 20:45:11,625 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:45:11,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-02 20:45:11,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 240. [2018-02-02 20:45:11,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-02-02 20:45:11,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 279 transitions. [2018-02-02 20:45:11,628 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 279 transitions. Word has length 49 [2018-02-02 20:45:11,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:11,628 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 279 transitions. [2018-02-02 20:45:11,628 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:45:11,628 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 279 transitions. [2018-02-02 20:45:11,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 20:45:11,629 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:11,629 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:11,629 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:11,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1609972004, now seen corresponding path program 1 times [2018-02-02 20:45:11,630 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:11,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:11,992 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 20:45:11,992 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:11,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:45:11,993 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:11,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:11,993 INFO L182 omatonBuilderFactory]: Interpolants [12907#true, 12908#false, 12909#(= 0 |main_#t~malloc0.offset|), 12910#(= main_~head~0.offset 0), 12911#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 12912#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 12913#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 12914#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0)), 12915#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 12916#(and (= 0 |main_#t~mem9.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 12917#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 12918#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (not (= main_~state~0 0)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 12919#(and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8)) 0)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 12920#(and (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8)) 0)) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 12921#(and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~x~0.offset 8)) 0)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 12922#(and (not (= |main_#t~mem15| 0)) (= main_~head~0.offset 0))] [2018-02-02 20:45:11,993 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 20:45:11,993 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:45:11,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:45:11,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:45:11,993 INFO L87 Difference]: Start difference. First operand 240 states and 279 transitions. Second operand 16 states. [2018-02-02 20:45:12,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:12,449 INFO L93 Difference]: Finished difference Result 305 states and 346 transitions. [2018-02-02 20:45:12,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:45:12,449 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-02-02 20:45:12,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:12,450 INFO L225 Difference]: With dead ends: 305 [2018-02-02 20:45:12,450 INFO L226 Difference]: Without dead ends: 305 [2018-02-02 20:45:12,450 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=675, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:45:12,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-02-02 20:45:12,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 231. [2018-02-02 20:45:12,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 20:45:12,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 269 transitions. [2018-02-02 20:45:12,452 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 269 transitions. Word has length 49 [2018-02-02 20:45:12,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:12,452 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 269 transitions. [2018-02-02 20:45:12,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:45:12,452 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 269 transitions. [2018-02-02 20:45:12,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 20:45:12,453 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:12,453 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:12,453 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:12,453 INFO L82 PathProgramCache]: Analyzing trace with hash -2109490696, now seen corresponding path program 1 times [2018-02-02 20:45:12,453 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:12,458 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:12,488 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:45:12,489 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:45:12,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:45:12,489 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:12,489 INFO 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 20:45:12,489 INFO L182 omatonBuilderFactory]: Interpolants [13488#false, 13489#(= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)), 13490#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 13491#(= 1 (select |#valid| |main_#t~mem22.base|)), 13492#(= 1 (select |#valid| main_~x~0.base)), 13487#true] [2018-02-02 20:45:12,490 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:45:12,490 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:45:12,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:45:12,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:45:12,490 INFO L87 Difference]: Start difference. First operand 231 states and 269 transitions. Second operand 6 states. [2018-02-02 20:45:12,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:12,579 INFO L93 Difference]: Finished difference Result 234 states and 270 transitions. [2018-02-02 20:45:12,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:45:12,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-02-02 20:45:12,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:12,580 INFO L225 Difference]: With dead ends: 234 [2018-02-02 20:45:12,580 INFO L226 Difference]: Without dead ends: 234 [2018-02-02 20:45:12,580 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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 20:45:12,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-02-02 20:45:12,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-02-02 20:45:12,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-02-02 20:45:12,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 270 transitions. [2018-02-02 20:45:12,583 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 270 transitions. Word has length 50 [2018-02-02 20:45:12,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:12,583 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 270 transitions. [2018-02-02 20:45:12,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:45:12,583 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 270 transitions. [2018-02-02 20:45:12,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 20:45:12,584 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:12,584 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:12,584 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:12,584 INFO L82 PathProgramCache]: Analyzing trace with hash -2109490695, now seen corresponding path program 1 times [2018-02-02 20:45:12,585 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:12,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:12,817 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:12,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:45:12,817 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:12,818 INFO 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 20:45:12,818 INFO L182 omatonBuilderFactory]: Interpolants [13971#true, 13972#false, 13973#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 13974#(and (= 12 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 13975#(and (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset))) (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 13976#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))), 13977#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))))), 13978#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 13979#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)))), 13980#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 13981#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem16.offset| 0)), 13982#(and (= 12 (select |#length| |main_#t~mem22.base|)) (<= 0 |main_#t~mem22.offset|) (<= |main_#t~mem22.offset| 0)), 13983#(and (<= main_~x~0.offset 0) (<= 0 main_~x~0.offset) (= (select |#length| main_~x~0.base) 12))] [2018-02-02 20:45:12,818 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:12,818 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:45:12,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:45:12,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:45:12,819 INFO L87 Difference]: Start difference. First operand 233 states and 270 transitions. Second operand 13 states. [2018-02-02 20:45:13,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:13,240 INFO L93 Difference]: Finished difference Result 270 states and 300 transitions. [2018-02-02 20:45:13,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:45:13,240 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-02-02 20:45:13,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:13,241 INFO L225 Difference]: With dead ends: 270 [2018-02-02 20:45:13,241 INFO L226 Difference]: Without dead ends: 270 [2018-02-02 20:45:13,241 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:45:13,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-02-02 20:45:13,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 249. [2018-02-02 20:45:13,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-02-02 20:45:13,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 291 transitions. [2018-02-02 20:45:13,243 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 291 transitions. Word has length 50 [2018-02-02 20:45:13,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:13,243 INFO L432 AbstractCegarLoop]: Abstraction has 249 states and 291 transitions. [2018-02-02 20:45:13,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:45:13,243 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 291 transitions. [2018-02-02 20:45:13,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 20:45:13,244 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:13,244 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] [2018-02-02 20:45:13,244 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:13,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1216109354, now seen corresponding path program 1 times [2018-02-02 20:45:13,244 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:13,249 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:13,435 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:13,436 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:13,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:45:13,436 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:13,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:13,436 INFO L182 omatonBuilderFactory]: Interpolants [14528#false, 14529#(= 0 |main_#t~malloc0.offset|), 14530#(= 0 main_~head~0.offset), 14531#(and (= 0 main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1)), 14532#(and (= 0 main_~head~0.offset) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 14533#(and (= 0 main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 14534#(and (= 0 main_~head~0.offset) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 14535#(and (= 0 main_~head~0.offset) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 14536#(and (= 0 main_~head~0.offset) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.offset|) (not (= main_~head~0.base |main_#t~mem9.base|))), 14537#(and (= 0 main_~head~0.offset) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 14538#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 14539#(= 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))), 14540#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|)), 14541#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 14542#(and (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem16.offset| 0) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 14543#(and (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 14544#(and (<= 0 |main_#t~mem22.offset|) (<= (+ |main_#t~mem22.offset| 12) (select |#length| |main_#t~mem22.base|))), 14545#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset)), 14527#true] [2018-02-02 20:45:13,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:13,436 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:45:13,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:45:13,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:45:13,437 INFO L87 Difference]: Start difference. First operand 249 states and 291 transitions. Second operand 19 states. [2018-02-02 20:45:14,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:14,078 INFO L93 Difference]: Finished difference Result 300 states and 335 transitions. [2018-02-02 20:45:14,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:45:14,079 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-02-02 20:45:14,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:14,080 INFO L225 Difference]: With dead ends: 300 [2018-02-02 20:45:14,080 INFO L226 Difference]: Without dead ends: 300 [2018-02-02 20:45:14,080 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=274, Invalid=1208, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 20:45:14,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-02-02 20:45:14,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 265. [2018-02-02 20:45:14,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-02-02 20:45:14,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 312 transitions. [2018-02-02 20:45:14,083 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 312 transitions. Word has length 51 [2018-02-02 20:45:14,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:14,084 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 312 transitions. [2018-02-02 20:45:14,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:45:14,084 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 312 transitions. [2018-02-02 20:45:14,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 20:45:14,084 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:14,085 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:14,085 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:14,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1098072126, now seen corresponding path program 1 times [2018-02-02 20:45:14,085 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:14,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:14,101 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:14,101 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:45:14,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:45:14,101 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:14,101 INFO 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 20:45:14,101 INFO L182 omatonBuilderFactory]: Interpolants [15152#false, 15153#(= main_~state~0 2), 15151#true] [2018-02-02 20:45:14,101 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:14,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:45:14,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:45:14,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:45:14,102 INFO L87 Difference]: Start difference. First operand 265 states and 312 transitions. Second operand 3 states. [2018-02-02 20:45:14,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:14,109 INFO L93 Difference]: Finished difference Result 396 states and 466 transitions. [2018-02-02 20:45:14,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:45:14,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-02-02 20:45:14,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:14,110 INFO L225 Difference]: With dead ends: 396 [2018-02-02 20:45:14,110 INFO L226 Difference]: Without dead ends: 396 [2018-02-02 20:45:14,110 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 20:45:14,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-02-02 20:45:14,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 284. [2018-02-02 20:45:14,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-02 20:45:14,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 333 transitions. [2018-02-02 20:45:14,113 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 333 transitions. Word has length 52 [2018-02-02 20:45:14,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:14,113 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 333 transitions. [2018-02-02 20:45:14,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:45:14,113 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 333 transitions. [2018-02-02 20:45:14,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 20:45:14,113 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:14,113 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-02-02 20:45:14,113 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:14,114 INFO L82 PathProgramCache]: Analyzing trace with hash -443556897, now seen corresponding path program 1 times [2018-02-02 20:45:14,114 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:14,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:14,303 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 20:45:14,303 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:14,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:45:14,303 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:14,304 INFO 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 20:45:14,304 INFO L182 omatonBuilderFactory]: Interpolants [15840#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 15841#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))))), 15842#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 15843#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)))), 15844#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 15845#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|))), 15846#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 15847#(= 1 (select |#valid| |main_#t~mem16.base|)), 15834#true, 15835#false, 15836#(= 0 |main_#t~malloc0.offset|), 15837#(= main_~head~0.offset 0), 15838#(and (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 15839#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)))] [2018-02-02 20:45:14,304 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 20:45:14,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:45:14,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:45:14,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:45:14,304 INFO L87 Difference]: Start difference. First operand 284 states and 333 transitions. Second operand 14 states. [2018-02-02 20:45:14,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:14,712 INFO L93 Difference]: Finished difference Result 297 states and 335 transitions. [2018-02-02 20:45:14,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:45:14,712 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2018-02-02 20:45:14,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:14,713 INFO L225 Difference]: With dead ends: 297 [2018-02-02 20:45:14,713 INFO L226 Difference]: Without dead ends: 297 [2018-02-02 20:45:14,713 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:45:14,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-02-02 20:45:14,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 284. [2018-02-02 20:45:14,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-02 20:45:14,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 332 transitions. [2018-02-02 20:45:14,715 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 332 transitions. Word has length 54 [2018-02-02 20:45:14,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:14,715 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 332 transitions. [2018-02-02 20:45:14,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:45:14,715 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 332 transitions. [2018-02-02 20:45:14,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 20:45:14,715 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:14,716 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-02-02 20:45:14,716 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:14,716 INFO L82 PathProgramCache]: Analyzing trace with hash -443556896, now seen corresponding path program 1 times [2018-02-02 20:45:14,716 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:14,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:14,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:14,914 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 20:45:14,915 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:14,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:45:14,915 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:14,915 INFO 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 20:45:14,915 INFO L182 omatonBuilderFactory]: Interpolants [16459#true, 16460#false, 16461#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 16462#(and (= 12 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 16463#(and (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset))) (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 16464#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))), 16465#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|)))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|)))))), 16466#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 16467#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|))))), 16468#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 16469#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)))), 16470#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 16471#(and (= |main_#t~mem16.offset| 0) (= (select |#length| |main_#t~mem16.base|) 12))] [2018-02-02 20:45:14,916 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 20:45:14,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:45:14,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:45:14,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:45:14,916 INFO L87 Difference]: Start difference. First operand 284 states and 332 transitions. Second operand 13 states. [2018-02-02 20:45:15,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:15,383 INFO L93 Difference]: Finished difference Result 303 states and 340 transitions. [2018-02-02 20:45:15,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:45:15,383 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2018-02-02 20:45:15,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:15,384 INFO L225 Difference]: With dead ends: 303 [2018-02-02 20:45:15,384 INFO L226 Difference]: Without dead ends: 303 [2018-02-02 20:45:15,385 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:45:15,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-02-02 20:45:15,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 284. [2018-02-02 20:45:15,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-02 20:45:15,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 331 transitions. [2018-02-02 20:45:15,387 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 331 transitions. Word has length 54 [2018-02-02 20:45:15,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:15,387 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 331 transitions. [2018-02-02 20:45:15,387 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:45:15,387 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 331 transitions. [2018-02-02 20:45:15,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 20:45:15,387 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:15,387 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:15,387 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:15,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1358237756, now seen corresponding path program 1 times [2018-02-02 20:45:15,388 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:15,393 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:15,612 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:15,612 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:15,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:45:15,613 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:15,613 INFO 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 20:45:15,613 INFO L182 omatonBuilderFactory]: Interpolants [17088#(and (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.offset|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 17089#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 17090#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.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) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 17091#(and (= main_~head~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))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~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)))))), 17092#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|)))), 17093#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 17094#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|))), 17095#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 17096#(= 1 (select |#valid| |main_#t~mem16.base|)), 17081#true, 17082#false, 17083#(= (select |#valid| main_~head~0.base) 1), 17084#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 17085#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= 1 (select |#valid| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 17086#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 17087#(and (= main_~head~0.offset main_~x~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)))] [2018-02-02 20:45:15,613 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:15,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:45:15,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:45:15,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:45:15,614 INFO L87 Difference]: Start difference. First operand 284 states and 331 transitions. Second operand 16 states. [2018-02-02 20:45:16,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:16,231 INFO L93 Difference]: Finished difference Result 315 states and 351 transitions. [2018-02-02 20:45:16,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:45:16,231 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2018-02-02 20:45:16,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:16,232 INFO L225 Difference]: With dead ends: 315 [2018-02-02 20:45:16,232 INFO L226 Difference]: Without dead ends: 315 [2018-02-02 20:45:16,232 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:45:16,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-02-02 20:45:16,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 284. [2018-02-02 20:45:16,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-02 20:45:16,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 330 transitions. [2018-02-02 20:45:16,235 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 330 transitions. Word has length 55 [2018-02-02 20:45:16,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:16,235 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 330 transitions. [2018-02-02 20:45:16,235 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:45:16,235 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 330 transitions. [2018-02-02 20:45:16,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 20:45:16,235 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:16,235 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:16,235 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:16,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1358237757, now seen corresponding path program 1 times [2018-02-02 20:45:16,236 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:16,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:16,490 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:16,490 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:16,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:45:16,491 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:16,491 INFO 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 20:45:16,491 INFO L182 omatonBuilderFactory]: Interpolants [17728#true, 17729#false, 17730#(= (select |#valid| main_~head~0.base) 1), 17731#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 17732#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 17733#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 17734#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 17735#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.offset|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 17736#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 17737#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 17738#(and (= main_~head~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))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~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)))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~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)))))), 17739#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))))), 17740#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 17741#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)))), 17742#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 17743#(and (= |main_#t~mem16.offset| 0) (= (select |#length| |main_#t~mem16.base|) 12))] [2018-02-02 20:45:16,491 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:16,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:45:16,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:45:16,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:45:16,491 INFO L87 Difference]: Start difference. First operand 284 states and 330 transitions. Second operand 16 states. [2018-02-02 20:45:17,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:17,096 INFO L93 Difference]: Finished difference Result 317 states and 352 transitions. [2018-02-02 20:45:17,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:45:17,096 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2018-02-02 20:45:17,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:17,097 INFO L225 Difference]: With dead ends: 317 [2018-02-02 20:45:17,097 INFO L226 Difference]: Without dead ends: 317 [2018-02-02 20:45:17,097 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:45:17,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-02-02 20:45:17,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 284. [2018-02-02 20:45:17,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-02 20:45:17,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 329 transitions. [2018-02-02 20:45:17,100 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 329 transitions. Word has length 55 [2018-02-02 20:45:17,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:17,100 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 329 transitions. [2018-02-02 20:45:17,100 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:45:17,100 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 329 transitions. [2018-02-02 20:45:17,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 20:45:17,100 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:17,100 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:17,100 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:17,101 INFO L82 PathProgramCache]: Analyzing trace with hash 761708042, now seen corresponding path program 2 times [2018-02-02 20:45:17,101 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:17,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:17,327 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:17,327 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:17,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:45:17,328 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:17,328 INFO 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 20:45:17,328 INFO L182 omatonBuilderFactory]: Interpolants [18369#true, 18370#false, 18371#(= (select |#valid| main_~head~0.base) 1), 18372#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 18373#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 18374#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 18375#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 18376#(and (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1)), 18377#(and (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 18378#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 18379#(and (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset))), 18380#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 18381#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem7.base|))), 18382#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 18383#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 18384#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 18385#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 18386#(= 1 (select |#valid| |main_#t~mem14.base|)), 18387#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 20:45:17,328 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:17,328 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:45:17,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:45:17,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:45:17,329 INFO L87 Difference]: Start difference. First operand 284 states and 329 transitions. Second operand 19 states. [2018-02-02 20:45:17,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:17,864 INFO L93 Difference]: Finished difference Result 412 states and 470 transitions. [2018-02-02 20:45:17,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:45:17,865 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2018-02-02 20:45:17,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:17,865 INFO L225 Difference]: With dead ends: 412 [2018-02-02 20:45:17,866 INFO L226 Difference]: Without dead ends: 412 [2018-02-02 20:45:17,866 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=291, Invalid=1115, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:45:17,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-02-02 20:45:17,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 334. [2018-02-02 20:45:17,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-02-02 20:45:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 384 transitions. [2018-02-02 20:45:17,868 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 384 transitions. Word has length 56 [2018-02-02 20:45:17,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:17,868 INFO L432 AbstractCegarLoop]: Abstraction has 334 states and 384 transitions. [2018-02-02 20:45:17,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:45:17,868 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 384 transitions. [2018-02-02 20:45:17,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 20:45:17,869 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:17,869 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:17,869 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:17,869 INFO L82 PathProgramCache]: Analyzing trace with hash 761708043, now seen corresponding path program 2 times [2018-02-02 20:45:17,869 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:17,876 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:18,288 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:18,288 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:18,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:45:18,289 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:18,289 INFO 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 20:45:18,289 INFO L182 omatonBuilderFactory]: Interpolants [19172#true, 19173#false, 19174#(= (select |#valid| main_~head~0.base) 1), 19175#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 19176#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 19177#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 19178#(and (= 12 (select |#length| |main_#t~mem7.base|)) (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 19179#(and (= 12 (select |#length| |main_#t~mem9.base|)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 19180#(and (= 12 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 19181#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 19182#(and (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset))), 19183#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 19184#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|))), 19185#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 19186#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 19187#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)))), 19188#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 19189#(and (= 0 |main_#t~mem14.offset|) (= 12 (select |#length| |main_#t~mem14.base|))), 19190#(and (= (select |#length| main_~x~0.base) 12) (= 0 main_~x~0.offset))] [2018-02-02 20:45:18,289 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:18,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:45:18,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:45:18,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:45:18,290 INFO L87 Difference]: Start difference. First operand 334 states and 384 transitions. Second operand 19 states. [2018-02-02 20:45:18,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:18,994 INFO L93 Difference]: Finished difference Result 406 states and 460 transitions. [2018-02-02 20:45:18,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:45:18,994 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2018-02-02 20:45:18,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:18,995 INFO L225 Difference]: With dead ends: 406 [2018-02-02 20:45:18,995 INFO L226 Difference]: Without dead ends: 406 [2018-02-02 20:45:18,995 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=801, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:45:18,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-02-02 20:45:18,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 349. [2018-02-02 20:45:18,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-02-02 20:45:18,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 404 transitions. [2018-02-02 20:45:18,998 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 404 transitions. Word has length 56 [2018-02-02 20:45:18,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:18,998 INFO L432 AbstractCegarLoop]: Abstraction has 349 states and 404 transitions. [2018-02-02 20:45:18,998 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:45:18,998 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 404 transitions. [2018-02-02 20:45:18,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 20:45:18,999 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:18,999 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2018-02-02 20:45:18,999 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:18,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1935424618, now seen corresponding path program 1 times [2018-02-02 20:45:18,999 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:19,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:19,296 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:19,296 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:19,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:45:19,297 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:19,297 INFO 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 20:45:19,297 INFO L182 omatonBuilderFactory]: Interpolants [19972#true, 19973#false, 19974#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 19975#(and (= 12 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 19976#(and (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset))) (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 19977#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))), 19978#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|)))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|)))))), 19979#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 19980#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|))))), 19981#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 19982#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)))), 19983#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 19984#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem16.offset| 0)), 19985#(and (<= |main_#t~mem18.offset| 0) (<= 0 |main_#t~mem18.offset|) (= (select |#length| |main_#t~mem18.base|) 12))] [2018-02-02 20:45:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:19,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:45:19,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:45:19,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:45:19,298 INFO L87 Difference]: Start difference. First operand 349 states and 404 transitions. Second operand 14 states. [2018-02-02 20:45:19,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:19,889 INFO L93 Difference]: Finished difference Result 368 states and 413 transitions. [2018-02-02 20:45:19,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:45:19,889 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2018-02-02 20:45:19,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:19,890 INFO L225 Difference]: With dead ends: 368 [2018-02-02 20:45:19,890 INFO L226 Difference]: Without dead ends: 368 [2018-02-02 20:45:19,890 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:45:19,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-02-02 20:45:19,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 349. [2018-02-02 20:45:19,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-02-02 20:45:19,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 403 transitions. [2018-02-02 20:45:19,893 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 403 transitions. Word has length 59 [2018-02-02 20:45:19,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:19,893 INFO L432 AbstractCegarLoop]: Abstraction has 349 states and 403 transitions. [2018-02-02 20:45:19,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:45:19,893 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 403 transitions. [2018-02-02 20:45:19,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:45:19,894 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:19,894 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:19,894 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:19,894 INFO L82 PathProgramCache]: Analyzing trace with hash -558870251, now seen corresponding path program 1 times [2018-02-02 20:45:19,895 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:19,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:20,182 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 20:45:20,182 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:20,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:45:20,182 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:20,182 INFO 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 20:45:20,182 INFO L182 omatonBuilderFactory]: Interpolants [20736#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 20737#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 20738#(and (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 20739#(and (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem14.base|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 20740#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 20741#(and (= |main_#t~mem15| (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 20742#(and (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 20743#(and (not (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8)))) (= main_~head~0.offset 0)), 20744#(not (= 0 (select (select |#memory_int| |main_#t~mem23.base|) (+ 0 8)))), 20745#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0)), 20746#(or (<= 1 main_~x~0.offset) (not (= 0 |main_#t~mem24|)) (<= (+ main_~x~0.offset 1) 0)), 20747#(or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0)), 20727#true, 20728#false, 20729#(= 0 |main_#t~malloc0.offset|), 20730#(= main_~head~0.offset 0), 20731#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 20732#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 20733#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 20734#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 20735#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= main_~head~0.offset 0))] [2018-02-02 20:45:20,182 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 20:45:20,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:45:20,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:45:20,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:45:20,183 INFO L87 Difference]: Start difference. First operand 349 states and 403 transitions. Second operand 21 states. [2018-02-02 20:45:20,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:20,698 INFO L93 Difference]: Finished difference Result 362 states and 407 transitions. [2018-02-02 20:45:20,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:45:20,698 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2018-02-02 20:45:20,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:20,699 INFO L225 Difference]: With dead ends: 362 [2018-02-02 20:45:20,699 INFO L226 Difference]: Without dead ends: 361 [2018-02-02 20:45:20,699 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=318, Invalid=1488, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 20:45:20,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-02-02 20:45:20,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 348. [2018-02-02 20:45:20,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-02-02 20:45:20,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 401 transitions. [2018-02-02 20:45:20,702 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 401 transitions. Word has length 60 [2018-02-02 20:45:20,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:20,702 INFO L432 AbstractCegarLoop]: Abstraction has 348 states and 401 transitions. [2018-02-02 20:45:20,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:45:20,702 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 401 transitions. [2018-02-02 20:45:20,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:45:20,702 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:20,702 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:20,702 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:20,703 INFO L82 PathProgramCache]: Analyzing trace with hash -558820599, now seen corresponding path program 1 times [2018-02-02 20:45:20,703 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:20,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:45:20,809 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:20,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:45:20,809 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:20,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:20,810 INFO L182 omatonBuilderFactory]: Interpolants [21504#(= (select |#valid| main_~head~0.base) 1), 21505#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 21506#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 21507#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 21508#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 21509#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21510#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 21511#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 21512#(= 0 |main_#t~mem23.offset|), 21513#(= 0 main_~x~0.offset), 21514#(= main_~head~0.offset 0), 21502#true, 21503#false] [2018-02-02 20:45:20,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:45:20,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:45:20,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:45:20,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:45:20,810 INFO L87 Difference]: Start difference. First operand 348 states and 401 transitions. Second operand 13 states. [2018-02-02 20:45:21,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:21,096 INFO L93 Difference]: Finished difference Result 365 states and 409 transitions. [2018-02-02 20:45:21,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:45:21,096 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2018-02-02 20:45:21,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:21,097 INFO L225 Difference]: With dead ends: 365 [2018-02-02 20:45:21,097 INFO L226 Difference]: Without dead ends: 365 [2018-02-02 20:45:21,097 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:45:21,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-02-02 20:45:21,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 322. [2018-02-02 20:45:21,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-02-02 20:45:21,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 365 transitions. [2018-02-02 20:45:21,099 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 365 transitions. Word has length 60 [2018-02-02 20:45:21,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:21,100 INFO L432 AbstractCegarLoop]: Abstraction has 322 states and 365 transitions. [2018-02-02 20:45:21,100 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:45:21,100 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 365 transitions. [2018-02-02 20:45:21,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:45:21,100 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:21,100 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:21,100 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:21,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1177929171, now seen corresponding path program 1 times [2018-02-02 20:45:21,101 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:21,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:21,306 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:21,306 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:21,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:45:21,306 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:21,307 INFO 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 20:45:21,307 INFO L182 omatonBuilderFactory]: Interpolants [22220#true, 22221#false, 22222#(= (select |#valid| main_~head~0.base) 1), 22223#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 22224#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 22225#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 22226#(and (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 22227#(and (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.offset|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 22228#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 22229#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 22230#(and (= main_~head~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))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~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))))), 22231#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 22232#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 22233#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)), 22234#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 22235#(and (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem16.offset| 0) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 22236#(and (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 22237#(and (<= 0 |main_#t~mem18.offset|) (<= (+ |main_#t~mem18.offset| 12) (select |#length| |main_#t~mem18.base|)))] [2018-02-02 20:45:21,307 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:21,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:45:21,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:45:21,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:45:21,307 INFO L87 Difference]: Start difference. First operand 322 states and 365 transitions. Second operand 18 states. [2018-02-02 20:45:21,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:21,911 INFO L93 Difference]: Finished difference Result 363 states and 407 transitions. [2018-02-02 20:45:21,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:45:21,911 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2018-02-02 20:45:21,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:21,912 INFO L225 Difference]: With dead ends: 363 [2018-02-02 20:45:21,912 INFO L226 Difference]: Without dead ends: 363 [2018-02-02 20:45:21,913 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=893, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:45:21,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-02-02 20:45:21,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 295. [2018-02-02 20:45:21,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-02-02 20:45:21,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 334 transitions. [2018-02-02 20:45:21,916 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 334 transitions. Word has length 60 [2018-02-02 20:45:21,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:21,916 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 334 transitions. [2018-02-02 20:45:21,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:45:21,917 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 334 transitions. [2018-02-02 20:45:21,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:45:21,917 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:21,917 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:21,918 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:21,918 INFO L82 PathProgramCache]: Analyzing trace with hash -2138142991, now seen corresponding path program 2 times [2018-02-02 20:45:21,918 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:21,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:22,166 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:22,166 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:22,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:45:22,166 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:22,167 INFO 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 20:45:22,167 INFO L182 omatonBuilderFactory]: Interpolants [22944#(= 1 (select |#valid| |main_#t~mem16.base|)), 22926#true, 22927#false, 22928#(= (select |#valid| main_~head~0.base) 1), 22929#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 22930#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 22931#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 22932#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 22933#(and (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1)), 22934#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 22935#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 22936#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| |main_#t~malloc5.base|))), 22937#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~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_~x~0.base) main_~x~0.offset)))), 22938#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))))), 22939#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 22940#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 22941#(= 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)))), 22942#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 22943#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))] [2018-02-02 20:45:22,167 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:22,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:45:22,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:45:22,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:45:22,167 INFO L87 Difference]: Start difference. First operand 295 states and 334 transitions. Second operand 19 states. [2018-02-02 20:45:22,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:22,893 INFO L93 Difference]: Finished difference Result 400 states and 452 transitions. [2018-02-02 20:45:22,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:45:22,893 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-02-02 20:45:22,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:22,894 INFO L225 Difference]: With dead ends: 400 [2018-02-02 20:45:22,894 INFO L226 Difference]: Without dead ends: 400 [2018-02-02 20:45:22,894 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=251, Invalid=1309, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 20:45:22,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-02-02 20:45:22,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 295. [2018-02-02 20:45:22,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-02-02 20:45:22,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 333 transitions. [2018-02-02 20:45:22,897 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 333 transitions. Word has length 60 [2018-02-02 20:45:22,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:22,897 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 333 transitions. [2018-02-02 20:45:22,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:45:22,897 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 333 transitions. [2018-02-02 20:45:22,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:45:22,897 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:22,897 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:22,897 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:22,898 INFO L82 PathProgramCache]: Analyzing trace with hash -2138142990, now seen corresponding path program 2 times [2018-02-02 20:45:22,898 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:22,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:23,191 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:23,192 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:23,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:45:23,192 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:23,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:23,192 INFO L182 omatonBuilderFactory]: Interpolants [23682#true, 23683#false, 23684#(= (select |#valid| main_~head~0.base) 1), 23685#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 23686#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 23687#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 23688#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 23689#(and (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1)), 23690#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 23691#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 23692#(and (= 0 |main_#t~malloc5.offset|) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| |main_#t~malloc5.base|))), 23693#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~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_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 23694#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))))), 23695#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|))), 23696#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 23697#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 23698#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 23699#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 23700#(and (= |main_#t~mem16.offset| 0) (= (select |#length| |main_#t~mem16.base|) 12))] [2018-02-02 20:45:23,192 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:23,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:45:23,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:45:23,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:45:23,193 INFO L87 Difference]: Start difference. First operand 295 states and 333 transitions. Second operand 19 states. [2018-02-02 20:45:23,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:23,888 INFO L93 Difference]: Finished difference Result 350 states and 388 transitions. [2018-02-02 20:45:23,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:45:23,889 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-02-02 20:45:23,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:23,889 INFO L225 Difference]: With dead ends: 350 [2018-02-02 20:45:23,889 INFO L226 Difference]: Without dead ends: 350 [2018-02-02 20:45:23,890 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:45:23,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-02-02 20:45:23,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 295. [2018-02-02 20:45:23,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-02-02 20:45:23,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 332 transitions. [2018-02-02 20:45:23,892 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 332 transitions. Word has length 60 [2018-02-02 20:45:23,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:23,892 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 332 transitions. [2018-02-02 20:45:23,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:45:23,892 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 332 transitions. [2018-02-02 20:45:23,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:45:23,892 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:23,892 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:23,892 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:23,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1814893080, now seen corresponding path program 1 times [2018-02-02 20:45:23,893 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:23,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:24,263 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:45:24,263 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:24,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:45:24,264 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:24,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:24,264 INFO L182 omatonBuilderFactory]: Interpolants [24384#(and (not (= 0 |main_#t~mem17|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 24385#(and (not |main_#t~short21|) (= main_~head~0.offset 0)), 24372#true, 24373#false, 24374#(= 0 |main_#t~malloc0.offset|), 24375#(= main_~head~0.offset 0), 24376#(and (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 24377#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))), 24378#(and (= main_~head~0.base |main_#t~mem14.base|) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) |main_#t~mem14.offset|)) (= main_~head~0.offset |main_#t~mem14.offset|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 24379#(and (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.base main_~x~0.base) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~x~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 24380#(and (= |main_#t~mem15| (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~x~0.offset))) (= main_~head~0.base main_~x~0.base) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 24381#(and (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.base main_~x~0.base) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~x~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 24382#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem22.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem22.base|) (not (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) |main_#t~mem22.offset|)) (+ main_~head~0.offset 8)))) (= main_~head~0.base |main_#t~mem22.base|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 24383#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset |main_#t~mem16.offset|) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (not (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~x~0.offset)) (+ |main_#t~mem16.offset| 8)))))] [2018-02-02 20:45:24,264 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:45:24,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:45:24,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:45:24,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:45:24,264 INFO L87 Difference]: Start difference. First operand 295 states and 332 transitions. Second operand 14 states. [2018-02-02 20:45:24,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:24,573 INFO L93 Difference]: Finished difference Result 350 states and 387 transitions. [2018-02-02 20:45:24,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:45:24,573 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2018-02-02 20:45:24,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:24,574 INFO L225 Difference]: With dead ends: 350 [2018-02-02 20:45:24,574 INFO L226 Difference]: Without dead ends: 350 [2018-02-02 20:45:24,575 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:45:24,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-02-02 20:45:24,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 342. [2018-02-02 20:45:24,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-02-02 20:45:24,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 387 transitions. [2018-02-02 20:45:24,577 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 387 transitions. Word has length 61 [2018-02-02 20:45:24,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:24,577 INFO L432 AbstractCegarLoop]: Abstraction has 342 states and 387 transitions. [2018-02-02 20:45:24,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:45:24,577 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 387 transitions. [2018-02-02 20:45:24,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:45:24,577 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:24,578 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:24,578 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:24,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1858382925, now seen corresponding path program 2 times [2018-02-02 20:45:24,578 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:24,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:24,630 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 20:45:24,630 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:45:24,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:45:24,630 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:24,630 INFO 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 20:45:24,630 INFO L182 omatonBuilderFactory]: Interpolants [25104#(and (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem14.base|)), 25105#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 25106#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (<= 0 (+ (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 8))), 25107#(and (<= 0 (+ |main_#t~mem23.offset| 8)) (<= (+ |main_#t~mem23.offset| 12) (select |#length| |main_#t~mem23.base|))), 25108#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (<= 0 (+ main_~x~0.offset 8))), 25102#true, 25103#false] [2018-02-02 20:45:24,630 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 20:45:24,631 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:45:24,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:45:24,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:45:24,631 INFO L87 Difference]: Start difference. First operand 342 states and 387 transitions. Second operand 7 states. [2018-02-02 20:45:24,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:24,781 INFO L93 Difference]: Finished difference Result 371 states and 414 transitions. [2018-02-02 20:45:24,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:45:24,781 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2018-02-02 20:45:24,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:24,782 INFO L225 Difference]: With dead ends: 371 [2018-02-02 20:45:24,782 INFO L226 Difference]: Without dead ends: 371 [2018-02-02 20:45:24,782 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:45:24,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-02-02 20:45:24,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 341. [2018-02-02 20:45:24,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-02-02 20:45:24,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 383 transitions. [2018-02-02 20:45:24,784 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 383 transitions. Word has length 61 [2018-02-02 20:45:24,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:24,784 INFO L432 AbstractCegarLoop]: Abstraction has 341 states and 383 transitions. [2018-02-02 20:45:24,784 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:45:24,784 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 383 transitions. [2018-02-02 20:45:24,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 20:45:24,785 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:24,785 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:24,785 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:24,785 INFO L82 PathProgramCache]: Analyzing trace with hash -155678997, now seen corresponding path program 1 times [2018-02-02 20:45:24,785 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:24,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:25,127 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 20:45:25,127 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:25,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:45:25,127 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:25,127 INFO 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 20:45:25,127 INFO L182 omatonBuilderFactory]: Interpolants [25831#true, 25832#false, 25833#(= 1 (select |#valid| main_~head~0.base)), 25834#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 25835#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 25836#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 25837#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset)))), 25838#(and (= 0 |main_#t~mem9.offset|) (= |main_#t~mem9.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)))), 25839#(and (= main_~x~0.offset 0) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 25840#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 25841#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 25842#(and (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 25843#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 25844#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (or (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 25845#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (or (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 25846#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (or (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 25847#(and (or (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (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))))), 25848#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))) (or (not (= 0 |main_#t~mem23.offset|)) (not (= 0 |main_#t~mem23.base|))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) 0) |main_#t~mem23.base|))), 25849#(and (or (not (= 0 main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (or (not (= 0 main_~x~0.offset)) (not (= 0 main_~x~0.base)))), 25850#(and (or (not (= 0 main_~head~0.offset)) (= 1 (select (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base)))), 25851#(and (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (or (not (= 0 main_~head~0.offset)) (= 1 (select (store |#valid| main_~head~0.base 0) |main_#t~mem25.base|)))), 25852#(and (or (not (= 0 main_~head~0.offset)) (= 1 (select (store |#valid| main_~head~0.base 0) main_~x~0.base))) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base)))), 25853#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 20:45:25,128 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 20:45:25,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:45:25,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:45:25,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:45:25,128 INFO L87 Difference]: Start difference. First operand 341 states and 383 transitions. Second operand 23 states. [2018-02-02 20:45:25,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:25,845 INFO L93 Difference]: Finished difference Result 357 states and 394 transitions. [2018-02-02 20:45:25,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:45:25,845 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 62 [2018-02-02 20:45:25,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:25,846 INFO L225 Difference]: With dead ends: 357 [2018-02-02 20:45:25,846 INFO L226 Difference]: Without dead ends: 357 [2018-02-02 20:45:25,846 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=275, Invalid=1887, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 20:45:25,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-02-02 20:45:25,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 343. [2018-02-02 20:45:25,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-02-02 20:45:25,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 386 transitions. [2018-02-02 20:45:25,848 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 386 transitions. Word has length 62 [2018-02-02 20:45:25,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:25,848 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 386 transitions. [2018-02-02 20:45:25,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:45:25,849 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 386 transitions. [2018-02-02 20:45:25,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 20:45:25,849 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:25,849 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:25,849 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:25,849 INFO L82 PathProgramCache]: Analyzing trace with hash -155678996, now seen corresponding path program 1 times [2018-02-02 20:45:25,850 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:25,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:26,251 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 20:45:26,252 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:26,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:45:26,252 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:26,252 INFO 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 20:45:26,252 INFO L182 omatonBuilderFactory]: Interpolants [26624#(and (or (not (= 0 main_~head~0.offset)) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 26625#(and (or (not (= 0 main_~head~0.offset)) (<= 0 |main_#t~mem25.offset|)) (<= (+ |main_#t~mem25.offset| 12) (select |#length| |main_#t~mem25.base|))), 26626#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (or (not (= 0 main_~head~0.offset)) (<= 0 main_~x~0.offset))), 26627#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset)), 26602#true, 26603#false, 26604#(= 0 |main_#t~malloc0.offset|), 26605#(= 0 main_~head~0.offset), 26606#(and (= 0 main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1)), 26607#(and (= 0 main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 26608#(and (= 0 |main_#t~malloc5.offset|) (= 0 main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 26609#(and (= 0 main_~head~0.offset) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 26610#(and (= 0 main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 26611#(and (= 0 main_~head~0.offset) (= 0 |main_#t~mem9.offset|) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem9.base|))), 26612#(and (= 0 main_~head~0.offset) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 26613#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 26614#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)), 26615#(and (= 0 (select (select |#memory_$Pointer$.offset| (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_#t~mem14.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem14.base|)), 26616#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.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_~head~0.base) main_~head~0.offset)) 0))), 26617#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (or (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (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)) 0))) (= |main_#t~mem16.offset| 0))), 26618#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (or (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (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)) 0))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 26619#(and (or (<= 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 (= (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)) 0)))) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 12) (select |#length| |main_#t~mem22.base|)) (= |main_#t~mem22.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)))), 26620#(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)) 12) (select |#length| main_~x~0.base)) (or (<= 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 (= (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)) 0)))) (= main_~x~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)))), 26621#(and (or (<= 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 (= (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)) 0)))) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 12) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 26622#(and (or (not (= (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|) (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) 0))) (<= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|))) (<= (+ (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|) 12) (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)))), 26623#(and (or (not (= 0 main_~x~0.offset)) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))] [2018-02-02 20:45:26,252 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 20:45:26,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:45:26,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:45:26,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:45:26,253 INFO L87 Difference]: Start difference. First operand 343 states and 386 transitions. Second operand 26 states. [2018-02-02 20:45:27,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:27,367 INFO L93 Difference]: Finished difference Result 364 states and 400 transitions. [2018-02-02 20:45:27,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 20:45:27,367 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 62 [2018-02-02 20:45:27,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:27,368 INFO L225 Difference]: With dead ends: 364 [2018-02-02 20:45:27,368 INFO L226 Difference]: Without dead ends: 364 [2018-02-02 20:45:27,368 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=415, Invalid=2665, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 20:45:27,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-02-02 20:45:27,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 345. [2018-02-02 20:45:27,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-02-02 20:45:27,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 388 transitions. [2018-02-02 20:45:27,370 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 388 transitions. Word has length 62 [2018-02-02 20:45:27,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:27,370 INFO L432 AbstractCegarLoop]: Abstraction has 345 states and 388 transitions. [2018-02-02 20:45:27,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:45:27,370 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 388 transitions. [2018-02-02 20:45:27,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 20:45:27,371 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:27,371 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:45:27,371 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:27,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1159716169, now seen corresponding path program 2 times [2018-02-02 20:45:27,371 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:27,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:27,631 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:27,631 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:27,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:45:27,631 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:27,632 INFO 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 20:45:27,632 INFO L182 omatonBuilderFactory]: Interpolants [27397#true, 27398#false, 27399#(= (select |#valid| main_~head~0.base) 1), 27400#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 27401#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 27402#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 27403#(and (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 27404#(and (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.offset|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 27405#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 27406#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 27407#(and (= main_~head~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))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~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))))), 27408#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 27409#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 27410#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)), 27411#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 27412#(and (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem16.offset| 0) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 27413#(and (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 27414#(and (<= 0 |main_#t~mem22.offset|) (<= (+ |main_#t~mem22.offset| 12) (select |#length| |main_#t~mem22.base|))), 27415#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset))] [2018-02-02 20:45:27,632 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:27,632 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:45:27,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:45:27,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:45:27,632 INFO L87 Difference]: Start difference. First operand 345 states and 388 transitions. Second operand 19 states. [2018-02-02 20:45:28,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:28,335 INFO L93 Difference]: Finished difference Result 379 states and 418 transitions. [2018-02-02 20:45:28,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:45:28,335 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 63 [2018-02-02 20:45:28,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:28,336 INFO L225 Difference]: With dead ends: 379 [2018-02-02 20:45:28,336 INFO L226 Difference]: Without dead ends: 379 [2018-02-02 20:45:28,336 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=1140, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:45:28,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-02-02 20:45:28,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 361. [2018-02-02 20:45:28,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-02-02 20:45:28,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 409 transitions. [2018-02-02 20:45:28,338 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 409 transitions. Word has length 63 [2018-02-02 20:45:28,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:28,338 INFO L432 AbstractCegarLoop]: Abstraction has 361 states and 409 transitions. [2018-02-02 20:45:28,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:45:28,338 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 409 transitions. [2018-02-02 20:45:28,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 20:45:28,339 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:28,339 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:28,339 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:28,339 INFO L82 PathProgramCache]: Analyzing trace with hash 800408127, now seen corresponding path program 2 times [2018-02-02 20:45:28,339 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:28,348 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:28,738 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:28,738 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:28,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:45:28,738 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:28,738 INFO 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 20:45:28,739 INFO L182 omatonBuilderFactory]: Interpolants [28192#true, 28193#false, 28194#(= (select |#valid| main_~head~0.base) 1), 28195#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 28196#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 28197#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 28198#(and (= 12 (select |#length| |main_#t~mem7.base|)) (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 28199#(and (= 12 (select |#length| |main_#t~mem9.base|)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 28200#(and (= 12 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 28201#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 28202#(and (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset))), 28203#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 28204#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem7.base|))), 28205#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 28206#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 28207#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)))), 28208#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 28209#(and (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 28210#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~x~0.offset 0)), 28211#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 28212#(and (<= 0 |main_#t~mem23.offset|) (= 12 (select |#length| |main_#t~mem23.base|))), 28213#(and (<= 0 main_~x~0.offset) (= (select |#length| main_~x~0.base) 12)), 28214#(and (<= main_~x~0.offset 0) (<= 0 main_~x~0.offset))] [2018-02-02 20:45:28,739 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:28,739 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:45:28,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:45:28,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:45:28,739 INFO L87 Difference]: Start difference. First operand 361 states and 409 transitions. Second operand 23 states. [2018-02-02 20:45:29,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:29,621 INFO L93 Difference]: Finished difference Result 414 states and 464 transitions. [2018-02-02 20:45:29,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:45:29,621 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 63 [2018-02-02 20:45:29,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:29,622 INFO L225 Difference]: With dead ends: 414 [2018-02-02 20:45:29,622 INFO L226 Difference]: Without dead ends: 414 [2018-02-02 20:45:29,622 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=359, Invalid=1533, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:45:29,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-02-02 20:45:29,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 383. [2018-02-02 20:45:29,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-02-02 20:45:29,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 441 transitions. [2018-02-02 20:45:29,624 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 441 transitions. Word has length 63 [2018-02-02 20:45:29,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:29,625 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 441 transitions. [2018-02-02 20:45:29,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:45:29,625 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 441 transitions. [2018-02-02 20:45:29,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 20:45:29,625 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:29,625 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:29,625 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:29,625 INFO L82 PathProgramCache]: Analyzing trace with hash 716344120, now seen corresponding path program 1 times [2018-02-02 20:45:29,626 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:29,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:30,052 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:30,053 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:30,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:45:30,053 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:30,053 INFO 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 20:45:30,053 INFO L182 omatonBuilderFactory]: Interpolants [29056#(= 0 |main_#t~malloc0.offset|), 29057#(= 0 main_~head~0.offset), 29058#(and (= 0 main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1)), 29059#(and (= 0 main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 29060#(and (= 0 |main_#t~malloc5.offset|) (= 0 main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 29061#(and (= 0 main_~head~0.offset) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 29062#(and (= 0 main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 29063#(and (= 0 main_~head~0.offset) (= 0 |main_#t~mem9.offset|) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem9.base|))), 29064#(and (= 0 main_~head~0.offset) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 29065#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 29066#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)), 29067#(and (= 0 (select (select |#memory_$Pointer$.offset| (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_#t~mem14.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem14.base|)), 29068#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.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_~head~0.base) main_~head~0.offset)) 0))), 29069#(and (or (not (= |main_#t~mem16.offset| 0)) (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (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)) 0)))) (= |main_#t~mem16.offset| 0))), 29070#(or (and (<= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (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)) 0))))), 29071#(or (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)) 0) (<= 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 (= (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)) 0)))), 29072#(or (and (<= (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|) 0) (<= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|) (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) 0)))), 29073#(or (not (= 0 main_~x~0.offset)) (and (<= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 29074#(or (not (= 0 main_~head~0.offset)) (and (<= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 29075#(or (not (= 0 main_~head~0.offset)) (and (<= 0 |main_#t~mem25.offset|) (<= |main_#t~mem25.offset| 0))), 29076#(or (and (<= main_~x~0.offset 0) (<= 0 main_~x~0.offset)) (not (= 0 main_~head~0.offset))), 29077#(and (<= main_~x~0.offset 0) (<= 0 main_~x~0.offset)), 29054#true, 29055#false] [2018-02-02 20:45:30,053 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:30,053 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:45:30,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:45:30,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:45:30,053 INFO L87 Difference]: Start difference. First operand 383 states and 441 transitions. Second operand 24 states. [2018-02-02 20:45:30,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:30,798 INFO L93 Difference]: Finished difference Result 397 states and 449 transitions. [2018-02-02 20:45:30,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:45:30,798 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 64 [2018-02-02 20:45:30,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:30,799 INFO L225 Difference]: With dead ends: 397 [2018-02-02 20:45:30,799 INFO L226 Difference]: Without dead ends: 397 [2018-02-02 20:45:30,799 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=399, Invalid=1857, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 20:45:30,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-02-02 20:45:30,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 386. [2018-02-02 20:45:30,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-02-02 20:45:30,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 444 transitions. [2018-02-02 20:45:30,801 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 444 transitions. Word has length 64 [2018-02-02 20:45:30,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:30,801 INFO L432 AbstractCegarLoop]: Abstraction has 386 states and 444 transitions. [2018-02-02 20:45:30,802 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:45:30,802 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 444 transitions. [2018-02-02 20:45:30,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 20:45:30,802 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:30,802 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:30,802 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:30,802 INFO L82 PathProgramCache]: Analyzing trace with hash 393069440, now seen corresponding path program 2 times [2018-02-02 20:45:30,803 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:30,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:31,414 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:31,414 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:31,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 20:45:31,415 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:31,415 INFO 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 20:45:31,415 INFO L182 omatonBuilderFactory]: Interpolants [29909#true, 29910#false, 29911#(= 0 |main_#t~malloc0.offset|), 29912#(= main_~head~0.offset 0), 29913#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 29914#(and (= main_~head~0.offset main_~x~0.offset) (= 1 main_~state~0) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 29915#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= 1 main_~state~0) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 29916#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= 1 main_~state~0) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0)), 29917#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= 1 main_~state~0) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0)), 29918#(and (= 0 |main_#t~mem9.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 1 main_~state~0) (= main_~head~0.offset 0)), 29919#(and (= 1 (select |#valid| main_~head~0.base)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (or (= 1 main_~state~0) (not (= main_~head~0.offset main_~x~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 29920#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= 1 main_~state~0) (not (= main_~x~0.base main_~head~0.base)) (<= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 29921#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= 1 (select |#valid| main_~head~0.base)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (not (= main_~x~0.base main_~head~0.base)) (<= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 29922#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc5.base| main_~head~0.base)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (<= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 29923#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (< main_~x~0.offset (+ main_~head~0.offset 1)) (<= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 29924#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem7.base|)) (<= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 29925#(and (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8))) (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|)) (= main_~head~0.offset 0)), 29926#(and (= 1 (select (select |#memory_int| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 29927#(and (not (= main_~x~0.base main_~head~0.base)) (= 1 (select (select (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8) main_~state~0)) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8))) (= main_~head~0.offset 0)), 29928#(and (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8))) (= main_~head~0.offset 0)), 29929#(and (= 1 (select (select |#memory_int| |main_#t~mem14.base|) (+ main_~head~0.offset 8))) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 29930#(or (not (= 1 (select |#valid| main_~x~0.base))) (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~head~0.offset 8))) (= main_~head~0.offset 0))), 29931#(and (not (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8)))) (= main_~head~0.offset 0)), 29932#(not (= 0 (select (select |#memory_int| |main_#t~mem23.base|) (+ 0 8)))), 29933#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0)), 29934#(or (<= 1 main_~x~0.offset) (not (= 0 |main_#t~mem24|)) (<= (+ main_~x~0.offset 1) 0)), 29935#(or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0))] [2018-02-02 20:45:31,415 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:31,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 20:45:31,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 20:45:31,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:45:31,415 INFO L87 Difference]: Start difference. First operand 386 states and 444 transitions. Second operand 27 states. [2018-02-02 20:45:32,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:32,571 INFO L93 Difference]: Finished difference Result 537 states and 618 transitions. [2018-02-02 20:45:32,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 20:45:32,571 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 65 [2018-02-02 20:45:32,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:32,572 INFO L225 Difference]: With dead ends: 537 [2018-02-02 20:45:32,572 INFO L226 Difference]: Without dead ends: 536 [2018-02-02 20:45:32,573 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=550, Invalid=2756, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 20:45:32,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-02-02 20:45:32,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 435. [2018-02-02 20:45:32,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-02-02 20:45:32,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 506 transitions. [2018-02-02 20:45:32,575 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 506 transitions. Word has length 65 [2018-02-02 20:45:32,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:32,575 INFO L432 AbstractCegarLoop]: Abstraction has 435 states and 506 transitions. [2018-02-02 20:45:32,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 20:45:32,575 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 506 transitions. [2018-02-02 20:45:32,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 20:45:32,576 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:32,576 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:32,576 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:32,576 INFO L82 PathProgramCache]: Analyzing trace with hash 393119092, now seen corresponding path program 1 times [2018-02-02 20:45:32,576 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:32,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:32,847 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:32,848 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:32,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:45:32,848 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:32,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:32,848 INFO L182 omatonBuilderFactory]: Interpolants [30976#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base)), 30977#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 30978#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.offset 0) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 30979#(and (= 0 main_~head~0.offset) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 30980#(and (= 0 main_~head~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 30981#(and (= 0 main_~head~0.offset) (not (= main_~head~0.base |main_#t~malloc5.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset))), 30982#(and (= 0 main_~head~0.offset) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 30983#(and (= 0 main_~head~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))), 30984#(and (= 0 main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 30985#(or (<= (+ main_~x~0.offset 1) 0) (and (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset) main_~head~0.offset))) (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)))), 30986#(or (and (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)) (and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 30987#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 30988#(= 0 |main_#t~mem23.offset|), 30989#(= 0 main_~x~0.offset), 30970#true, 30971#false, 30972#(= 0 |main_#t~malloc0.offset|), 30973#(= 0 main_~head~0.offset), 30974#(and (= 0 main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1)), 30975#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))] [2018-02-02 20:45:32,848 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:32,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:45:32,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:45:32,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:45:32,848 INFO L87 Difference]: Start difference. First operand 435 states and 506 transitions. Second operand 20 states. [2018-02-02 20:45:33,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:33,348 INFO L93 Difference]: Finished difference Result 445 states and 516 transitions. [2018-02-02 20:45:33,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:45:33,348 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 65 [2018-02-02 20:45:33,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:33,349 INFO L225 Difference]: With dead ends: 445 [2018-02-02 20:45:33,349 INFO L226 Difference]: Without dead ends: 445 [2018-02-02 20:45:33,350 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=371, Invalid=1035, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:45:33,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-02-02 20:45:33,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 433. [2018-02-02 20:45:33,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-02-02 20:45:33,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 505 transitions. [2018-02-02 20:45:33,352 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 505 transitions. Word has length 65 [2018-02-02 20:45:33,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:33,352 INFO L432 AbstractCegarLoop]: Abstraction has 433 states and 505 transitions. [2018-02-02 20:45:33,352 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:45:33,352 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 505 transitions. [2018-02-02 20:45:33,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 20:45:33,352 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:33,353 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:33,353 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:33,353 INFO L82 PathProgramCache]: Analyzing trace with hash -225989480, now seen corresponding path program 2 times [2018-02-02 20:45:33,353 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:33,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:33,432 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 20:45:33,432 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:45:33,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:45:33,432 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:33,433 INFO 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 20:45:33,433 INFO L182 omatonBuilderFactory]: Interpolants [31904#true, 31905#false, 31906#(and (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 31907#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 31908#(and (<= 0 (+ |main_#t~mem18.offset| 8)) (<= (+ |main_#t~mem18.offset| 12) (select |#length| |main_#t~mem18.base|)))] [2018-02-02 20:45:33,433 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 20:45:33,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:45:33,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:45:33,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:45:33,434 INFO L87 Difference]: Start difference. First operand 433 states and 505 transitions. Second operand 5 states. [2018-02-02 20:45:33,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:33,538 INFO L93 Difference]: Finished difference Result 441 states and 506 transitions. [2018-02-02 20:45:33,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:45:33,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-02-02 20:45:33,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:33,539 INFO L225 Difference]: With dead ends: 441 [2018-02-02 20:45:33,539 INFO L226 Difference]: Without dead ends: 441 [2018-02-02 20:45:33,539 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:45:33,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-02-02 20:45:33,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 432. [2018-02-02 20:45:33,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-02-02 20:45:33,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 497 transitions. [2018-02-02 20:45:33,544 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 497 transitions. Word has length 65 [2018-02-02 20:45:33,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:33,544 INFO L432 AbstractCegarLoop]: Abstraction has 432 states and 497 transitions. [2018-02-02 20:45:33,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:45:33,544 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 497 transitions. [2018-02-02 20:45:33,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 20:45:33,545 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:33,545 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:33,545 INFO L371 AbstractCegarLoop]: === Iteration 63 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:33,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1211937337, now seen corresponding path program 1 times [2018-02-02 20:45:33,546 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:33,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:34,260 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:45:34,260 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:34,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:45:34,260 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:34,261 INFO 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 20:45:34,261 INFO L182 omatonBuilderFactory]: Interpolants [32800#(and (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= |old(#valid)| (store (store |#valid| (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)) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 32801#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |old(#valid)| (store (store |#valid| (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)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 32802#(and (= |old(#valid)| (store (store |#valid| (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)) (or (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 32803#(and (= (store (store |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) 0) 0) |main_#t~mem23.base| 0) |old(#valid)|) (or (not (= 0 |main_#t~mem23.offset|)) (not (= 0 |main_#t~mem23.base|))) (not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) 0))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) 0) |main_#t~mem23.base|))), 32804#(or (not (= 0 main_~x~0.offset)) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 main_~x~0.base)) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) main_~x~0.base 0) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))), 32805#(or (not (= 0 main_~head~0.offset)) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (not (= 0 main_~head~0.base)) (= (store (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) |old(#valid)|))), 32806#(or (not (= 0 main_~head~0.offset)) (and (= |old(#valid)| (store (store |#valid| main_~head~0.base 0) |main_#t~mem25.base| 0)) (not (= 0 |main_#t~mem25.base|)) (not (= 0 main_~head~0.base)) (not (= |main_#t~mem25.base| main_~head~0.base)))), 32807#(or (not (= 0 main_~head~0.offset)) (and (not (= main_~head~0.base main_~x~0.base)) (not (= 0 main_~x~0.base)) (= (store (store |#valid| main_~head~0.base 0) main_~x~0.base 0) |old(#valid)|) (not (= 0 main_~head~0.base)))), 32808#(and (not (= 0 main_~x~0.base)) (= (store |#valid| main_~x~0.base 0) |old(#valid)|)), 32786#true, 32787#false, 32788#(= |#valid| |old(#valid)|), 32789#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|))), 32790#(and (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|)), 32791#(and (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|)), 32792#(and (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 32793#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (= (store (store |#valid| main_~head~0.base 0) |main_#t~malloc5.base| 0) |old(#valid)|) (= main_~x~0.base main_~head~0.base)), 32794#(and (= (store (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) 0) |old(#valid)|) (= main_~x~0.offset main_~head~0.offset) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 32795#(and (= (store (store |#valid| main_~head~0.base 0) (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset) 0) |old(#valid)|) (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset)))), 32796#(and (= 0 |main_#t~mem9.offset|) (= |main_#t~mem9.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 |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) |old(#valid)|)), 32797#(and (= main_~x~0.offset 0) (not (= 0 main_~head~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (= (store (store |#valid| main_~head~0.base 0) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) 0) |old(#valid)|) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 32798#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= |old(#valid)| (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 32799#(and (= |old(#valid)| (store (store |#valid| (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)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))))] [2018-02-02 20:45:34,261 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:45:34,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:45:34,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:45:34,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:45:34,262 INFO L87 Difference]: Start difference. First operand 432 states and 497 transitions. Second operand 23 states. [2018-02-02 20:45:35,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:35,590 INFO L93 Difference]: Finished difference Result 465 states and 519 transitions. [2018-02-02 20:45:35,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 20:45:35,590 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2018-02-02 20:45:35,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:35,591 INFO L225 Difference]: With dead ends: 465 [2018-02-02 20:45:35,591 INFO L226 Difference]: Without dead ends: 462 [2018-02-02 20:45:35,592 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=188, Invalid=1792, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 20:45:35,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-02-02 20:45:35,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 432. [2018-02-02 20:45:35,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-02-02 20:45:35,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 497 transitions. [2018-02-02 20:45:35,594 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 497 transitions. Word has length 66 [2018-02-02 20:45:35,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:35,595 INFO L432 AbstractCegarLoop]: Abstraction has 432 states and 497 transitions. [2018-02-02 20:45:35,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:45:35,595 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 497 transitions. [2018-02-02 20:45:35,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 20:45:35,595 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:35,595 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] [2018-02-02 20:45:35,595 INFO L371 AbstractCegarLoop]: === Iteration 64 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:35,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1985914828, now seen corresponding path program 1 times [2018-02-02 20:45:35,596 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:35,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:36,350 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:36,351 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:36,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 20:45:36,351 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:36,351 INFO 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 20:45:36,352 INFO L182 omatonBuilderFactory]: Interpolants [33750#true, 33751#false, 33752#(= 0 |main_#t~malloc0.offset|), 33753#(= main_~head~0.offset 0), 33754#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 33755#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 33756#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 33757#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0)), 33758#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 33759#(and (= 0 |main_#t~mem9.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= main_~head~0.offset 0)), 33760#(and (= main_~head~0.offset main_~x~0.offset) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 33761#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 33762#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset main_~x~0.offset) (not (= main_~state~0 0)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 33763#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~state~0 0)) (not (= main_~x~0.base main_~head~0.base)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) main_~state~0) (= main_~head~0.offset 0)), 33764#(and (not (= main_~head~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~state~0 0)) (= main_~head~0.offset main_~x~0.offset) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) main_~state~0) (= main_~head~0.offset 0) (not (= |main_#t~malloc5.base| main_~x~0.base))), 33765#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (not (= main_~state~0 0)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) main_~state~0) (= main_~head~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 33766#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (not (= main_~state~0 0)) (= main_~head~0.offset main_~x~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) main_~state~0) (not (= main_~x~0.base |main_#t~mem7.base|)) (= main_~head~0.offset 0)), 33767#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8)) main_~state~0) (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= main_~state~0 0)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|)) (= main_~head~0.offset 0)), 33768#(and (not (= main_~state~0 0)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= (select (select |#memory_int| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8)) main_~state~0)), 33769#(and (not (= main_~state~0 0)) (= (select (select (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8) main_~state~0)) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8)) main_~state~0) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 33770#(and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8)) 0)) (= main_~head~0.offset 0)), 33771#(and (not (= (select (select |#memory_int| |main_#t~mem14.base|) (+ main_~head~0.offset 8)) 0)) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 33772#(and (or (not (= 1 (select |#valid| main_~x~0.base))) (and (not (= (select (select |#memory_int| main_~x~0.base) (+ main_~head~0.offset 8)) 0)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (= main_~head~0.offset 0)), 33773#(not (= (select (select |#memory_int| |main_#t~mem23.base|) (+ 0 8)) 0)), 33774#(or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0) (not (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0))), 33775#(or (not (= |main_#t~mem24| 0)) (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0)), 33776#(or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0))] [2018-02-02 20:45:36,352 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:36,352 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 20:45:36,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 20:45:36,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:45:36,352 INFO L87 Difference]: Start difference. First operand 432 states and 497 transitions. Second operand 27 states. [2018-02-02 20:45:37,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:37,582 INFO L93 Difference]: Finished difference Result 569 states and 653 transitions. [2018-02-02 20:45:37,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 20:45:37,582 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 66 [2018-02-02 20:45:37,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:37,584 INFO L225 Difference]: With dead ends: 569 [2018-02-02 20:45:37,584 INFO L226 Difference]: Without dead ends: 568 [2018-02-02 20:45:37,584 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=559, Invalid=2747, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 20:45:37,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-02-02 20:45:37,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 425. [2018-02-02 20:45:37,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-02 20:45:37,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 489 transitions. [2018-02-02 20:45:37,588 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 489 transitions. Word has length 66 [2018-02-02 20:45:37,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:37,588 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 489 transitions. [2018-02-02 20:45:37,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 20:45:37,588 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 489 transitions. [2018-02-02 20:45:37,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 20:45:37,589 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:37,589 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:37,589 INFO L371 AbstractCegarLoop]: === Iteration 65 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:37,589 INFO L82 PathProgramCache]: Analyzing trace with hash -871770321, now seen corresponding path program 2 times [2018-02-02 20:45:37,589 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:37,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:37,878 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:37,879 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:37,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:45:37,879 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:37,879 INFO 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 20:45:37,880 INFO L182 omatonBuilderFactory]: Interpolants [34848#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|))), 34849#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 34850#(= 1 (select |#valid| |main_#t~mem16.base|)), 34833#true, 34834#false, 34835#(= (select |#valid| main_~head~0.base) 1), 34836#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 34837#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 34838#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 34839#(and (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 34840#(and (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.offset|) (not (= main_~head~0.base |main_#t~mem9.base|))), 34841#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 34842#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 34843#(and (= 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))) (= main_~head~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)))), 34844#(and (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)))), 34845#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 34846#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)))), 34847#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))] [2018-02-02 20:45:37,880 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:37,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:45:37,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:45:37,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:45:37,881 INFO L87 Difference]: Start difference. First operand 425 states and 489 transitions. Second operand 18 states. [2018-02-02 20:45:38,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:38,479 INFO L93 Difference]: Finished difference Result 440 states and 496 transitions. [2018-02-02 20:45:38,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:45:38,480 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2018-02-02 20:45:38,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:38,480 INFO L225 Difference]: With dead ends: 440 [2018-02-02 20:45:38,481 INFO L226 Difference]: Without dead ends: 440 [2018-02-02 20:45:38,481 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=1174, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:45:38,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-02-02 20:45:38,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 425. [2018-02-02 20:45:38,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-02 20:45:38,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 488 transitions. [2018-02-02 20:45:38,483 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 488 transitions. Word has length 67 [2018-02-02 20:45:38,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:38,483 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 488 transitions. [2018-02-02 20:45:38,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:45:38,483 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 488 transitions. [2018-02-02 20:45:38,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 20:45:38,484 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:38,484 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:38,484 INFO L371 AbstractCegarLoop]: === Iteration 66 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:38,484 INFO L82 PathProgramCache]: Analyzing trace with hash -871770320, now seen corresponding path program 2 times [2018-02-02 20:45:38,484 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:38,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:38,911 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:38,911 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:38,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:45:38,912 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:38,912 INFO 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 20:45:38,912 INFO L182 omatonBuilderFactory]: Interpolants [35756#true, 35757#false, 35758#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 35759#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base))), 35760#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 35761#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 35762#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~x~0.base)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 35763#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 35764#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 35765#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.offset|) (not (= main_~head~0.base |main_#t~mem9.base|))), 35766#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 35767#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 35768#(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_~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))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= main_~head~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)))), 35769#(and (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 35770#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 35771#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|))))), 35772#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 35773#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)))), 35774#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 35775#(and (= |main_#t~mem16.offset| 0) (= (select |#length| |main_#t~mem16.base|) 12))] [2018-02-02 20:45:38,912 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:38,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:45:38,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:45:38,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:45:38,913 INFO L87 Difference]: Start difference. First operand 425 states and 488 transitions. Second operand 20 states. [2018-02-02 20:45:39,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:39,897 INFO L93 Difference]: Finished difference Result 442 states and 497 transitions. [2018-02-02 20:45:39,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:45:39,897 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2018-02-02 20:45:39,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:39,898 INFO L225 Difference]: With dead ends: 442 [2018-02-02 20:45:39,898 INFO L226 Difference]: Without dead ends: 442 [2018-02-02 20:45:39,898 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=271, Invalid=1211, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 20:45:39,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-02-02 20:45:39,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 425. [2018-02-02 20:45:39,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-02 20:45:39,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 487 transitions. [2018-02-02 20:45:39,901 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 487 transitions. Word has length 67 [2018-02-02 20:45:39,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:39,901 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 487 transitions. [2018-02-02 20:45:39,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:45:39,901 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 487 transitions. [2018-02-02 20:45:39,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 20:45:39,901 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:39,901 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] [2018-02-02 20:45:39,901 INFO L371 AbstractCegarLoop]: === Iteration 67 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:39,902 INFO L82 PathProgramCache]: Analyzing trace with hash -169669994, now seen corresponding path program 1 times [2018-02-02 20:45:39,902 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:39,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:40,375 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:40,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:45:40,375 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:40,375 INFO L182 omatonBuilderFactory]: Interpolants [36681#true, 36682#false, 36683#(= (select |#valid| main_~head~0.base) 1), 36684#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 36685#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= |main_#t~malloc5.offset| 0) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 36686#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 36687#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 36688#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.offset| 0) (= (select |#valid| main_~head~0.base) 1)), 36689#(and (= main_~x~0.offset 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 36690#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 36691#(and (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0)), 36692#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset 0) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 36693#(and (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset 0) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|)) (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset) main_~x~0.base)), 36694#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset 0) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 36695#(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 |main_#t~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 36696#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 0)))), 36697#(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))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 36698#(and (= |main_#t~mem14.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| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (= |main_#t~mem14.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)) 0)))), 36699#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~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) (select (select |#memory_$Pointer$.base| (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)) 0)))), 36700#(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))) (or (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 36701#(and (not (= |main_#t~mem23.base| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) 0))) (or (not (= 0 |main_#t~mem23.offset|)) (not (= 0 |main_#t~mem23.base|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) 0)))), 36702#(and (or (not (= main_~x~0.offset 0)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))) (or (not (= 0 main_~x~0.offset)) (not (= 0 main_~x~0.base)))), 36703#(and (or (= 1 (select (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.offset 0))) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base)))), 36704#(and (or (= 1 (select (store |#valid| main_~head~0.base 0) |main_#t~mem25.base|)) (not (= main_~head~0.offset 0))) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base)))), 36705#(and (or (= 1 (select (store |#valid| main_~head~0.base 0) main_~x~0.base)) (not (= main_~head~0.offset 0))) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base)))), 36706#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 20:45:40,376 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:40,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:45:40,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:45:40,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:45:40,376 INFO L87 Difference]: Start difference. First operand 425 states and 487 transitions. Second operand 26 states. [2018-02-02 20:45:41,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:41,625 INFO L93 Difference]: Finished difference Result 465 states and 521 transitions. [2018-02-02 20:45:41,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 20:45:41,625 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 67 [2018-02-02 20:45:41,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:41,626 INFO L225 Difference]: With dead ends: 465 [2018-02-02 20:45:41,626 INFO L226 Difference]: Without dead ends: 465 [2018-02-02 20:45:41,626 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=402, Invalid=3020, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 20:45:41,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-02-02 20:45:41,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 433. [2018-02-02 20:45:41,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-02-02 20:45:41,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 496 transitions. [2018-02-02 20:45:41,629 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 496 transitions. Word has length 67 [2018-02-02 20:45:41,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:41,629 INFO L432 AbstractCegarLoop]: Abstraction has 433 states and 496 transitions. [2018-02-02 20:45:41,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:45:41,629 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 496 transitions. [2018-02-02 20:45:41,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 20:45:41,629 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:41,630 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] [2018-02-02 20:45:41,630 INFO L371 AbstractCegarLoop]: === Iteration 68 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:41,630 INFO L82 PathProgramCache]: Analyzing trace with hash -169669993, now seen corresponding path program 1 times [2018-02-02 20:45:41,630 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:41,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:42,017 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:42,018 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:42,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:45:42,018 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:42,018 INFO 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 20:45:42,018 INFO L182 omatonBuilderFactory]: Interpolants [37671#true, 37672#false, 37673#(= (select |#valid| main_~head~0.base) 1), 37674#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 37675#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= |main_#t~malloc5.offset| 0) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 37676#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 37677#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 37678#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.offset| 0) (= (select |#valid| main_~head~0.base) 1)), 37679#(and (= main_~x~0.offset 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 37680#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 37681#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= 12 (select |#length| |main_#t~malloc5.base|))), 37682#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) 0))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0))), 37683#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) 0))) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0))), 37684#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 37685#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 0)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 37686#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))), 37687#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) 0)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) 0)))), 37688#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0))), 37689#(and (= main_~x~0.offset main_~head~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0))), 37690#(and (or (= 0 |main_#t~mem25.offset|) (not (= main_~head~0.offset 0))) (or (= 12 (select |#length| |main_#t~mem25.base|)) (not (= main_~head~0.offset 0)))), 37691#(and (or (= main_~x~0.offset 0) (not (= main_~head~0.offset 0))) (or (not (= main_~head~0.offset 0)) (= (select |#length| main_~x~0.base) 12))), 37692#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12))] [2018-02-02 20:45:42,018 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:42,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:45:42,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:45:42,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:45:42,019 INFO L87 Difference]: Start difference. First operand 433 states and 496 transitions. Second operand 22 states. [2018-02-02 20:45:42,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:42,784 INFO L93 Difference]: Finished difference Result 462 states and 517 transitions. [2018-02-02 20:45:42,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:45:42,785 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2018-02-02 20:45:42,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:42,785 INFO L225 Difference]: With dead ends: 462 [2018-02-02 20:45:42,785 INFO L226 Difference]: Without dead ends: 462 [2018-02-02 20:45:42,786 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=177, Invalid=1155, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:45:42,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-02-02 20:45:42,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 435. [2018-02-02 20:45:42,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-02-02 20:45:42,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 498 transitions. [2018-02-02 20:45:42,789 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 498 transitions. Word has length 67 [2018-02-02 20:45:42,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:42,789 INFO L432 AbstractCegarLoop]: Abstraction has 435 states and 498 transitions. [2018-02-02 20:45:42,789 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:45:42,789 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 498 transitions. [2018-02-02 20:45:42,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 20:45:42,789 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:42,789 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:42,789 INFO L371 AbstractCegarLoop]: === Iteration 69 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:42,789 INFO L82 PathProgramCache]: Analyzing trace with hash 783363855, now seen corresponding path program 2 times [2018-02-02 20:45:42,790 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:42,795 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:43,044 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:45:43,044 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:43,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:45:43,044 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:43,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 20:45:43,045 INFO L182 omatonBuilderFactory]: Interpolants [38624#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem14.offset|) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 38625#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 38626#(and (or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.offset |main_#t~mem16.offset|))) (or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) |main_#t~mem16.offset|)) (= main_~head~0.offset |main_#t~mem16.offset|)) (= main_~head~0.offset 0)), 38627#(and (or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ main_~head~0.offset 8)) |main_#t~mem17|))) (= main_~head~0.offset 0)), 38628#(and (or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (not |main_#t~short21|) (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ main_~head~0.offset 8))))) (= main_~head~0.offset 0)), 38629#(and (or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ main_~head~0.offset 8))))) (= main_~head~0.offset 0)), 38630#(and (or (= 0 (select (select |#memory_int| (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_~head~0.offset 8))) (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))) (= main_~head~0.offset 0)), 38631#(or (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (+ 0 8))) (not (= (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|) 0))), 38632#(or (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ 0 8))) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0))), 38633#(or (= 0 (select (select |#memory_int| |main_#t~mem25.base|) (+ 0 8))) (not (= |main_#t~mem25.offset| 0))), 38634#(or (not (= main_~x~0.offset 0)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))), 38635#(or (not (= main_~x~0.offset 0)) (= 0 |main_#t~mem24|)), 38636#(not (= main_~head~0.offset 0)), 38620#true, 38621#false, 38622#(= 0 |main_#t~malloc0.offset|), 38623#(= main_~head~0.offset 0)] [2018-02-02 20:45:43,045 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:45:43,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:45:43,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:45:43,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:45:43,045 INFO L87 Difference]: Start difference. First operand 435 states and 498 transitions. Second operand 17 states. [2018-02-02 20:45:43,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:43,719 INFO L93 Difference]: Finished difference Result 639 states and 735 transitions. [2018-02-02 20:45:43,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:45:43,720 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2018-02-02 20:45:43,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:43,721 INFO L225 Difference]: With dead ends: 639 [2018-02-02 20:45:43,721 INFO L226 Difference]: Without dead ends: 625 [2018-02-02 20:45:43,721 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=205, Invalid=1127, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:45:43,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-02-02 20:45:43,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 577. [2018-02-02 20:45:43,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2018-02-02 20:45:43,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 686 transitions. [2018-02-02 20:45:43,724 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 686 transitions. Word has length 68 [2018-02-02 20:45:43,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:43,724 INFO L432 AbstractCegarLoop]: Abstraction has 577 states and 686 transitions. [2018-02-02 20:45:43,724 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:45:43,724 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 686 transitions. [2018-02-02 20:45:43,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 20:45:43,725 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:43,725 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] [2018-02-02 20:45:43,725 INFO L371 AbstractCegarLoop]: === Iteration 70 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:43,725 INFO L82 PathProgramCache]: Analyzing trace with hash 725995262, now seen corresponding path program 3 times [2018-02-02 20:45:43,725 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:43,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:43,768 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 20:45:43,768 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:45:43,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:45:43,768 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:43,769 INFO 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 20:45:43,769 INFO L182 omatonBuilderFactory]: Interpolants [39893#true, 39894#false, 39895#(and (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 39896#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 39897#(and (<= 0 (+ |main_#t~mem22.offset| 8)) (<= (+ |main_#t~mem22.offset| 12) (select |#length| |main_#t~mem22.base|))), 39898#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (<= 0 (+ main_~x~0.offset 8)))] [2018-02-02 20:45:43,769 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 20:45:43,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:45:43,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:45:43,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:45:43,769 INFO L87 Difference]: Start difference. First operand 577 states and 686 transitions. Second operand 6 states. [2018-02-02 20:45:43,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:43,870 INFO L93 Difference]: Finished difference Result 578 states and 678 transitions. [2018-02-02 20:45:43,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:45:43,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-02-02 20:45:43,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:43,871 INFO L225 Difference]: With dead ends: 578 [2018-02-02 20:45:43,871 INFO L226 Difference]: Without dead ends: 578 [2018-02-02 20:45:43,871 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 20:45:43,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-02-02 20:45:43,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 577. [2018-02-02 20:45:43,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2018-02-02 20:45:43,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 677 transitions. [2018-02-02 20:45:43,874 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 677 transitions. Word has length 68 [2018-02-02 20:45:43,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:43,874 INFO L432 AbstractCegarLoop]: Abstraction has 577 states and 677 transitions. [2018-02-02 20:45:43,874 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:45:43,874 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 677 transitions. [2018-02-02 20:45:43,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 20:45:43,875 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:43,875 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:43,875 INFO L371 AbstractCegarLoop]: === Iteration 71 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:43,875 INFO L82 PathProgramCache]: Analyzing trace with hash 615978274, now seen corresponding path program 1 times [2018-02-02 20:45:43,875 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:43,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:44,662 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 20:45:44,662 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:44,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 20:45:44,663 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:44,663 INFO 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 20:45:44,663 INFO L182 omatonBuilderFactory]: Interpolants [41088#(or (not (= |main_#t~mem24| 0)) (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0)), 41089#(or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0)), 41062#true, 41063#false, 41064#(= 0 |main_#t~malloc0.offset|), 41065#(= main_~head~0.offset 0), 41066#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 41067#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 41068#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 41069#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0)), 41070#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0)), 41071#(and (= 0 |main_#t~mem9.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= main_~head~0.offset 0)), 41072#(and (or (and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.offset main_~x~0.offset))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~head~0.offset 0)), 41073#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 41074#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~state~0 0)) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 41075#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~state~0 0)) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base main_~head~0.base)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) main_~state~0) (= main_~head~0.offset 0)), 41076#(and (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset main_~x~0.offset) (not (= main_~state~0 0)) (= main_~head~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) main_~state~0)), 41077#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~state~0 0)) (= main_~head~0.offset main_~x~0.offset) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) main_~state~0) (= main_~head~0.offset 0)), 41078#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (not (= main_~state~0 0)) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem7.base|)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) main_~state~0) (= main_~head~0.offset 0)), 41079#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8)) main_~state~0) (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= main_~state~0 0)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|)) (= main_~head~0.offset 0)), 41080#(and (not (= main_~state~0 0)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= (select (select |#memory_int| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8)) main_~state~0)), 41081#(and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8)) 0)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 41082#(and (not (= (select (select (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8) main_~state~0)) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8)) 0)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 41083#(and (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8)) 0)) (= main_~head~0.offset 0)), 41084#(and (not (= (select (select |#memory_int| |main_#t~mem14.base|) (+ main_~head~0.offset 8)) 0)) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 41085#(and (or (not (= 1 (select |#valid| main_~x~0.base))) (and (not (= (select (select |#memory_int| main_~x~0.base) (+ main_~head~0.offset 8)) 0)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (= main_~head~0.offset 0)), 41086#(not (= (select (select |#memory_int| |main_#t~mem23.base|) (+ 0 8)) 0)), 41087#(or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0) (not (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)))] [2018-02-02 20:45:44,663 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 20:45:44,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 20:45:44,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 20:45:44,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:45:44,664 INFO L87 Difference]: Start difference. First operand 577 states and 677 transitions. Second operand 28 states. [2018-02-02 20:45:45,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:45,985 INFO L93 Difference]: Finished difference Result 804 states and 935 transitions. [2018-02-02 20:45:45,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 20:45:45,985 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 68 [2018-02-02 20:45:45,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:45,987 INFO L225 Difference]: With dead ends: 804 [2018-02-02 20:45:45,987 INFO L226 Difference]: Without dead ends: 803 [2018-02-02 20:45:45,987 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=591, Invalid=3069, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 20:45:45,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2018-02-02 20:45:45,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 511. [2018-02-02 20:45:45,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-02-02 20:45:45,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 593 transitions. [2018-02-02 20:45:45,992 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 593 transitions. Word has length 68 [2018-02-02 20:45:45,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:45,992 INFO L432 AbstractCegarLoop]: Abstraction has 511 states and 593 transitions. [2018-02-02 20:45:45,992 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 20:45:45,992 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 593 transitions. [2018-02-02 20:45:45,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 20:45:45,992 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:45,992 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] [2018-02-02 20:45:45,993 INFO L371 AbstractCegarLoop]: === Iteration 72 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:45,993 INFO L82 PathProgramCache]: Analyzing trace with hash -505976732, now seen corresponding path program 1 times [2018-02-02 20:45:45,993 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:46,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:46,620 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 20:45:46,620 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:46,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 20:45:46,620 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:46,620 INFO 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 20:45:46,621 INFO L182 omatonBuilderFactory]: Interpolants [42496#(or (<= 1 main_~x~0.offset) (not (= 1 (select |#valid| main_~x~0.base))) (<= (+ main_~x~0.offset 1) 0) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))), 42497#(and (or (<= 1 main_~x~0.offset) (not (= 0 |main_#t~mem24|)) (<= (+ main_~x~0.offset 1) 0)) (= (select |#valid| main_~x~0.base) 1)), 42498#(and (or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0)) (= (select |#valid| main_~x~0.base) 1)), 42471#true, 42472#false, 42473#(= 0 |main_#t~malloc0.offset|), 42474#(= main_~head~0.offset 0), 42475#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 42476#(and (= main_~head~0.offset main_~x~0.offset) (= 1 main_~state~0) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 42477#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= 1 main_~state~0) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 42478#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= 1 main_~state~0) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0)), 42479#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= 1 main_~state~0) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0)), 42480#(and (= 0 |main_#t~mem9.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 1 main_~state~0) (= main_~head~0.offset 0)), 42481#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.offset 0) (= 1 main_~state~0) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 42482#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.offset 0) (= 1 main_~state~0) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 42483#(and (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= 1 main_~state~0) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~head~0.offset 0)), 42484#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset 0) (= 1 main_~state~0) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0)), 42485#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset 0) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= 1 main_~state~0) (not (= main_~x~0.base |main_#t~mem7.base|)) (= main_~head~0.offset 0)), 42486#(and (= 12 (select |#length| |main_#t~mem9.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|)) (= 1 main_~state~0) (= main_~head~0.offset 0)), 42487#(and (or (and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 0)) (= 1 main_~state~0) (not (= main_~x~0.base main_~head~0.base))) (not (= main_~head~0.offset main_~x~0.offset))) (= main_~head~0.offset 0) (= (select |#length| main_~x~0.base) 12)), 42488#(and (or (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 main_~state~0) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~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.offset main_~x~0.offset))) (<= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0) (= (select |#length| main_~x~0.base) 12)), 42489#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 main_~state~0) (not (= main_~x~0.base main_~head~0.base)) (<= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= main_~head~0.offset 0) (= (select |#length| main_~x~0.base) 12)), 42490#(and (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (+ main_~head~0.offset 8))) (= main_~head~0.offset 0)), 42491#(= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) 0)) (+ 0 8))), 42492#(= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) 0)) (+ 0 8))), 42493#(and (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) 0)) (+ 0 8))) (= main_~x~0.offset main_~head~0.offset)), 42494#(or (= 1 (select (select |#memory_int| |main_#t~mem25.base|) (+ 0 8))) (not (= 0 main_~head~0.offset))), 42495#(or (<= 1 main_~x~0.offset) (not (= 0 main_~head~0.offset)) (<= (+ main_~x~0.offset 1) 0) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))))] [2018-02-02 20:45:46,621 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 20:45:46,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 20:45:46,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 20:45:46,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:45:46,621 INFO L87 Difference]: Start difference. First operand 511 states and 593 transitions. Second operand 28 states. [2018-02-02 20:45:47,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:47,810 INFO L93 Difference]: Finished difference Result 607 states and 701 transitions. [2018-02-02 20:45:47,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 20:45:47,810 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 71 [2018-02-02 20:45:47,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:47,811 INFO L225 Difference]: With dead ends: 607 [2018-02-02 20:45:47,811 INFO L226 Difference]: Without dead ends: 606 [2018-02-02 20:45:47,811 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=442, Invalid=2980, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 20:45:47,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2018-02-02 20:45:47,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 589. [2018-02-02 20:45:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2018-02-02 20:45:47,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 687 transitions. [2018-02-02 20:45:47,815 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 687 transitions. Word has length 71 [2018-02-02 20:45:47,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:47,815 INFO L432 AbstractCegarLoop]: Abstraction has 589 states and 687 transitions. [2018-02-02 20:45:47,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 20:45:47,815 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 687 transitions. [2018-02-02 20:45:47,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 20:45:47,815 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:47,815 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:47,815 INFO L371 AbstractCegarLoop]: === Iteration 73 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:47,815 INFO L82 PathProgramCache]: Analyzing trace with hash -505927080, now seen corresponding path program 1 times [2018-02-02 20:45:47,816 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:47,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:48,124 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:48,124 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:48,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:45:48,124 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:48,124 INFO 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 20:45:48,124 INFO L182 omatonBuilderFactory]: Interpolants [43776#(or (= 0 |main_#t~mem25.offset|) (not (= main_~head~0.offset 0))), 43777#(or (not (= main_~head~0.offset 0)) (= 0 main_~x~0.offset)), 43778#(= 0 main_~x~0.offset), 43779#(= main_~head~0.offset 0), 43757#true, 43758#false, 43759#(= (select |#valid| main_~head~0.base) 1), 43760#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 43761#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= |main_#t~malloc5.offset| 0) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 43762#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 43763#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 43764#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.offset| 0) (= (select |#valid| main_~head~0.base) 1)), 43765#(and (= main_~x~0.offset 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 43766#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 43767#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0)), 43768#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0))), 43769#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0))), 43770#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|))), 43771#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 43772#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)), 43773#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) 0)), 43774#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0)), 43775#(and (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0)))] [2018-02-02 20:45:48,124 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:48,125 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:45:48,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:45:48,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:45:48,125 INFO L87 Difference]: Start difference. First operand 589 states and 687 transitions. Second operand 23 states. [2018-02-02 20:45:48,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:48,673 INFO L93 Difference]: Finished difference Result 614 states and 705 transitions. [2018-02-02 20:45:48,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:45:48,674 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2018-02-02 20:45:48,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:48,675 INFO L225 Difference]: With dead ends: 614 [2018-02-02 20:45:48,675 INFO L226 Difference]: Without dead ends: 600 [2018-02-02 20:45:48,675 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=1207, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:45:48,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-02-02 20:45:48,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 523. [2018-02-02 20:45:48,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-02-02 20:45:48,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 606 transitions. [2018-02-02 20:45:48,678 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 606 transitions. Word has length 71 [2018-02-02 20:45:48,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:48,678 INFO L432 AbstractCegarLoop]: Abstraction has 523 states and 606 transitions. [2018-02-02 20:45:48,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:45:48,678 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 606 transitions. [2018-02-02 20:45:48,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 20:45:48,678 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:48,679 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:48,679 INFO L371 AbstractCegarLoop]: === Iteration 74 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:48,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1330393698, now seen corresponding path program 1 times [2018-02-02 20:45:48,679 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:48,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:48,988 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 20:45:48,988 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:48,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:45:48,988 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:48,988 INFO 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 20:45:48,988 INFO L182 omatonBuilderFactory]: Interpolants [44960#(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~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|))), 44961#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 44962#(= 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))), 44963#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|)), 44964#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 44965#(and (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem16.offset| 0)), 44966#(<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 44967#(<= 0 |main_#t~mem22.offset|), 44968#(<= 0 main_~x~0.offset), 44969#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset)), 44947#true, 44948#false, 44949#(= (select |#valid| main_~head~0.base) 1), 44950#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 44951#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 44952#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 44953#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 44954#(and (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1)), 44955#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 44956#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 44957#(and (= 0 |main_#t~malloc5.offset|) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset))), 44958#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 44959#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|)))] [2018-02-02 20:45:48,988 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 20:45:48,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:45:48,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:45:48,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:45:48,989 INFO L87 Difference]: Start difference. First operand 523 states and 606 transitions. Second operand 23 states. [2018-02-02 20:45:49,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:49,862 INFO L93 Difference]: Finished difference Result 685 states and 781 transitions. [2018-02-02 20:45:49,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 20:45:49,863 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2018-02-02 20:45:49,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:49,864 INFO L225 Difference]: With dead ends: 685 [2018-02-02 20:45:49,864 INFO L226 Difference]: Without dead ends: 685 [2018-02-02 20:45:49,864 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=381, Invalid=2069, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 20:45:49,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2018-02-02 20:45:49,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 559. [2018-02-02 20:45:49,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2018-02-02 20:45:49,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 648 transitions. [2018-02-02 20:45:49,867 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 648 transitions. Word has length 71 [2018-02-02 20:45:49,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:49,867 INFO L432 AbstractCegarLoop]: Abstraction has 559 states and 648 transitions. [2018-02-02 20:45:49,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:45:49,867 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 648 transitions. [2018-02-02 20:45:49,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 20:45:49,868 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:49,868 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-02-02 20:45:49,868 INFO L371 AbstractCegarLoop]: === Iteration 75 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:49,868 INFO L82 PathProgramCache]: Analyzing trace with hash 87753784, now seen corresponding path program 1 times [2018-02-02 20:45:49,868 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:49,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:50,216 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:50,217 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:50,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:45:50,217 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:50,217 INFO 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 20:45:50,217 INFO L182 omatonBuilderFactory]: Interpolants [46272#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 46273#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 46274#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 46275#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1)), 46276#(and (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 46277#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 46278#(and (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1)), 46279#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 46280#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base |main_#t~mem7.base|)) (= (select |#valid| main_~x~0.base) 1)), 46281#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 46282#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1)), 46283#(and (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 1) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 46284#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 46285#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|))), 46286#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~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_~x~0.base) main_~x~0.offset)))), 46287#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem7.base|))), 46288#(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_~x~0.base) main_~x~0.offset)))), 46289#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 46290#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 46291#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 46292#(= 1 (select |#valid| |main_#t~mem14.base|)), 46293#(= (select |#valid| main_~x~0.base) 1), 46268#true, 46269#false, 46270#(= (select |#valid| main_~head~0.base) 1), 46271#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))] [2018-02-02 20:45:50,217 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:50,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:45:50,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:45:50,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:45:50,218 INFO L87 Difference]: Start difference. First operand 559 states and 648 transitions. Second operand 26 states. [2018-02-02 20:45:50,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:50,931 INFO L93 Difference]: Finished difference Result 559 states and 648 transitions. [2018-02-02 20:45:50,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:45:50,956 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 71 [2018-02-02 20:45:50,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:50,957 INFO L225 Difference]: With dead ends: 559 [2018-02-02 20:45:50,957 INFO L226 Difference]: Without dead ends: 559 [2018-02-02 20:45:50,957 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=367, Invalid=1525, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:45:50,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-02-02 20:45:50,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 558. [2018-02-02 20:45:50,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2018-02-02 20:45:50,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 647 transitions. [2018-02-02 20:45:50,960 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 647 transitions. Word has length 71 [2018-02-02 20:45:50,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:50,960 INFO L432 AbstractCegarLoop]: Abstraction has 558 states and 647 transitions. [2018-02-02 20:45:50,960 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:45:50,960 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 647 transitions. [2018-02-02 20:45:50,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 20:45:50,961 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:50,961 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-02-02 20:45:50,961 INFO L371 AbstractCegarLoop]: === Iteration 76 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:50,961 INFO L82 PathProgramCache]: Analyzing trace with hash 87753785, now seen corresponding path program 1 times [2018-02-02 20:45:50,961 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:50,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:51,435 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:51,435 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:51,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:45:51,435 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:51,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:51,436 INFO L182 omatonBuilderFactory]: Interpolants [47447#true, 47448#false, 47449#(= (select |#valid| main_~head~0.base) 1), 47450#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 47451#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 47452#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 47453#(and (= 12 (select |#length| |main_#t~mem7.base|)) (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 47454#(and (= 12 (select |#length| |main_#t~mem9.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 47455#(and (= 12 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 47456#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 47457#(and (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset))), 47458#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 47459#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|))), 47460#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 47461#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 1) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 47462#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 1) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)))), 47463#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 1) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 47464#(and (not (= main_~head~0.base |main_#t~malloc5.base|)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset))), 47465#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 47466#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|))), 47467#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 47468#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 47469#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)))), 47470#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 47471#(and (= 0 |main_#t~mem14.offset|) (= 12 (select |#length| |main_#t~mem14.base|))), 47472#(and (= (select |#length| main_~x~0.base) 12) (= 0 main_~x~0.offset))] [2018-02-02 20:45:51,436 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:51,436 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:45:51,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:45:51,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:45:51,436 INFO L87 Difference]: Start difference. First operand 558 states and 647 transitions. Second operand 26 states. [2018-02-02 20:45:52,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:52,247 INFO L93 Difference]: Finished difference Result 584 states and 666 transitions. [2018-02-02 20:45:52,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:45:52,247 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 71 [2018-02-02 20:45:52,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:52,248 INFO L225 Difference]: With dead ends: 584 [2018-02-02 20:45:52,248 INFO L226 Difference]: Without dead ends: 584 [2018-02-02 20:45:52,248 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=327, Invalid=1395, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 20:45:52,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-02-02 20:45:52,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 557. [2018-02-02 20:45:52,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-02-02 20:45:52,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 645 transitions. [2018-02-02 20:45:52,251 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 645 transitions. Word has length 71 [2018-02-02 20:45:52,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:52,251 INFO L432 AbstractCegarLoop]: Abstraction has 557 states and 645 transitions. [2018-02-02 20:45:52,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:45:52,251 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 645 transitions. [2018-02-02 20:45:52,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 20:45:52,252 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:52,252 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:52,252 INFO L371 AbstractCegarLoop]: === Iteration 77 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:52,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1522308743, now seen corresponding path program 1 times [2018-02-02 20:45:52,252 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:52,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:52,423 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:45:52,423 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:52,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:45:52,424 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:52,424 INFO 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 20:45:52,424 INFO L182 omatonBuilderFactory]: Interpolants [48646#true, 48647#false, 48648#(= 0 |main_#t~malloc0.offset|), 48649#(= main_~head~0.offset 0), 48650#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem14.offset|) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 48651#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 48652#(and (= |main_#t~mem22.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_~head~0.offset 0) (= |main_#t~mem22.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)))), 48653#(and (or (= main_~x~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_~head~0.offset main_~x~0.offset)) (or (= main_~x~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_~head~0.offset main_~x~0.offset))) (= main_~head~0.offset 0)), 48654#(and (or (= (select (select |#memory_int| (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_~head~0.offset 8)) |main_#t~mem15|) (not (= 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_~head~0.offset 0)), 48655#(and (or (not (= 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_int| (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_~head~0.offset 8)))) (= main_~head~0.offset 0)), 48656#(or (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (+ 0 8))) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|)))), 48657#(or (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ 0 8))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 48658#(or (not (= 0 |main_#t~mem25.offset|)) (= 0 (select (select |#memory_int| |main_#t~mem25.base|) (+ 0 8)))), 48659#(or (not (= 0 main_~x~0.offset)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))), 48660#(or (not (= 0 main_~x~0.offset)) (= 0 |main_#t~mem24|)), 48661#(not (= 0 main_~head~0.offset))] [2018-02-02 20:45:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:45:52,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:45:52,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:45:52,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:45:52,424 INFO L87 Difference]: Start difference. First operand 557 states and 645 transitions. Second operand 16 states. [2018-02-02 20:45:52,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:52,829 INFO L93 Difference]: Finished difference Result 732 states and 835 transitions. [2018-02-02 20:45:52,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:45:52,830 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2018-02-02 20:45:52,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:52,831 INFO L225 Difference]: With dead ends: 732 [2018-02-02 20:45:52,831 INFO L226 Difference]: Without dead ends: 718 [2018-02-02 20:45:52,831 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=851, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:45:52,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2018-02-02 20:45:52,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 568. [2018-02-02 20:45:52,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-02-02 20:45:52,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 655 transitions. [2018-02-02 20:45:52,834 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 655 transitions. Word has length 72 [2018-02-02 20:45:52,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:52,834 INFO L432 AbstractCegarLoop]: Abstraction has 568 states and 655 transitions. [2018-02-02 20:45:52,834 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:45:52,834 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 655 transitions. [2018-02-02 20:45:52,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 20:45:52,835 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:52,835 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:52,835 INFO L371 AbstractCegarLoop]: === Iteration 78 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:52,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1707468388, now seen corresponding path program 3 times [2018-02-02 20:45:52,835 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:52,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:53,153 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:53,153 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:53,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:45:53,153 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:53,153 INFO 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 20:45:53,153 INFO L182 omatonBuilderFactory]: Interpolants [49994#true, 49995#false, 49996#(= (select |#valid| main_~head~0.base) 1), 49997#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 49998#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 49999#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 50000#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 50001#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.offset|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1)), 50002#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 50003#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 50004#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset))), 50005#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 50006#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|))), 50007#(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~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|)) (= (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~mem9.offset|)), 50008#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)))), 50009#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~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 (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~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)))), 50010#(= main_~head~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)))), 50011#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|)))), 50012#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 50013#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|))), 50014#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 50015#(= 1 (select |#valid| |main_#t~mem16.base|))] [2018-02-02 20:45:53,153 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:53,154 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:45:53,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:45:53,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:45:53,154 INFO L87 Difference]: Start difference. First operand 568 states and 655 transitions. Second operand 22 states. [2018-02-02 20:45:54,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:54,061 INFO L93 Difference]: Finished difference Result 671 states and 762 transitions. [2018-02-02 20:45:54,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 20:45:54,061 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 72 [2018-02-02 20:45:54,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:54,062 INFO L225 Difference]: With dead ends: 671 [2018-02-02 20:45:54,062 INFO L226 Difference]: Without dead ends: 671 [2018-02-02 20:45:54,063 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=281, Invalid=1975, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 20:45:54,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2018-02-02 20:45:54,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 568. [2018-02-02 20:45:54,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-02-02 20:45:54,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 651 transitions. [2018-02-02 20:45:54,066 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 651 transitions. Word has length 72 [2018-02-02 20:45:54,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:54,066 INFO L432 AbstractCegarLoop]: Abstraction has 568 states and 651 transitions. [2018-02-02 20:45:54,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:45:54,066 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 651 transitions. [2018-02-02 20:45:54,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 20:45:54,066 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:54,067 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:54,067 INFO L371 AbstractCegarLoop]: === Iteration 79 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:54,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1707468389, now seen corresponding path program 3 times [2018-02-02 20:45:54,067 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:54,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:54,578 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:54,578 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:54,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:45:54,578 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:54,578 INFO 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 20:45:54,579 INFO L182 omatonBuilderFactory]: Interpolants [51328#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)))), 51329#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 51330#(and (= |main_#t~mem16.offset| 0) (= (select |#length| |main_#t~mem16.base|) 12)), 51307#true, 51308#false, 51309#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 51310#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base))), 51311#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 51312#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 51313#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 51314#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 51315#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 51316#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.offset|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1)), 51317#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 51318#(and (= 0 main_~head~0.offset) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 51319#(and (= 0 main_~head~0.offset) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~head~0.base)) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset))), 51320#(and (= 0 main_~head~0.offset) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~head~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 51321#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|))), 51322#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|)) (= (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~mem9.offset|)), 51323#(and (= 0 main_~head~0.offset) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| main_~head~0.base)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)))), 51324#(and (= 12 (select |#length| main_~head~0.base)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~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 (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~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))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 51325#(and (= 12 (select |#length| main_~head~0.base)) (= main_~head~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)))) (= 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))))), 51326#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))))), 51327#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))))] [2018-02-02 20:45:54,579 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:54,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:45:54,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:45:54,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:45:54,579 INFO L87 Difference]: Start difference. First operand 568 states and 651 transitions. Second operand 24 states. [2018-02-02 20:45:55,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:55,648 INFO L93 Difference]: Finished difference Result 673 states and 760 transitions. [2018-02-02 20:45:55,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:45:55,649 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2018-02-02 20:45:55,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:55,650 INFO L225 Difference]: With dead ends: 673 [2018-02-02 20:45:55,650 INFO L226 Difference]: Without dead ends: 673 [2018-02-02 20:45:55,650 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=315, Invalid=1755, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 20:45:55,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-02-02 20:45:55,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 555. [2018-02-02 20:45:55,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-02-02 20:45:55,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 634 transitions. [2018-02-02 20:45:55,653 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 634 transitions. Word has length 72 [2018-02-02 20:45:55,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:55,653 INFO L432 AbstractCegarLoop]: Abstraction has 555 states and 634 transitions. [2018-02-02 20:45:55,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:45:55,653 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 634 transitions. [2018-02-02 20:45:55,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 20:45:55,654 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:55,654 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] [2018-02-02 20:45:55,654 INFO L371 AbstractCegarLoop]: === Iteration 80 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:55,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1337150696, now seen corresponding path program 1 times [2018-02-02 20:45:55,654 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:55,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:55,866 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 20:45:55,866 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:45:55,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-02 20:45:55,866 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:55,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:55,866 INFO L182 omatonBuilderFactory]: Interpolants [52608#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)) (not (= main_~x~0.offset 0)))), 52609#(and (or (= main_~x~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (or (not (= main_~x~0.offset 0)) (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)))), 52610#(or (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8)) |main_#t~mem15|) (= main_~head~0.offset 0))), 52611#(or (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8))) (= main_~head~0.offset 0))), 52612#(or (not (= 0 |main_#t~mem23.offset|)) (= 0 (select (select |#memory_int| |main_#t~mem23.base|) (+ 0 8)))), 52613#(or (not (= 0 main_~x~0.offset)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))), 52614#(or (and (= |main_#t~mem24| (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (not (= 0 main_~x~0.offset))), 52615#(or (not (= 0 main_~head~0.offset)) (<= (+ main_~x~0.offset 1) 0)), 52616#(not (= 0 main_~head~0.offset)), 52603#true, 52604#false, 52605#(= 0 |main_#t~malloc0.offset|), 52606#(= main_~head~0.offset 0), 52607#(and (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0))] [2018-02-02 20:45:55,866 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 20:45:55,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:45:55,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:45:55,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:45:55,867 INFO L87 Difference]: Start difference. First operand 555 states and 634 transitions. Second operand 14 states. [2018-02-02 20:45:56,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:56,190 INFO L93 Difference]: Finished difference Result 594 states and 668 transitions. [2018-02-02 20:45:56,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:45:56,191 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-02-02 20:45:56,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:56,192 INFO L225 Difference]: With dead ends: 594 [2018-02-02 20:45:56,192 INFO L226 Difference]: Without dead ends: 576 [2018-02-02 20:45:56,192 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:45:56,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-02-02 20:45:56,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 561. [2018-02-02 20:45:56,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-02-02 20:45:56,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 639 transitions. [2018-02-02 20:45:56,195 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 639 transitions. Word has length 72 [2018-02-02 20:45:56,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:56,195 INFO L432 AbstractCegarLoop]: Abstraction has 561 states and 639 transitions. [2018-02-02 20:45:56,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:45:56,195 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 639 transitions. [2018-02-02 20:45:56,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 20:45:56,195 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:56,195 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:56,195 INFO L371 AbstractCegarLoop]: === Iteration 81 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:56,195 INFO L82 PathProgramCache]: Analyzing trace with hash 2070384480, now seen corresponding path program 1 times [2018-02-02 20:45:56,196 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:56,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:56,341 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:56,341 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:56,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:45:56,341 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:56,341 INFO 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 20:45:56,341 INFO L182 omatonBuilderFactory]: Interpolants [53794#true, 53795#false, 53796#(= 0 |main_#t~malloc0.offset|), 53797#(= main_~head~0.offset 0), 53798#(and (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 53799#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))), 53800#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|)))), 53801#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 53802#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|))), 53803#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 53804#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)), 53805#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 53806#(= 0 |main_#t~mem22.offset|), 53807#(= main_~x~0.offset 0), 53808#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))] [2018-02-02 20:45:56,341 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:56,341 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:45:56,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:45:56,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:45:56,342 INFO L87 Difference]: Start difference. First operand 561 states and 639 transitions. Second operand 15 states. [2018-02-02 20:45:56,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:56,712 INFO L93 Difference]: Finished difference Result 592 states and 667 transitions. [2018-02-02 20:45:56,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:45:56,712 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2018-02-02 20:45:56,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:56,713 INFO L225 Difference]: With dead ends: 592 [2018-02-02 20:45:56,714 INFO L226 Difference]: Without dead ends: 592 [2018-02-02 20:45:56,714 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=679, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:45:56,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-02-02 20:45:56,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 576. [2018-02-02 20:45:56,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2018-02-02 20:45:56,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 654 transitions. [2018-02-02 20:45:56,717 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 654 transitions. Word has length 73 [2018-02-02 20:45:56,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:56,717 INFO L432 AbstractCegarLoop]: Abstraction has 576 states and 654 transitions. [2018-02-02 20:45:56,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:45:56,717 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 654 transitions. [2018-02-02 20:45:56,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 20:45:56,717 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:56,718 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:56,718 INFO L371 AbstractCegarLoop]: === Iteration 82 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:56,718 INFO L82 PathProgramCache]: Analyzing trace with hash -242590494, now seen corresponding path program 1 times [2018-02-02 20:45:56,718 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:56,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:56,912 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:56,912 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:56,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:45:56,913 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:56,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:56,913 INFO L182 omatonBuilderFactory]: Interpolants [55008#false, 55009#(= 0 |main_#t~malloc0.offset|), 55010#(= main_~head~0.offset 0), 55011#(and (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 55012#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))), 55013#(and (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 55014#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|)))))), 55015#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))))), 55016#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|))))), 55017#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 55018#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)))), 55019#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 55020#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|))), 55021#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 55022#(= 1 (select |#valid| |main_#t~mem16.base|)), 55007#true] [2018-02-02 20:45:56,913 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:56,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:45:56,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:45:56,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:45:56,913 INFO L87 Difference]: Start difference. First operand 576 states and 654 transitions. Second operand 16 states. [2018-02-02 20:45:57,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:57,495 INFO L93 Difference]: Finished difference Result 591 states and 666 transitions. [2018-02-02 20:45:57,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:45:57,495 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 74 [2018-02-02 20:45:57,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:57,496 INFO L225 Difference]: With dead ends: 591 [2018-02-02 20:45:57,497 INFO L226 Difference]: Without dead ends: 591 [2018-02-02 20:45:57,497 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=222, Invalid=900, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:45:57,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2018-02-02 20:45:57,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 577. [2018-02-02 20:45:57,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2018-02-02 20:45:57,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 656 transitions. [2018-02-02 20:45:57,501 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 656 transitions. Word has length 74 [2018-02-02 20:45:57,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:57,501 INFO L432 AbstractCegarLoop]: Abstraction has 577 states and 656 transitions. [2018-02-02 20:45:57,501 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:45:57,501 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 656 transitions. [2018-02-02 20:45:57,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 20:45:57,502 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:57,502 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:45:57,502 INFO L371 AbstractCegarLoop]: === Iteration 83 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:57,502 INFO L82 PathProgramCache]: Analyzing trace with hash -242590493, now seen corresponding path program 1 times [2018-02-02 20:45:57,502 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:57,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:57,722 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:57,722 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:57,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:45:57,722 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:57,723 INFO 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 20:45:57,723 INFO L182 omatonBuilderFactory]: Interpolants [56227#true, 56228#false, 56229#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 56230#(and (= 12 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 56231#(and (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset))) (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= main_~head~0.offset 0)), 56232#(and (not (= main_~head~0.offset (+ main_~x~0.offset 8))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~head~0.base main_~x~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))), 56233#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))))))), 56234#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))))), 56235#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|))))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|))))), 56236#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 56237#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|))))), 56238#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 56239#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)))), 56240#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 56241#(and (= |main_#t~mem16.offset| 0) (= (select |#length| |main_#t~mem16.base|) 12))] [2018-02-02 20:45:57,723 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:57,723 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:45:57,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:45:57,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:45:57,723 INFO L87 Difference]: Start difference. First operand 577 states and 656 transitions. Second operand 15 states. [2018-02-02 20:45:58,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:45:58,299 INFO L93 Difference]: Finished difference Result 594 states and 668 transitions. [2018-02-02 20:45:58,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:45:58,299 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 74 [2018-02-02 20:45:58,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:45:58,300 INFO L225 Difference]: With dead ends: 594 [2018-02-02 20:45:58,300 INFO L226 Difference]: Without dead ends: 594 [2018-02-02 20:45:58,301 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:45:58,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-02-02 20:45:58,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 577. [2018-02-02 20:45:58,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2018-02-02 20:45:58,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 655 transitions. [2018-02-02 20:45:58,305 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 655 transitions. Word has length 74 [2018-02-02 20:45:58,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:45:58,305 INFO L432 AbstractCegarLoop]: Abstraction has 577 states and 655 transitions. [2018-02-02 20:45:58,305 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:45:58,305 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 655 transitions. [2018-02-02 20:45:58,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-02 20:45:58,306 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:45:58,306 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-02-02 20:45:58,306 INFO L371 AbstractCegarLoop]: === Iteration 84 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:45:58,306 INFO L82 PathProgramCache]: Analyzing trace with hash 727189023, now seen corresponding path program 1 times [2018-02-02 20:45:58,307 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:45:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:45:58,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:45:58,839 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:58,839 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:45:58,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:45:58,840 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:45:58,840 INFO 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 20:45:58,840 INFO L182 omatonBuilderFactory]: Interpolants [57439#true, 57440#false, 57441#(= (select |#valid| main_~head~0.base) 1), 57442#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 57443#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 57444#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 57445#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 57446#(and (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1)), 57447#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 57448#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 57449#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1)), 57450#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 57451#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|)) (= (select |#valid| main_~x~0.base) 1)), 57452#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 1) (not (= main_~head~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1)), 57453#(and (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 1) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)))), 57454#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 1) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~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))) (= (select |#valid| main_~x~0.base) 1)), 57455#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|))), 57456#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~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)))), 57457#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (not (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset) (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem7.base|))), 57458#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~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)))), 57459#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 57460#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 57461#(= 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)))), 57462#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 57463#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 57464#(= 1 (select |#valid| |main_#t~mem16.base|))] [2018-02-02 20:45:58,840 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:45:58,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:45:58,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:45:58,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:45:58,840 INFO L87 Difference]: Start difference. First operand 577 states and 655 transitions. Second operand 26 states. [2018-02-02 20:46:00,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:46:00,045 INFO L93 Difference]: Finished difference Result 738 states and 838 transitions. [2018-02-02 20:46:00,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 20:46:00,045 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 75 [2018-02-02 20:46:00,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:46:00,046 INFO L225 Difference]: With dead ends: 738 [2018-02-02 20:46:00,046 INFO L226 Difference]: Without dead ends: 738 [2018-02-02 20:46:00,047 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=382, Invalid=2588, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 20:46:00,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-02-02 20:46:00,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 645. [2018-02-02 20:46:00,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2018-02-02 20:46:00,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 733 transitions. [2018-02-02 20:46:00,052 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 733 transitions. Word has length 75 [2018-02-02 20:46:00,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:46:00,052 INFO L432 AbstractCegarLoop]: Abstraction has 645 states and 733 transitions. [2018-02-02 20:46:00,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:46:00,052 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 733 transitions. [2018-02-02 20:46:00,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-02 20:46:00,053 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:46:00,053 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-02-02 20:46:00,053 INFO L371 AbstractCegarLoop]: === Iteration 85 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:46:00,053 INFO L82 PathProgramCache]: Analyzing trace with hash 727189024, now seen corresponding path program 1 times [2018-02-02 20:46:00,054 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:46:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:46:00,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:46:00,615 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:46:00,615 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:46:00,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:46:00,615 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:46:00,615 INFO 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 20:46:00,615 INFO L182 omatonBuilderFactory]: Interpolants [58906#true, 58907#false, 58908#(= (select |#valid| main_~head~0.base) 1), 58909#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 58910#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 58911#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 58912#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 58913#(and (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1)), 58914#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 58915#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 58916#(and (= 0 |main_#t~malloc5.offset|) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| |main_#t~malloc5.base|)) (= (select |#valid| main_~head~0.base) 1)), 58917#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 58918#(and (= 12 (select |#length| |main_#t~mem7.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|))), 58919#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| |main_#t~mem9.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 1) (not (= main_~head~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1)), 58920#(and (= 12 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) 1) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)))), 58921#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| main_~x~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 1) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~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))) (= (select |#valid| main_~x~0.base) 1)), 58922#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc5.base|)) (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)))), 58923#(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 (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~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)))), 58924#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))) (not (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset) (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem7.base|))), 58925#(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 (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~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)))), 58926#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|))), 58927#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 58928#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 58929#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 58930#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 58931#(and (= |main_#t~mem16.offset| 0) (= (select |#length| |main_#t~mem16.base|) 12))] [2018-02-02 20:46:00,615 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:46:00,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:46:00,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:46:00,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:46:00,616 INFO L87 Difference]: Start difference. First operand 645 states and 733 transitions. Second operand 26 states. [2018-02-02 20:46:02,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:46:02,005 INFO L93 Difference]: Finished difference Result 796 states and 908 transitions. [2018-02-02 20:46:02,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:46:02,005 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 75 [2018-02-02 20:46:02,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:46:02,006 INFO L225 Difference]: With dead ends: 796 [2018-02-02 20:46:02,006 INFO L226 Difference]: Without dead ends: 796 [2018-02-02 20:46:02,007 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=265, Invalid=1627, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:46:02,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2018-02-02 20:46:02,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 645. [2018-02-02 20:46:02,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2018-02-02 20:46:02,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 732 transitions. [2018-02-02 20:46:02,010 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 732 transitions. Word has length 75 [2018-02-02 20:46:02,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:46:02,010 INFO L432 AbstractCegarLoop]: Abstraction has 645 states and 732 transitions. [2018-02-02 20:46:02,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:46:02,010 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 732 transitions. [2018-02-02 20:46:02,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 20:46:02,011 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:46:02,011 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:46:02,011 INFO L371 AbstractCegarLoop]: === Iteration 86 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:46:02,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1527548576, now seen corresponding path program 2 times [2018-02-02 20:46:02,011 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:46:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:46:02,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:46:02,296 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:46:02,297 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:46:02,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:46:02,297 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:46:02,297 INFO 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 20:46:02,297 INFO L182 omatonBuilderFactory]: Interpolants [60416#(and (= 0 main_~head~0.offset) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 60417#(and (= 0 main_~head~0.offset) (= main_~head~0.offset main_~x~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 60418#(and (= 0 main_~head~0.offset) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.offset|) (not (= main_~head~0.base |main_#t~mem9.base|))), 60419#(and (= 0 main_~head~0.offset) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 60420#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 60421#(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_~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))) (= main_~head~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)))), 60422#(and (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 60423#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 60424#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|))), 60425#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 60426#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)), 60427#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 60428#(and (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem16.offset| 0)), 60429#(<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 60430#(<= 0 |main_#t~mem22.offset|), 60431#(<= 0 main_~x~0.offset), 60432#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset)), 60409#true, 60410#false, 60411#(= 0 |main_#t~malloc0.offset|), 60412#(= 0 main_~head~0.offset), 60413#(and (= 0 main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1)), 60414#(and (= 0 main_~head~0.offset) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 60415#(and (= 0 main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base))] [2018-02-02 20:46:02,297 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:46:02,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:46:02,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:46:02,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:46:02,298 INFO L87 Difference]: Start difference. First operand 645 states and 732 transitions. Second operand 24 states. [2018-02-02 20:46:03,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:46:03,738 INFO L93 Difference]: Finished difference Result 789 states and 890 transitions. [2018-02-02 20:46:03,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 20:46:03,738 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 78 [2018-02-02 20:46:03,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:46:03,740 INFO L225 Difference]: With dead ends: 789 [2018-02-02 20:46:03,740 INFO L226 Difference]: Without dead ends: 789 [2018-02-02 20:46:03,741 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=762, Invalid=3144, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 20:46:03,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-02-02 20:46:03,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 690. [2018-02-02 20:46:03,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-02-02 20:46:03,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 784 transitions. [2018-02-02 20:46:03,749 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 784 transitions. Word has length 78 [2018-02-02 20:46:03,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:46:03,749 INFO L432 AbstractCegarLoop]: Abstraction has 690 states and 784 transitions. [2018-02-02 20:46:03,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:46:03,750 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 784 transitions. [2018-02-02 20:46:03,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 20:46:03,751 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:46:03,751 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-02-02 20:46:03,752 INFO L371 AbstractCegarLoop]: === Iteration 87 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:46:03,752 INFO L82 PathProgramCache]: Analyzing trace with hash -568570746, now seen corresponding path program 1 times [2018-02-02 20:46:03,752 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:46:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:46:03,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:46:04,384 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:46:04,384 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:46:04,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 20:46:04,384 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:46:04,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:46:04,384 INFO L182 omatonBuilderFactory]: Interpolants [62016#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 62017#(and (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 |main_#t~mem14.offset|)), 62018#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 main_~x~0.offset)), 62019#(<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 62020#(<= 0 |main_#t~mem23.offset|), 62021#(<= 0 main_~x~0.offset), 62022#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset)), 61990#true, 61991#false, 61992#(= |main_#t~malloc0.offset| 0), 61993#(= main_~head~0.offset 0), 61994#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 61995#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 61996#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 61997#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 61998#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= main_~head~0.offset 0)), 61999#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 62000#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 62001#(and (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 62002#(and (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 62003#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 62004#(and (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|)) (= main_~head~0.offset 0)), 62005#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 62006#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 62007#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 62008#(and (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 62009#(and (= 0 main_~head~0.offset) (= main_~head~0.offset |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (not (= main_~head~0.base main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset))), 62010#(and (= 0 main_~head~0.offset) (not (= main_~head~0.base main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 62011#(and (or (and (= 0 main_~head~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (= 0 main_~head~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~x~0.base |main_#t~mem7.base|))), 62012#(or (and (= 0 main_~head~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= 0 main_~head~0.offset) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 62013#(or (and (= 0 main_~head~0.offset) (= main_~head~0.offset |main_#t~mem9.offset|) (= main_~head~0.base |main_#t~mem9.base|)) (and (= 0 main_~head~0.offset) (= main_~head~0.offset |main_#t~mem9.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 62014#(or (and (= 0 main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)) (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)))), 62015#(or (and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))] [2018-02-02 20:46:04,384 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:46:04,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 20:46:04,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 20:46:04,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=901, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:46:04,385 INFO L87 Difference]: Start difference. First operand 690 states and 784 transitions. Second operand 33 states. [2018-02-02 20:46:05,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:46:05,452 INFO L93 Difference]: Finished difference Result 737 states and 825 transitions. [2018-02-02 20:46:05,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 20:46:05,452 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 78 [2018-02-02 20:46:05,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:46:05,453 INFO L225 Difference]: With dead ends: 737 [2018-02-02 20:46:05,453 INFO L226 Difference]: Without dead ends: 736 [2018-02-02 20:46:05,453 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=729, Invalid=2811, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 20:46:05,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2018-02-02 20:46:05,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 682. [2018-02-02 20:46:05,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2018-02-02 20:46:05,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 772 transitions. [2018-02-02 20:46:05,458 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 772 transitions. Word has length 78 [2018-02-02 20:46:05,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:46:05,458 INFO L432 AbstractCegarLoop]: Abstraction has 682 states and 772 transitions. [2018-02-02 20:46:05,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 20:46:05,458 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 772 transitions. [2018-02-02 20:46:05,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-02 20:46:05,459 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:46:05,459 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:46:05,459 INFO L371 AbstractCegarLoop]: === Iteration 88 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:46:05,460 INFO L82 PathProgramCache]: Analyzing trace with hash 109365666, now seen corresponding path program 4 times [2018-02-02 20:46:05,460 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:46:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:46:05,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:46:05,757 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:46:05,757 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:46:05,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:46:05,757 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:46:05,758 INFO 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 20:46:05,758 INFO L182 omatonBuilderFactory]: Interpolants [63496#true, 63497#false, 63498#(= (select |#valid| main_~head~0.base) 1), 63499#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 63500#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= 1 (select |#valid| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 63501#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 63502#(and (= main_~head~0.offset main_~x~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 63503#(and (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.offset|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 63504#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 63505#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.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) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 63506#(and (= 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))) (= main_~head~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))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~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)))))), 63507#(and (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))))), 63508#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 63509#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|))))), 63510#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 63511#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)))), 63512#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 63513#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|))), 63514#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 63515#(= 1 (select |#valid| |main_#t~mem16.base|))] [2018-02-02 20:46:05,758 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:46:05,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:46:05,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:46:05,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:46:05,758 INFO L87 Difference]: Start difference. First operand 682 states and 772 transitions. Second operand 20 states. [2018-02-02 20:46:06,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:46:06,520 INFO L93 Difference]: Finished difference Result 761 states and 858 transitions. [2018-02-02 20:46:06,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:46:06,520 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 79 [2018-02-02 20:46:06,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:46:06,521 INFO L225 Difference]: With dead ends: 761 [2018-02-02 20:46:06,521 INFO L226 Difference]: Without dead ends: 761 [2018-02-02 20:46:06,521 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=250, Invalid=1472, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 20:46:06,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2018-02-02 20:46:06,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 682. [2018-02-02 20:46:06,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2018-02-02 20:46:06,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 770 transitions. [2018-02-02 20:46:06,524 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 770 transitions. Word has length 79 [2018-02-02 20:46:06,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:46:06,524 INFO L432 AbstractCegarLoop]: Abstraction has 682 states and 770 transitions. [2018-02-02 20:46:06,524 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:46:06,524 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 770 transitions. [2018-02-02 20:46:06,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-02 20:46:06,525 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:46:06,525 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:46:06,525 INFO L371 AbstractCegarLoop]: === Iteration 89 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:46:06,525 INFO L82 PathProgramCache]: Analyzing trace with hash 109365667, now seen corresponding path program 4 times [2018-02-02 20:46:06,525 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:46:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:46:06,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:46:06,881 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:46:06,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:46:06,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:46:06,882 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:46:06,882 INFO 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 20:46:06,882 INFO L182 omatonBuilderFactory]: Interpolants [65003#true, 65004#false, 65005#(= (select |#valid| main_~head~0.base) 1), 65006#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 65007#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 65008#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 65009#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 65010#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.offset|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 65011#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~head~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~head~0.base)) main_~head~0.base) main_~head~0.offset))), 65012#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 65013#(and (= 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))) (= main_~head~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))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~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)))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~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)))))), 65014#(and (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|)))) (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|)))), 65015#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 65016#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|))))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|))))), 65017#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 65018#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|))))), 65019#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 65020#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|)))), 65021#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 65022#(and (= |main_#t~mem16.offset| 0) (= (select |#length| |main_#t~mem16.base|) 12))] [2018-02-02 20:46:06,882 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:46:06,882 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:46:06,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:46:06,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:46:06,882 INFO L87 Difference]: Start difference. First operand 682 states and 770 transitions. Second operand 20 states. [2018-02-02 20:46:07,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:46:07,647 INFO L93 Difference]: Finished difference Result 760 states and 856 transitions. [2018-02-02 20:46:07,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:46:07,647 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 79 [2018-02-02 20:46:07,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:46:07,648 INFO L225 Difference]: With dead ends: 760 [2018-02-02 20:46:07,648 INFO L226 Difference]: Without dead ends: 760 [2018-02-02 20:46:07,648 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=1142, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:46:07,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-02-02 20:46:07,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 669. [2018-02-02 20:46:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2018-02-02 20:46:07,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 755 transitions. [2018-02-02 20:46:07,651 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 755 transitions. Word has length 79 [2018-02-02 20:46:07,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:46:07,651 INFO L432 AbstractCegarLoop]: Abstraction has 669 states and 755 transitions. [2018-02-02 20:46:07,651 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:46:07,651 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 755 transitions. [2018-02-02 20:46:07,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-02 20:46:07,652 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:46:07,652 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-02-02 20:46:07,652 INFO L371 AbstractCegarLoop]: === Iteration 90 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:46:07,652 INFO L82 PathProgramCache]: Analyzing trace with hash -935685870, now seen corresponding path program 1 times [2018-02-02 20:46:07,652 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:46:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:46:07,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-02 20:46:08,404 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 20:46:08,408 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 20:46:08,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:46:08 BoogieIcfgContainer [2018-02-02 20:46:08,408 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 20:46:08,409 INFO L168 Benchmark]: Toolchain (without parser) took 74058.23 ms. Allocated memory was 386.9 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 341.0 MB in the beginning and 1.2 GB in the end (delta: -827.0 MB). Peak memory consumption was 242.6 MB. Max. memory is 5.3 GB. [2018-02-02 20:46:08,409 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 386.9 MB. Free memory is still 347.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:46:08,410 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.16 ms. Allocated memory is still 386.9 MB. Free memory was 341.0 MB in the beginning and 329.1 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-02 20:46:08,410 INFO L168 Benchmark]: Boogie Preprocessor took 31.19 ms. Allocated memory is still 386.9 MB. Free memory was 329.1 MB in the beginning and 327.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 20:46:08,410 INFO L168 Benchmark]: RCFGBuilder took 334.86 ms. Allocated memory is still 386.9 MB. Free memory was 327.8 MB in the beginning and 294.6 MB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 5.3 GB. [2018-02-02 20:46:08,410 INFO L168 Benchmark]: TraceAbstraction took 73525.45 ms. Allocated memory was 386.9 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 294.6 MB in the beginning and 1.2 GB in the end (delta: -873.4 MB). Peak memory consumption was 196.2 MB. Max. memory is 5.3 GB. [2018-02-02 20:46:08,411 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 386.9 MB. Free memory is still 347.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 164.16 ms. Allocated memory is still 386.9 MB. Free memory was 341.0 MB in the beginning and 329.1 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.19 ms. Allocated memory is still 386.9 MB. Free memory was 329.1 MB in the beginning and 327.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 334.86 ms. Allocated memory is still 386.9 MB. Free memory was 327.8 MB in the beginning and 294.6 MB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 73525.45 ms. Allocated memory was 386.9 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 294.6 MB in the beginning and 1.2 GB in the end (delta: -873.4 MB). Peak memory consumption was 196.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1028). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 983]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 983). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1028). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 25 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 113 locations, 47 error locations. TIMEOUT Result, 73.4s OverallTime, 90 OverallIterations, 4 TraceHistogramMax, 48.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6625 SDtfs, 28501 SDslu, 48558 SDs, 0 SdLazy, 55784 SolverSat, 4201 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2870 GetRequests, 203 SyntacticMatches, 186 SemanticMatches, 2481 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18860 ImplicationChecksByTransitivity, 39.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=690occurred in iteration=86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 180/1495 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 89 MinimizatonAttempts, 3952 StatesRemovedByMinimization, 89 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 22.1s InterpolantComputationTime, 4614 NumberOfCodeBlocks, 4614 NumberOfCodeBlocksAsserted, 89 NumberOfCheckSat, 4525 ConstructedInterpolants, 0 QuantifiedInterpolants, 5970085 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 89 InterpolantComputations, 27 PerfectInterpolantSequences, 180/1495 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-circular_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-46-08-416.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-circular_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_20-46-08-416.csv Completed graceful shutdown