java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/list-ext-properties/simple-ext_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:08:44,233 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:08:44,235 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:08:44,247 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:08:44,247 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:08:44,248 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:08:44,249 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:08:44,250 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:08:44,252 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:08:44,252 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:08:44,253 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:08:44,253 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:08:44,254 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:08:44,255 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:08:44,255 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:08:44,257 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:08:44,258 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:08:44,260 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:08:44,260 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:08:44,261 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:08:44,263 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:08:44,263 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:08:44,263 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:08:44,264 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:08:44,264 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:08:44,265 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:08:44,265 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:08:44,266 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:08:44,266 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:08:44,266 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:08:44,267 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:08:44,267 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 10:08:44,276 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:08:44,276 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:08:44,277 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:08:44,277 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:08:44,277 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:08:44,278 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:08:44,278 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:08:44,278 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:08:44,278 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:08:44,278 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:08:44,278 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:08:44,278 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:08:44,279 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:08:44,279 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:08:44,279 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:08:44,279 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:08:44,279 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:08:44,279 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:08:44,279 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:08:44,280 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:08:44,280 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:08:44,280 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:08:44,280 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:08:44,306 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:08:44,313 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:08:44,316 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:08:44,317 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:08:44,317 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:08:44,317 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/simple-ext_1_true-valid-memsafety.i [2018-02-02 10:08:44,451 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:08:44,452 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:08:44,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:08:44,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:08:44,457 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:08:44,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:08:44" (1/1) ... [2018-02-02 10:08:44,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1570a244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:08:44, skipping insertion in model container [2018-02-02 10:08:44,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:08:44" (1/1) ... [2018-02-02 10:08:44,471 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:08:44,501 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:08:44,606 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:08:44,625 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:08:44,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:08:44 WrapperNode [2018-02-02 10:08:44,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:08:44,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:08:44,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:08:44,633 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:08:44,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:08:44" (1/1) ... [2018-02-02 10:08:44,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:08:44" (1/1) ... [2018-02-02 10:08:44,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:08:44" (1/1) ... [2018-02-02 10:08:44,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:08:44" (1/1) ... [2018-02-02 10:08:44,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:08:44" (1/1) ... [2018-02-02 10:08:44,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:08:44" (1/1) ... [2018-02-02 10:08:44,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:08:44" (1/1) ... [2018-02-02 10:08:44,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:08:44,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:08:44,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:08:44,662 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:08:44,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:08:44" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:08:44,703 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:08:44,703 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:08:44,703 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-02-02 10:08:44,703 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:08:44,703 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:08:44,703 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:08:44,703 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:08:44,704 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:08:44,704 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:08:44,704 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:08:44,704 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:08:44,704 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:08:44,704 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 10:08:44,704 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:08:44,704 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:08:44,704 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-02-02 10:08:44,704 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:08:44,704 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:08:44,705 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:08:44,913 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:08:44,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:08:44 BoogieIcfgContainer [2018-02-02 10:08:44,913 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:08:44,914 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:08:44,914 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:08:44,916 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:08:44,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:08:44" (1/3) ... [2018-02-02 10:08:44,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39344b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:08:44, skipping insertion in model container [2018-02-02 10:08:44,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:08:44" (2/3) ... [2018-02-02 10:08:44,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39344b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:08:44, skipping insertion in model container [2018-02-02 10:08:44,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:08:44" (3/3) ... [2018-02-02 10:08:44,919 INFO L107 eAbstractionObserver]: Analyzing ICFG simple-ext_1_true-valid-memsafety.i [2018-02-02 10:08:44,926 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:08:44,932 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-02 10:08:44,963 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:08:44,964 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:08:44,964 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:08:44,964 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:08:44,964 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:08:44,964 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:08:44,964 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:08:44,965 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:08:44,965 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:08:44,977 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-02-02 10:08:44,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-02 10:08:44,985 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:44,987 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:44,987 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:44,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1616503521, now seen corresponding path program 1 times [2018-02-02 10:08:45,041 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:45,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:45,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:45,110 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:08:45,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:08:45,111 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:45,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:45,111 INFO L182 omatonBuilderFactory]: Interpolants [68#true, 69#false] [2018-02-02 10:08:45,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:45,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-02 10:08:45,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-02 10:08:45,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 10:08:45,125 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2018-02-02 10:08:45,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:45,139 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-02-02 10:08:45,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 10:08:45,195 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-02-02 10:08:45,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:45,202 INFO L225 Difference]: With dead ends: 65 [2018-02-02 10:08:45,203 INFO L226 Difference]: Without dead ends: 57 [2018-02-02 10:08:45,204 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 10:08:45,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-02 10:08:45,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-02 10:08:45,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 10:08:45,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-02-02 10:08:45,234 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 11 [2018-02-02 10:08:45,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:45,235 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-02-02 10:08:45,235 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-02 10:08:45,235 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-02-02 10:08:45,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:08:45,235 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:45,235 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:45,235 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:45,236 INFO L82 PathProgramCache]: Analyzing trace with hash 2050647052, now seen corresponding path program 1 times [2018-02-02 10:08:45,236 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:45,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:45,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:45,297 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:08:45,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:08:45,297 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:45,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 10:08:45,297 INFO L182 omatonBuilderFactory]: Interpolants [192#true, 193#false, 194#(= 1 (select |#valid| |main_#t~malloc0.base|)), 195#(= 1 (select |#valid| main_~a~0.base)), 196#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:08:45,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 10:08:45,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:08:45,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:08:45,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:08:45,299 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 5 states. [2018-02-02 10:08:45,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:45,460 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-02-02 10:08:45,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:08:45,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 10:08:45,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:45,461 INFO L225 Difference]: With dead ends: 75 [2018-02-02 10:08:45,462 INFO L226 Difference]: Without dead ends: 75 [2018-02-02 10:08:45,462 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:08:45,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-02 10:08:45,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2018-02-02 10:08:45,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-02 10:08:45,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2018-02-02 10:08:45,468 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 14 [2018-02-02 10:08:45,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:45,468 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-02-02 10:08:45,469 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:08:45,469 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2018-02-02 10:08:45,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:08:45,469 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:45,469 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:45,469 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:45,470 INFO L82 PathProgramCache]: Analyzing trace with hash 2050647053, now seen corresponding path program 1 times [2018-02-02 10:08:45,471 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:45,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:45,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:45,560 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:08:45,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:08:45,560 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:45,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:45,561 INFO L182 omatonBuilderFactory]: Interpolants [340#true, 341#false, 342#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 343#(and (= 8 (select |#length| main_~a~0.base)) (= 0 main_~a~0.offset)), 344#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 10:08:45,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:45,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:08:45,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:08:45,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:08:45,562 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 5 states. [2018-02-02 10:08:45,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:45,721 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-02-02 10:08:45,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:08:45,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 10:08:45,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:45,722 INFO L225 Difference]: With dead ends: 82 [2018-02-02 10:08:45,722 INFO L226 Difference]: Without dead ends: 82 [2018-02-02 10:08:45,722 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:08:45,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-02 10:08:45,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74. [2018-02-02 10:08:45,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 10:08:45,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-02-02 10:08:45,728 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 14 [2018-02-02 10:08:45,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:45,729 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-02-02 10:08:45,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:08:45,729 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-02-02 10:08:45,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:08:45,729 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:45,730 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] [2018-02-02 10:08:45,730 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:45,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1493222104, now seen corresponding path program 1 times [2018-02-02 10:08:45,731 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:45,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:45,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:45,786 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:08:45,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:08:45,787 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:45,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:45,787 INFO L182 omatonBuilderFactory]: Interpolants [505#true, 506#false, 507#(not (= 0 |main_#t~malloc0.base|)), 508#(not (= 0 main_~a~0.base)), 509#(not (= 0 main_~p~0.base))] [2018-02-02 10:08:45,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:45,788 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:08:45,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:08:45,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:08:45,788 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 5 states. [2018-02-02 10:08:45,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:45,850 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-02-02 10:08:45,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:08:45,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-02 10:08:45,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:45,851 INFO L225 Difference]: With dead ends: 78 [2018-02-02 10:08:45,851 INFO L226 Difference]: Without dead ends: 78 [2018-02-02 10:08:45,851 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 10:08:45,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-02 10:08:45,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2018-02-02 10:08:45,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 10:08:45,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-02-02 10:08:45,854 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 23 [2018-02-02 10:08:45,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:45,855 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-02-02 10:08:45,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:08:45,855 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-02-02 10:08:45,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:08:45,855 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:45,855 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] [2018-02-02 10:08:45,855 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:45,856 INFO L82 PathProgramCache]: Analyzing trace with hash -458760131, now seen corresponding path program 1 times [2018-02-02 10:08:45,856 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:45,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:45,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:45,992 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:45,993 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:08:45,993 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:45,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 10:08:45,993 INFO L182 omatonBuilderFactory]: Interpolants [672#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 673#(and (= 0 |main_#t~mem11.offset|) (= 0 |main_#t~mem11.base|)), 674#(and (= main_~p~0.base 0) (= main_~p~0.offset 0)), 666#true, 667#false, 668#(= 0 |main_#t~malloc0.offset|), 669#(= 0 main_~a~0.offset), 670#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 671#(and (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))))] [2018-02-02 10:08:45,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:45,994 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:08:45,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:08:45,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:08:45,994 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 9 states. [2018-02-02 10:08:46,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:46,222 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-02-02 10:08:46,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:08:46,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-02-02 10:08:46,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:46,223 INFO L225 Difference]: With dead ends: 105 [2018-02-02 10:08:46,223 INFO L226 Difference]: Without dead ends: 105 [2018-02-02 10:08:46,223 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:08:46,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-02 10:08:46,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 83. [2018-02-02 10:08:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 10:08:46,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-02-02 10:08:46,228 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 25 [2018-02-02 10:08:46,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:46,228 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-02-02 10:08:46,228 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:08:46,228 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-02-02 10:08:46,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:08:46,229 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:46,229 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] [2018-02-02 10:08:46,229 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:46,229 INFO L82 PathProgramCache]: Analyzing trace with hash -290149679, now seen corresponding path program 1 times [2018-02-02 10:08:46,230 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:46,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:46,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:46,317 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:08:46,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:08:46,317 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:46,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:46,318 INFO L182 omatonBuilderFactory]: Interpolants [880#(= 1 (select |#valid| main_~t~0.base)), 881#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 882#(= 1 (select |#valid| |main_#t~mem6.base|)), 883#(= 1 (select |#valid| main_~p~0.base)), 877#true, 878#false, 879#(= 1 (select |#valid| |main_#t~malloc4.base|))] [2018-02-02 10:08:46,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:46,318 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:08:46,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:08:46,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:08:46,318 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 7 states. [2018-02-02 10:08:46,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:46,485 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-02-02 10:08:46,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:08:46,485 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-02-02 10:08:46,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:46,486 INFO L225 Difference]: With dead ends: 87 [2018-02-02 10:08:46,486 INFO L226 Difference]: Without dead ends: 87 [2018-02-02 10:08:46,486 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:08:46,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-02 10:08:46,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2018-02-02 10:08:46,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 10:08:46,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2018-02-02 10:08:46,489 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 25 [2018-02-02 10:08:46,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:46,490 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2018-02-02 10:08:46,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:08:46,490 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2018-02-02 10:08:46,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:08:46,490 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:46,491 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] [2018-02-02 10:08:46,491 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:46,491 INFO L82 PathProgramCache]: Analyzing trace with hash -290149678, now seen corresponding path program 1 times [2018-02-02 10:08:46,492 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:46,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:46,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:46,567 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:08:46,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:08:46,568 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:46,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:46,568 INFO L182 omatonBuilderFactory]: Interpolants [1063#true, 1064#false, 1065#(and (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 1066#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset)), 1067#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 1068#(and (= 0 |main_#t~mem6.offset|) (= 8 (select |#length| |main_#t~mem6.base|))), 1069#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 10:08:46,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:46,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:08:46,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:08:46,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:08:46,569 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 7 states. [2018-02-02 10:08:46,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:46,719 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-02-02 10:08:46,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:08:46,720 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-02-02 10:08:46,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:46,720 INFO L225 Difference]: With dead ends: 95 [2018-02-02 10:08:46,720 INFO L226 Difference]: Without dead ends: 95 [2018-02-02 10:08:46,721 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:08:46,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-02 10:08:46,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 70. [2018-02-02 10:08:46,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-02 10:08:46,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2018-02-02 10:08:46,723 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 25 [2018-02-02 10:08:46,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:46,724 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2018-02-02 10:08:46,724 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:08:46,724 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2018-02-02 10:08:46,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:08:46,724 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:46,724 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] [2018-02-02 10:08:46,724 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:46,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1498253566, now seen corresponding path program 1 times [2018-02-02 10:08:46,725 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:46,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:46,873 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:08:46,874 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:46,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:08:46,874 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:46,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:46,874 INFO L182 omatonBuilderFactory]: Interpolants [1248#true, 1249#false, 1250#(= 0 |main_#t~malloc0.offset|), 1251#(= 0 main_~a~0.offset), 1252#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 1253#(and (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 1254#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 1255#(and (= 0 |main_#t~mem13.offset|) (= 0 |main_#t~mem13.base|) (= main_~p~0.offset 0)), 1256#(and (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (= 0 main_~t~0.base)), 1257#(and (= 0 main_~t~0.offset) (= 0 main_~t~0.base)), 1258#(and (= main_~p~0.base 0) (= main_~p~0.offset 0))] [2018-02-02 10:08:46,874 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:08:46,875 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:08:46,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:08:46,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:08:46,875 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 11 states. [2018-02-02 10:08:47,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:47,092 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-02-02 10:08:47,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:08:47,092 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-02-02 10:08:47,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:47,093 INFO L225 Difference]: With dead ends: 91 [2018-02-02 10:08:47,093 INFO L226 Difference]: Without dead ends: 91 [2018-02-02 10:08:47,093 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:08:47,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-02 10:08:47,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2018-02-02 10:08:47,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-02 10:08:47,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-02-02 10:08:47,098 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 34 [2018-02-02 10:08:47,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:47,098 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-02-02 10:08:47,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:08:47,098 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-02-02 10:08:47,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:08:47,099 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:47,099 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] [2018-02-02 10:08:47,099 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:47,099 INFO L82 PathProgramCache]: Analyzing trace with hash -798781214, now seen corresponding path program 1 times [2018-02-02 10:08:47,100 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:47,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:47,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:08:47,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:47,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:08:47,205 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:47,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:47,205 INFO L182 omatonBuilderFactory]: Interpolants [1447#true, 1448#false, 1449#(= |#valid| |old(#valid)|), 1450#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|))), 1451#(and (= (store |#valid| main_~a~0.base 0) |old(#valid)|) (not (= 0 main_~a~0.base))), 1452#(and (= (store |#valid| main_~p~0.base 0) |old(#valid)|) (not (= 0 main_~p~0.base)))] [2018-02-02 10:08:47,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:08:47,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:08:47,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:08:47,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:08:47,206 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 6 states. [2018-02-02 10:08:47,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:47,289 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-02-02 10:08:47,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:08:47,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-02 10:08:47,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:47,290 INFO L225 Difference]: With dead ends: 83 [2018-02-02 10:08:47,290 INFO L226 Difference]: Without dead ends: 61 [2018-02-02 10:08:47,290 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:08:47,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-02 10:08:47,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-02-02 10:08:47,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-02 10:08:47,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-02-02 10:08:47,292 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 35 [2018-02-02 10:08:47,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:47,292 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-02-02 10:08:47,292 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:08:47,292 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-02-02 10:08:47,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:08:47,293 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:47,293 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] [2018-02-02 10:08:47,293 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:47,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1054481496, now seen corresponding path program 1 times [2018-02-02 10:08:47,294 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:47,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:47,497 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:47,498 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:47,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:08:47,498 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:47,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:47,499 INFO L182 omatonBuilderFactory]: Interpolants [1603#true, 1604#false, 1605#(= 0 |main_#t~malloc0.offset|), 1606#(= 0 main_~a~0.offset), 1607#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 1608#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 1609#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| |main_#t~malloc4.base|)) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base)), 1610#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= 1 (select |#valid| main_~t~0.base))), 1611#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 1612#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~a~0.base |main_#t~mem6.base|))), 1613#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 1614#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 1615#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 1616#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 1617#(= 1 (select |#valid| |main_#t~mem11.base|)), 1618#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:08:47,499 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:47,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:08:47,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:08:47,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:08:47,499 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 16 states. [2018-02-02 10:08:47,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:47,921 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2018-02-02 10:08:47,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:08:47,921 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-02-02 10:08:47,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:47,922 INFO L225 Difference]: With dead ends: 114 [2018-02-02 10:08:47,922 INFO L226 Difference]: Without dead ends: 114 [2018-02-02 10:08:47,922 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=239, Invalid=753, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:08:47,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-02 10:08:47,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 82. [2018-02-02 10:08:47,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 10:08:47,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2018-02-02 10:08:47,925 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 36 [2018-02-02 10:08:47,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:47,925 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2018-02-02 10:08:47,925 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:08:47,926 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2018-02-02 10:08:47,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:08:47,926 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:47,926 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] [2018-02-02 10:08:47,927 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:47,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1054481497, now seen corresponding path program 1 times [2018-02-02 10:08:47,928 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:47,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:48,211 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:48,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:08:48,212 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:48,212 INFO L182 omatonBuilderFactory]: Interpolants [1856#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem6.base|))), 1857#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 1858#(and (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 1859#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 1860#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 1861#(and (= 0 |main_#t~mem11.offset|) (= 8 (select |#length| |main_#t~mem11.base|))), 1862#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 1847#true, 1848#false, 1849#(= 0 |main_#t~malloc0.offset|), 1850#(= 0 main_~a~0.offset), 1851#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 1852#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 1853#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 1854#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 1855#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.base main_~a~0.base))] [2018-02-02 10:08:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:48,212 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:08:48,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:08:48,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:08:48,213 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 16 states. [2018-02-02 10:08:48,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:48,662 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2018-02-02 10:08:48,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:08:48,669 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-02-02 10:08:48,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:48,669 INFO L225 Difference]: With dead ends: 129 [2018-02-02 10:08:48,669 INFO L226 Difference]: Without dead ends: 129 [2018-02-02 10:08:48,670 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=208, Invalid=722, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:08:48,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-02 10:08:48,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 81. [2018-02-02 10:08:48,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 10:08:48,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-02-02 10:08:48,673 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 36 [2018-02-02 10:08:48,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:48,673 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-02-02 10:08:48,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:08:48,673 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-02-02 10:08:48,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 10:08:48,674 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:48,674 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 10:08:48,674 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:48,674 INFO L82 PathProgramCache]: Analyzing trace with hash -529462586, now seen corresponding path program 2 times [2018-02-02 10:08:48,675 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:48,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:49,011 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:49,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:49,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:08:49,011 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:49,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:49,012 INFO L182 omatonBuilderFactory]: Interpolants [2112#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 |main_#t~mem6.offset|) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem6.base|))), 2113#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 2114#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))), 2115#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))), 2116#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))), 2117#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ 0 4))) (= 8 (select |#length| |main_#t~mem11.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ 0 4)))), 2118#(or (and (= (select |#length| main_~p~0.base) 8) (<= 1 main_~p~0.offset)) (and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (<= (+ main_~p~0.offset 1) 0)), 2119#(or (and (= (select |#length| main_~p~0.base) 8) (<= 1 main_~p~0.offset)) (and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))), 2120#(and (= 0 |main_#t~mem11.offset|) (= 0 |main_#t~mem11.base|)), 2121#(and (= main_~p~0.base 0) (= main_~p~0.offset 0)), 2103#true, 2104#false, 2105#(= 0 |main_#t~malloc0.offset|), 2106#(= 0 main_~a~0.offset), 2107#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 2108#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 2109#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 2110#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 2111#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.base main_~a~0.base))] [2018-02-02 10:08:49,012 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:49,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:08:49,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:08:49,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:08:49,012 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 19 states. [2018-02-02 10:08:49,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:49,555 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2018-02-02 10:08:49,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:08:49,556 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2018-02-02 10:08:49,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:49,556 INFO L225 Difference]: With dead ends: 116 [2018-02-02 10:08:49,556 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 10:08:49,557 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=255, Invalid=1227, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:08:49,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 10:08:49,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 87. [2018-02-02 10:08:49,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-02 10:08:49,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2018-02-02 10:08:49,559 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 42 [2018-02-02 10:08:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:49,559 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2018-02-02 10:08:49,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:08:49,559 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2018-02-02 10:08:49,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 10:08:49,560 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:49,560 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] [2018-02-02 10:08:49,560 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:49,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1369291587, now seen corresponding path program 1 times [2018-02-02 10:08:49,560 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:49,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:49,752 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 10:08:49,753 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:49,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:08:49,753 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:49,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 10:08:49,753 INFO L182 omatonBuilderFactory]: Interpolants [2368#(= 0 main_~a~0.offset), 2369#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 2370#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 2371#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (not (= |main_#t~malloc4.base| 0)) (= main_~p~0.base main_~a~0.base)), 2372#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (not (= main_~t~0.base 0))), 2373#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0))), 2374#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) 0)) (not (= main_~a~0.base |main_#t~mem6.base|))), 2375#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) 0)) (not (= main_~p~0.base main_~a~0.base))), 2376#(and (= 0 main_~a~0.offset) (not (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)) 0))), 2377#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) 0))), 2378#(not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0)), 2379#(not (= |main_#t~mem11.base| 0)), 2380#(not (= main_~p~0.base 0)), 2365#true, 2366#false, 2367#(= 0 |main_#t~malloc0.offset|)] [2018-02-02 10:08:49,753 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 10:08:49,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:08:49,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:08:49,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:08:49,754 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 16 states. [2018-02-02 10:08:50,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:50,071 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-02-02 10:08:50,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:08:50,072 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2018-02-02 10:08:50,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:50,072 INFO L225 Difference]: With dead ends: 121 [2018-02-02 10:08:50,072 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 10:08:50,073 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=239, Invalid=817, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:08:50,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 10:08:50,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 87. [2018-02-02 10:08:50,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-02 10:08:50,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-02-02 10:08:50,075 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 45 [2018-02-02 10:08:50,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:50,075 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-02-02 10:08:50,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:08:50,075 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-02-02 10:08:50,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:08:50,076 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:50,076 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 10:08:50,076 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:50,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1676071261, now seen corresponding path program 3 times [2018-02-02 10:08:50,076 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:50,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:50,306 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:50,306 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:50,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:08:50,307 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:50,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 10:08:50,307 INFO L182 omatonBuilderFactory]: Interpolants [2624#false, 2625#(= 0 |main_#t~malloc0.offset|), 2626#(= 0 main_~a~0.offset), 2627#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 2628#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 2629#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base)), 2630#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 2631#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 2632#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem6.base|))), 2633#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 2634#(and (not (= main_~a~0.base |main_#t~malloc4.base|)) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 2635#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 2636#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 2637#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~a~0.base |main_#t~mem6.base|))), 2638#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 2639#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 2640#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 2641#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 2642#(= 1 (select |#valid| |main_#t~mem11.base|)), 2643#(= 1 (select |#valid| main_~p~0.base)), 2623#true] [2018-02-02 10:08:50,307 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:50,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:08:50,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:08:50,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:08:50,308 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 21 states. [2018-02-02 10:08:50,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:50,930 INFO L93 Difference]: Finished difference Result 142 states and 154 transitions. [2018-02-02 10:08:50,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:08:50,930 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2018-02-02 10:08:50,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:50,931 INFO L225 Difference]: With dead ends: 142 [2018-02-02 10:08:50,931 INFO L226 Difference]: Without dead ends: 142 [2018-02-02 10:08:50,931 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=365, Invalid=1441, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:08:50,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-02 10:08:50,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 110. [2018-02-02 10:08:50,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-02 10:08:50,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2018-02-02 10:08:50,934 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 47 [2018-02-02 10:08:50,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:50,934 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2018-02-02 10:08:50,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:08:50,934 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2018-02-02 10:08:50,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:08:50,935 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:50,935 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 10:08:50,935 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:50,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1676071262, now seen corresponding path program 2 times [2018-02-02 10:08:50,936 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:50,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:51,355 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:51,355 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:51,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:08:51,355 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:51,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:51,356 INFO L182 omatonBuilderFactory]: Interpolants [2944#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 2945#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 2946#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|)), 2947#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 2948#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 2949#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem6.base|))), 2950#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 2951#(and (<= 0 main_~p~0.offset) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 2952#(and (<= 0 main_~p~0.offset) (not (= main_~a~0.base |main_#t~malloc4.base|)) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 2953#(and (<= 0 main_~p~0.offset) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 2954#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (<= 8 (select |#length| main_~p~0.base))), 2955#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem6.base|))), 2956#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 2957#(and (= 0 main_~a~0.offset) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))), 2958#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 2959#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 2960#(and (<= 8 (select |#length| |main_#t~mem11.base|)) (= 0 |main_#t~mem11.offset|)), 2961#(and (= main_~p~0.offset 0) (<= 8 (select |#length| main_~p~0.base))), 2940#true, 2941#false, 2942#(= 0 |main_#t~malloc0.offset|), 2943#(= 0 main_~a~0.offset)] [2018-02-02 10:08:51,356 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:51,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:08:51,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:08:51,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:08:51,357 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 22 states. [2018-02-02 10:08:52,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:52,289 INFO L93 Difference]: Finished difference Result 157 states and 169 transitions. [2018-02-02 10:08:52,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:08:52,290 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2018-02-02 10:08:52,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:52,291 INFO L225 Difference]: With dead ends: 157 [2018-02-02 10:08:52,291 INFO L226 Difference]: Without dead ends: 157 [2018-02-02 10:08:52,292 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=416, Invalid=2034, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 10:08:52,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-02 10:08:52,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 109. [2018-02-02 10:08:52,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-02 10:08:52,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2018-02-02 10:08:52,295 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 47 [2018-02-02 10:08:52,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:52,295 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2018-02-02 10:08:52,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:08:52,295 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2018-02-02 10:08:52,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:08:52,296 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:52,296 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, 1] [2018-02-02 10:08:52,296 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:52,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1468082325, now seen corresponding path program 2 times [2018-02-02 10:08:52,297 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:52,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:52,603 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:08:52,603 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:52,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:08:52,604 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:52,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:52,604 INFO L182 omatonBuilderFactory]: Interpolants [3296#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base))), 3297#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 3298#(and (= main_~p~0.offset 0) (not (= 0 main_~p~0.base)) (= 1 (select (store |#valid| main_~p~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 3299#(and (= main_~p~0.offset 0) (not (= main_~p~0.base 0)) (= 1 (select (store |#valid| main_~p~0.base 0) |main_#t~mem13.base|))), 3300#(and (= main_~p~0.offset 0) (not (= main_~p~0.base 0)) (= 1 (select (store |#valid| main_~p~0.base 0) main_~t~0.base))), 3301#(= 1 (select |#valid| main_~t~0.base)), 3302#(= (select |#valid| main_~p~0.base) 1), 3284#true, 3285#false, 3286#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 3287#(and (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base))), 3288#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 3289#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 3290#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| |main_#t~malloc4.base|)) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base)), 3291#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base) (= 1 (select |#valid| main_~t~0.base))), 3292#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 3293#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem6.base|))), 3294#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base main_~a~0.base))), 3295#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= main_~a~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))))] [2018-02-02 10:08:52,604 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:08:52,605 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:08:52,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:08:52,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:08:52,605 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 19 states. [2018-02-02 10:08:53,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:53,070 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2018-02-02 10:08:53,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:08:53,071 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-02-02 10:08:53,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:53,071 INFO L225 Difference]: With dead ends: 132 [2018-02-02 10:08:53,071 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 10:08:53,071 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=332, Invalid=1074, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:08:53,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 10:08:53,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 119. [2018-02-02 10:08:53,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 10:08:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 130 transitions. [2018-02-02 10:08:53,074 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 130 transitions. Word has length 51 [2018-02-02 10:08:53,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:53,074 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 130 transitions. [2018-02-02 10:08:53,074 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:08:53,074 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 130 transitions. [2018-02-02 10:08:53,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:08:53,075 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:53,075 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, 1] [2018-02-02 10:08:53,075 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:53,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1468082326, now seen corresponding path program 1 times [2018-02-02 10:08:53,076 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:53,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:53,378 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:08:53,378 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:53,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:08:53,378 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:53,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:53,379 INFO L182 omatonBuilderFactory]: Interpolants [3592#true, 3593#false, 3594#(= 0 |main_#t~malloc0.offset|), 3595#(= 0 main_~a~0.offset), 3596#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 3597#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 3598#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 3599#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 3600#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.base main_~a~0.base)), 3601#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem6.base|))), 3602#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 3603#(and (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 3604#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 3605#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= main_~p~0.base main_~a~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))))), 3606#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 3607#(and (= 8 (select |#length| |main_#t~mem13.base|)) (= 0 |main_#t~mem13.offset|) (= main_~p~0.offset 0)), 3608#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset) (= main_~p~0.offset 0)), 3609#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset)), 3610#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 10:08:53,379 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:08:53,379 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:08:53,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:08:53,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:08:53,379 INFO L87 Difference]: Start difference. First operand 119 states and 130 transitions. Second operand 19 states. [2018-02-02 10:08:53,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:53,925 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2018-02-02 10:08:53,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:08:53,925 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-02-02 10:08:53,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:53,926 INFO L225 Difference]: With dead ends: 143 [2018-02-02 10:08:53,926 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 10:08:53,926 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=296, Invalid=1110, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:08:53,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 10:08:53,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 118. [2018-02-02 10:08:53,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-02 10:08:53,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2018-02-02 10:08:53,928 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 51 [2018-02-02 10:08:53,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:53,928 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2018-02-02 10:08:53,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:08:53,928 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2018-02-02 10:08:53,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:08:53,929 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:53,929 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] [2018-02-02 10:08:53,929 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:53,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1734089685, now seen corresponding path program 1 times [2018-02-02 10:08:53,929 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:53,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:08:54,083 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:54,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:08:54,083 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:54,084 INFO L182 omatonBuilderFactory]: Interpolants [3910#true, 3911#false, 3912#(= 0 |main_#t~malloc0.offset|), 3913#(= 0 main_~a~0.offset), 3914#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 3915#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 3916#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (not (= |main_#t~malloc4.base| 0)) (= main_~p~0.base main_~a~0.base)), 3917#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (not (= main_~t~0.base 0))), 3918#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0))), 3919#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) 0)) (not (= main_~a~0.base |main_#t~mem6.base|))), 3920#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) 0)) (not (= main_~p~0.base main_~a~0.base))), 3921#(and (= 0 main_~a~0.offset) (not (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)) 0))), 3922#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) 0))), 3923#(not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0)), 3924#(not (= |main_#t~mem13.base| 0)), 3925#(not (= main_~t~0.base 0)), 3926#(not (= main_~p~0.base 0))] [2018-02-02 10:08:54,084 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:08:54,084 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:08:54,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:08:54,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:08:54,084 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand 17 states. [2018-02-02 10:08:54,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:54,575 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2018-02-02 10:08:54,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:08:54,575 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-02-02 10:08:54,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:54,576 INFO L225 Difference]: With dead ends: 140 [2018-02-02 10:08:54,576 INFO L226 Difference]: Without dead ends: 140 [2018-02-02 10:08:54,577 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=290, Invalid=1042, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:08:54,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-02 10:08:54,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 116. [2018-02-02 10:08:54,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 10:08:54,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2018-02-02 10:08:54,580 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 52 [2018-02-02 10:08:54,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:54,580 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2018-02-02 10:08:54,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:08:54,580 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2018-02-02 10:08:54,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:08:54,581 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:54,581 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:54,581 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:54,581 INFO L82 PathProgramCache]: Analyzing trace with hash -589223925, now seen corresponding path program 4 times [2018-02-02 10:08:54,583 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:54,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:55,216 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:55,217 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:55,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:08:55,217 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:55,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 10:08:55,217 INFO L182 omatonBuilderFactory]: Interpolants [4224#false, 4225#(= 0 |main_#t~malloc0.offset|), 4226#(= 0 main_~a~0.offset), 4227#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 4228#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 4229#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| |main_#t~malloc4.base|)) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 4230#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= 1 (select |#valid| main_~t~0.base))), 4231#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 4232#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 1 (select |#valid| |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 |main_#t~mem6.offset|) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| |main_#t~mem6.base|)) (not (= main_~a~0.base |main_#t~mem6.base|))), 4233#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (or (<= (+ main_~p~0.offset 1) 0) (= main_~p~0.offset 0)) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 4234#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 4235#(and (not (= main_~a~0.base |main_#t~malloc4.base|)) (= 0 main_~a~0.offset) (= 1 (select |#valid| |main_#t~malloc4.base|)) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 4236#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base)) (= 1 (select |#valid| main_~t~0.base)) (not (= main_~a~0.base main_~t~0.base))), 4237#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base))), 4238#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|)) (not (= main_~a~0.base |main_#t~mem6.base|))), 4239#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 4240#(and (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 4241#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 4242#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 4243#(and (= 0 |main_#t~mem11.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ 0 4)))) (= 8 (select |#length| |main_#t~mem11.base|))), 4244#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 4245#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (and (= (select |#length| main_~p~0.base) 8) (or (<= (+ main_~p~0.offset 1) 0) (<= 1 main_~p~0.offset)))), 4246#(or (and (= (select |#length| main_~p~0.base) 8) (<= 1 main_~p~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 4247#(= 1 (select |#valid| |main_#t~mem11.base|)), 4248#(= 1 (select |#valid| main_~p~0.base)), 4223#true] [2018-02-02 10:08:55,217 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:55,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:08:55,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:08:55,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:08:55,218 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand 26 states. [2018-02-02 10:08:56,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:56,279 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2018-02-02 10:08:56,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:08:56,279 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 53 [2018-02-02 10:08:56,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:56,280 INFO L225 Difference]: With dead ends: 161 [2018-02-02 10:08:56,280 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 10:08:56,280 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=413, Invalid=2137, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 10:08:56,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 10:08:56,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 123. [2018-02-02 10:08:56,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 10:08:56,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2018-02-02 10:08:56,282 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 53 [2018-02-02 10:08:56,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:56,282 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2018-02-02 10:08:56,282 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:08:56,282 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2018-02-02 10:08:56,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:08:56,283 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:56,283 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:56,283 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:56,283 INFO L82 PathProgramCache]: Analyzing trace with hash -589223924, now seen corresponding path program 3 times [2018-02-02 10:08:56,284 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:56,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:56,778 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:56,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:56,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:08:56,778 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:56,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:56,779 INFO L182 omatonBuilderFactory]: Interpolants [4583#true, 4584#false, 4585#(= 0 |main_#t~malloc0.offset|), 4586#(= 0 main_~a~0.offset), 4587#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 4588#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 4589#(and (= (select |#valid| |main_#t~malloc4.base|) 1) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 4590#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= (select |#valid| main_~t~0.base) 1)), 4591#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 4592#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 |main_#t~mem6.offset|) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| |main_#t~mem6.base|)) (= (select |#valid| |main_#t~mem6.base|) 1) (not (= main_~a~0.base |main_#t~mem6.base|))), 4593#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 4594#(and (not (= main_~a~0.base |main_#t~malloc4.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base)) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 4595#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 8 (select |#length| main_~p~0.base)) (not (= main_~a~0.base main_~t~0.base))), 4596#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (= 8 (select |#length| main_~p~0.base))), 4597#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|)) (not (= main_~a~0.base |main_#t~mem6.base|))), 4598#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 4599#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 4600#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))), 4601#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))), 4602#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ 0 4)))) (= 8 (select |#length| |main_#t~mem11.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ 0 4)))), 4603#(or (and (= (select |#length| main_~p~0.base) 8) (<= 1 main_~p~0.offset)) (<= (+ main_~p~0.offset 1) 0) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))), 4604#(or (and (= (select |#length| main_~p~0.base) 8) (<= 1 main_~p~0.offset)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))), 4605#(and (= 0 |main_#t~mem11.offset|) (= 8 (select |#length| |main_#t~mem11.base|))), 4606#(and (= main_~p~0.offset 0) (= 8 (select |#length| main_~p~0.base)))] [2018-02-02 10:08:56,779 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:56,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:08:56,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:08:56,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:08:56,780 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand 24 states. [2018-02-02 10:08:57,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:57,805 INFO L93 Difference]: Finished difference Result 176 states and 189 transitions. [2018-02-02 10:08:57,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:08:57,805 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 53 [2018-02-02 10:08:57,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:57,806 INFO L225 Difference]: With dead ends: 176 [2018-02-02 10:08:57,806 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 10:08:57,806 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=329, Invalid=1833, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:08:57,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 10:08:57,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 122. [2018-02-02 10:08:57,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 10:08:57,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2018-02-02 10:08:57,809 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 53 [2018-02-02 10:08:57,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:57,810 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2018-02-02 10:08:57,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:08:57,810 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2018-02-02 10:08:57,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:08:57,810 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:57,811 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:57,811 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:57,811 INFO L82 PathProgramCache]: Analyzing trace with hash -864298018, now seen corresponding path program 3 times [2018-02-02 10:08:57,811 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:57,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:58,024 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:08:58,024 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:58,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:08:58,024 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:58,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:58,024 INFO L182 omatonBuilderFactory]: Interpolants [4960#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) 0)) (not (= main_~a~0.base |main_#t~mem6.base|))), 4961#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) 0)) (not (= main_~p~0.base main_~a~0.base))), 4962#(and (not (= main_~a~0.base |main_#t~malloc4.base|)) (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) 0)) (not (= main_~p~0.base main_~a~0.base))), 4963#(and (= 0 main_~a~0.offset) (not (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)) 0)) (not (= main_~a~0.base main_~t~0.base))), 4964#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) 0))), 4965#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) 0)) (not (= main_~a~0.base |main_#t~mem6.base|))), 4966#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) 0)) (not (= main_~p~0.base main_~a~0.base))), 4967#(and (= 0 main_~a~0.offset) (not (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)) 0))), 4968#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) 0))), 4969#(and (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0))), 4970#(not (= |main_#t~mem11.base| 0)), 4971#(not (= main_~p~0.base 0)), 4951#true, 4952#false, 4953#(= 0 |main_#t~malloc0.offset|), 4954#(= 0 main_~a~0.offset), 4955#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 4956#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 4957#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (not (= |main_#t~malloc4.base| 0)) (= main_~p~0.base main_~a~0.base)), 4958#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (not (= main_~t~0.base 0))), 4959#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0)))] [2018-02-02 10:08:58,025 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:08:58,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:08:58,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:08:58,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:08:58,025 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand 21 states. [2018-02-02 10:08:58,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:58,468 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2018-02-02 10:08:58,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:08:58,468 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-02-02 10:08:58,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:58,468 INFO L225 Difference]: With dead ends: 141 [2018-02-02 10:08:58,468 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 10:08:58,469 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=301, Invalid=1181, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:08:58,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 10:08:58,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 128. [2018-02-02 10:08:58,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-02 10:08:58,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2018-02-02 10:08:58,471 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 56 [2018-02-02 10:08:58,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:58,471 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2018-02-02 10:08:58,471 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:08:58,472 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-02-02 10:08:58,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 10:08:58,472 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:58,472 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:58,472 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:58,472 INFO L82 PathProgramCache]: Analyzing trace with hash 771432777, now seen corresponding path program 4 times [2018-02-02 10:08:58,473 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:58,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:08:58,806 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:08:58,806 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:08:58,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:08:58,806 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:08:58,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:08:58,807 INFO L182 omatonBuilderFactory]: Interpolants [5280#(= 0 main_~a~0.offset), 5281#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 5282#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 5283#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|)), 5284#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 5285#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.base main_~a~0.base)), 5286#(and (= 0 main_~a~0.offset) (= 0 |main_#t~mem6.offset|) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem6.base|))), 5287#(and (or (and (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))) (<= (+ main_~p~0.offset 1) 0)) (= 0 main_~a~0.offset)), 5288#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))), 5289#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))), 5290#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))) (+ 0 4))) (= main_~p~0.base main_~a~0.base)), 5291#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))), 5292#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) (+ 0 4)))), 5293#(and (= 0 (select (select |#memory_$Pointer$.base| main_~t~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~t~0.base) (+ 0 4)))), 5294#(or (and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (<= (+ main_~p~0.offset 1) 0) (<= 1 main_~p~0.offset)), 5295#(or (and (= 0 |main_#t~mem13.offset|) (= 0 |main_#t~mem13.base|)) (<= (+ main_~p~0.offset 1) 0) (<= 1 main_~p~0.offset)), 5296#(or (and (= 0 main_~t~0.offset) (= 0 main_~t~0.base)) (<= (+ main_~p~0.offset 1) 0) (<= 1 main_~p~0.offset)), 5297#(and (= 0 main_~t~0.offset) (= 0 main_~t~0.base)), 5298#(and (= main_~p~0.base 0) (= main_~p~0.offset 0)), 5277#true, 5278#false, 5279#(= 0 |main_#t~malloc0.offset|)] [2018-02-02 10:08:58,807 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:08:58,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:08:58,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:08:58,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:08:58,807 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand 22 states. [2018-02-02 10:08:59,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:08:59,537 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-02-02 10:08:59,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:08:59,537 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2018-02-02 10:08:59,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:08:59,538 INFO L225 Difference]: With dead ends: 140 [2018-02-02 10:08:59,538 INFO L226 Difference]: Without dead ends: 140 [2018-02-02 10:08:59,538 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=309, Invalid=1761, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:08:59,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-02 10:08:59,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2018-02-02 10:08:59,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-02 10:08:59,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2018-02-02 10:08:59,540 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 57 [2018-02-02 10:08:59,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:08:59,541 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2018-02-02 10:08:59,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:08:59,541 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2018-02-02 10:08:59,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:08:59,541 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:08:59,541 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:08:59,542 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:08:59,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1855389193, now seen corresponding path program 2 times [2018-02-02 10:08:59,542 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:08:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:08:59,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:00,146 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:09:00,147 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:09:00,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:09:00,147 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:00,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:00,147 INFO L182 omatonBuilderFactory]: Interpolants [5632#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= |old(#valid)| (store (store |#valid| main_~a~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0)) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 5633#(and (= (store (store |#valid| main_~a~0.base 0) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4) 0) |old(#valid)|) (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem6.base|))), 5634#(and (= (store (store |#valid| main_~a~0.base 0) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4) 0) |old(#valid)|) (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base main_~a~0.base))), 5635#(and (= (store (store |#valid| main_~a~0.base 0) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) 4) 0) |old(#valid)|) (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (not (= main_~a~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 5636#(and (= (store (store |#valid| main_~a~0.base 0) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4) 0) |old(#valid)|) (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base))), 5637#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base) (= (store (store |#valid| main_~a~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) |old(#valid)|)), 5638#(and (= |old(#valid)| (store (store |#valid| main_~p~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= 0 main_~p~0.base))), 5639#(and (= (store (store |#valid| main_~p~0.base 0) |main_#t~mem13.base| 0) |old(#valid)|) (not (= main_~p~0.base |main_#t~mem13.base|)) (not (= main_~p~0.base 0))), 5640#(and (= |old(#valid)| (store (store |#valid| main_~p~0.base 0) main_~t~0.base 0)) (not (= main_~p~0.base 0)) (not (= main_~p~0.base main_~t~0.base))), 5641#(= |old(#valid)| (store |#valid| main_~t~0.base 0)), 5642#(= (store |#valid| main_~p~0.base 0) |old(#valid)|), 5643#(and (= (store |#valid| main_~p~0.base 0) |old(#valid)|) (or (not (= main_~p~0.offset 0)) (not (= main_~p~0.base 0)))), 5623#true, 5624#false, 5625#(= |#valid| |old(#valid)|), 5626#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 5627#(and (= (store |#valid| main_~a~0.base 0) |old(#valid)|) (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base))), 5628#(and (= (store |#valid| main_~a~0.base 0) |old(#valid)|) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 5629#(and (= (store |#valid| main_~a~0.base 0) |old(#valid)|) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 5630#(and (= (store (store |#valid| main_~a~0.base 0) |main_#t~malloc4.base| 0) |old(#valid)|) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base)), 5631#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base main_~t~0.base)) (= (store (store |#valid| main_~a~0.base 0) main_~t~0.base 0) |old(#valid)|) (= main_~p~0.base main_~a~0.base))] [2018-02-02 10:09:00,147 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:09:00,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:09:00,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:09:00,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:09:00,148 INFO L87 Difference]: Start difference. First operand 136 states and 145 transitions. Second operand 21 states. [2018-02-02 10:09:00,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:00,682 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-02-02 10:09:00,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:09:00,682 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2018-02-02 10:09:00,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:00,683 INFO L225 Difference]: With dead ends: 138 [2018-02-02 10:09:00,683 INFO L226 Difference]: Without dead ends: 104 [2018-02-02 10:09:00,683 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=180, Invalid=1080, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:09:00,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-02 10:09:00,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-02-02 10:09:00,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-02 10:09:00,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2018-02-02 10:09:00,685 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 58 [2018-02-02 10:09:00,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:00,685 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2018-02-02 10:09:00,685 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:09:00,685 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2018-02-02 10:09:00,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:09:00,685 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:00,685 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 10:09:00,685 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:09:00,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1614858440, now seen corresponding path program 5 times [2018-02-02 10:09:00,686 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:00,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:01,244 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:01,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:09:01,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:09:01,244 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:01,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:01,245 INFO L182 omatonBuilderFactory]: Interpolants [5916#true, 5917#false, 5918#(= |main_#t~malloc0.offset| 0), 5919#(= main_~a~0.offset 0), 5920#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0)), 5921#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0)), 5922#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0)), 5923#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0)), 5924#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0)), 5925#(and (= (select |#valid| main_~a~0.base) 1) (= main_~a~0.offset 0) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem6.base|)) (= main_~i~0 0)), 5926#(and (<= 1 main_~i~0) (= (select |#valid| main_~a~0.base) 1) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 5927#(and (not (= main_~a~0.base |main_#t~malloc4.base|)) (<= 1 main_~i~0) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 5928#(and (<= 1 main_~i~0) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~a~0.base main_~t~0.base))), 5929#(and (<= 1 main_~i~0) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~a~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 5930#(and (<= 1 main_~i~0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem6.base|))), 5931#(and (<= 2 main_~i~0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~a~0.base))), 5932#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base)) (or (and (<= 2 main_~i~0) (= main_~a~0.offset |main_#t~malloc4.offset|)) (not (= main_~a~0.base |main_#t~malloc4.base|)))), 5933#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (or (and (<= 2 main_~i~0) (= main_~a~0.offset main_~t~0.offset)) (not (= main_~a~0.base main_~t~0.base)))), 5934#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (or (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (and (<= 2 main_~i~0) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))), 5935#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (or (and (<= 2 main_~i~0) (= main_~a~0.offset |main_#t~mem6.offset|)) (not (= main_~a~0.base |main_#t~mem6.base|)))), 5936#(and (= 0 main_~a~0.offset) (or (and (not (= main_~i~0 0)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))))), 5937#(and (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))) (and (not (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 0)) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))) (= 0 main_~a~0.offset)), 5938#(and (or (not (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))) (= 0 main_~a~0.offset)), 5939#(and (or (not (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) main_~i~0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))) (= main_~p~0.offset 0)), 5940#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= |main_#t~mem10| main_~i~0))) (= main_~p~0.offset 0)), 5941#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 5942#(= 1 (select |#valid| |main_#t~mem11.base|)), 5943#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:09:01,245 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:01,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:09:01,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:09:01,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:09:01,245 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 28 states. [2018-02-02 10:09:02,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:02,620 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2018-02-02 10:09:02,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:09:02,621 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2018-02-02 10:09:02,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:02,621 INFO L225 Difference]: With dead ends: 150 [2018-02-02 10:09:02,621 INFO L226 Difference]: Without dead ends: 150 [2018-02-02 10:09:02,622 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=465, Invalid=2397, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 10:09:02,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-02 10:09:02,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 127. [2018-02-02 10:09:02,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-02 10:09:02,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2018-02-02 10:09:02,624 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 58 [2018-02-02 10:09:02,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:02,624 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 138 transitions. [2018-02-02 10:09:02,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 10:09:02,624 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2018-02-02 10:09:02,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:09:02,625 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:02,625 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 10:09:02,625 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:09:02,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1614858439, now seen corresponding path program 4 times [2018-02-02 10:09:02,625 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:02,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:03,376 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:03,376 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:09:03,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:09:03,376 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:03,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:03,377 INFO L182 omatonBuilderFactory]: Interpolants [6273#true, 6274#false, 6275#(= |main_#t~malloc0.offset| 0), 6276#(= main_~a~0.offset 0), 6277#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0)), 6278#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0)), 6279#(and (= (select |#valid| |main_#t~malloc4.base|) 1) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|)) (= main_~i~0 0)), 6280#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0) (= (select |#valid| main_~t~0.base) 1)), 6281#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0)), 6282#(and (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| |main_#t~mem6.base|)) (= (select |#valid| |main_#t~mem6.base|) 1) (not (= main_~a~0.base |main_#t~mem6.base|)) (= main_~i~0 0)), 6283#(and (<= 1 main_~i~0) (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 6284#(and (not (= main_~a~0.base |main_#t~malloc4.base|)) (<= 1 main_~i~0) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 6285#(and (<= 1 main_~i~0) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base)) (not (= main_~a~0.base main_~t~0.base))), 6286#(and (<= 1 main_~i~0) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base))), 6287#(and (<= 1 main_~i~0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem6.base|))), 6288#(and (<= 2 main_~i~0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~a~0.base))), 6289#(and (<= 2 main_~i~0) (= main_~a~0.offset |main_#t~malloc4.offset|) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 6290#(and (<= 2 main_~i~0) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~t~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))))), 6291#(and (<= 2 main_~i~0) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 6292#(and (<= 2 main_~i~0) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset |main_#t~mem6.offset|)), 6293#(and (or (and (not (= main_~i~0 0)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)))) (= 0 main_~a~0.offset)), 6294#(and (= 0 main_~a~0.offset) (or (and (not (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 0)) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset)) (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))))), 6295#(and (= 0 main_~a~0.offset) (or (not (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 0)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))))), 6296#(and (= main_~p~0.offset 0) (or (not (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) main_~i~0)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))), 6297#(and (or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= |main_#t~mem10| main_~i~0))) (= main_~p~0.offset 0)), 6298#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 6299#(and (= 0 |main_#t~mem11.offset|) (= 8 (select |#length| |main_#t~mem11.base|))), 6300#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 10:09:03,377 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:03,377 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:09:03,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:09:03,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:09:03,377 INFO L87 Difference]: Start difference. First operand 127 states and 138 transitions. Second operand 28 states. [2018-02-02 10:09:04,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:04,726 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2018-02-02 10:09:04,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:09:04,727 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2018-02-02 10:09:04,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:04,727 INFO L225 Difference]: With dead ends: 164 [2018-02-02 10:09:04,727 INFO L226 Difference]: Without dead ends: 164 [2018-02-02 10:09:04,728 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=477, Invalid=2493, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 10:09:04,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-02-02 10:09:04,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 126. [2018-02-02 10:09:04,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 10:09:04,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2018-02-02 10:09:04,730 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 58 [2018-02-02 10:09:04,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:04,730 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2018-02-02 10:09:04,730 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 10:09:04,730 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2018-02-02 10:09:04,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:09:04,730 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:04,730 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:04,730 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:09:04,730 INFO L82 PathProgramCache]: Analyzing trace with hash 2126464057, now seen corresponding path program 6 times [2018-02-02 10:09:04,731 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:04,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:05,511 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:05,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:09:05,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:09:05,511 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:05,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:05,511 INFO L182 omatonBuilderFactory]: Interpolants [6656#(and (not (= main_~a~0.base |main_#t~malloc4.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base)) (= 0 |main_#t~malloc4.offset|)), 6657#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 8 (select |#length| main_~p~0.base)) (not (= main_~a~0.base main_~t~0.base))), 6658#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base))), 6659#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|)) (= 0 |main_#t~mem6.offset|) (not (= main_~a~0.base |main_#t~mem6.base|))), 6660#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base)) (or (and (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (<= (+ main_~p~0.offset 1) 0))), 6661#(and (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= main_~p~0.offset 0) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 6662#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (+ 0 4))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))), 6663#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))), 6664#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ 0 4))) (+ 0 4))) (= 8 (select |#length| |main_#t~mem11.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ 0 4)))), 6665#(or (and (= (select |#length| main_~p~0.base) 8) (<= 1 main_~p~0.offset)) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (<= (+ main_~p~0.offset 1) 0)), 6666#(or (and (= (select |#length| main_~p~0.base) 8) (<= 1 main_~p~0.offset)) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))))), 6667#(and (= 0 |main_#t~mem11.offset|) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ 0 4)))), 6668#(or (and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (<= (+ main_~p~0.offset 1) 0)), 6669#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 6670#(and (= 0 |main_#t~mem11.offset|) (= 0 |main_#t~mem11.base|)), 6671#(and (= main_~p~0.base 0) (= main_~p~0.offset 0)), 6645#true, 6646#false, 6647#(= 0 |main_#t~malloc0.offset|), 6648#(= 0 main_~a~0.offset), 6649#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 6650#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 6651#(and (= (select |#valid| |main_#t~malloc4.base|) 1) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 6652#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= (select |#valid| main_~t~0.base) 1)), 6653#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 6654#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 |main_#t~mem6.offset|) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| |main_#t~mem6.base|)) (= (select |#valid| |main_#t~mem6.base|) 1) (not (= main_~a~0.base |main_#t~mem6.base|))), 6655#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base)))] [2018-02-02 10:09:05,512 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:05,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:09:05,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:09:05,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:09:05,512 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand 27 states. [2018-02-02 10:09:06,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:06,730 INFO L93 Difference]: Finished difference Result 153 states and 163 transitions. [2018-02-02 10:09:06,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:09:06,730 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 59 [2018-02-02 10:09:06,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:06,730 INFO L225 Difference]: With dead ends: 153 [2018-02-02 10:09:06,731 INFO L226 Difference]: Without dead ends: 153 [2018-02-02 10:09:06,731 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=338, Invalid=2418, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 10:09:06,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-02 10:09:06,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 132. [2018-02-02 10:09:06,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-02 10:09:06,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2018-02-02 10:09:06,733 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 59 [2018-02-02 10:09:06,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:06,733 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2018-02-02 10:09:06,734 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:09:06,734 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2018-02-02 10:09:06,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:09:06,734 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:06,734 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:06,734 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:09:06,735 INFO L82 PathProgramCache]: Analyzing trace with hash -2102581008, now seen corresponding path program 5 times [2018-02-02 10:09:06,735 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:06,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:06,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:07,196 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:09:07,196 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:09:07,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:09:07,197 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:07,197 INFO L182 omatonBuilderFactory]: Interpolants [7009#true, 7010#false, 7011#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 7012#(and (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base))), 7013#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 7014#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 7015#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base)), 7016#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 7017#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 7018#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|) (not (= 0 main_~a~0.base)) (not (= main_~a~0.base |main_#t~mem6.base|))), 7019#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 7020#(and (not (= main_~a~0.base |main_#t~malloc4.base|)) (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 7021#(and (not (= main_~a~0.base main_~p~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (not (= 0 main_~a~0.base)) (not (= main_~a~0.base main_~t~0.base))), 7022#(and (not (= main_~a~0.base main_~p~0.base)) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 7023#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= main_~a~0.base |main_#t~mem6.base|))), 7024#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base main_~a~0.base))), 7025#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= main_~a~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 7026#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base))), 7027#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 7028#(and (= main_~p~0.offset 0) (not (= 0 main_~p~0.base)) (= 1 (select (store |#valid| main_~p~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 7029#(and (= main_~p~0.offset 0) (not (= main_~p~0.base 0)) (= 1 (select (store |#valid| main_~p~0.base 0) |main_#t~mem13.base|))), 7030#(and (= main_~p~0.offset 0) (not (= main_~p~0.base 0)) (= 1 (select (store |#valid| main_~p~0.base 0) main_~t~0.base))), 7031#(= 1 (select |#valid| main_~t~0.base)), 7032#(= (select |#valid| main_~p~0.base) 1)] [2018-02-02 10:09:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:09:07,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:09:07,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:09:07,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:09:07,198 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand 24 states. [2018-02-02 10:09:07,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:07,933 INFO L93 Difference]: Finished difference Result 151 states and 161 transitions. [2018-02-02 10:09:07,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:09:07,933 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 62 [2018-02-02 10:09:07,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:07,934 INFO L225 Difference]: With dead ends: 151 [2018-02-02 10:09:07,934 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 10:09:07,934 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=369, Invalid=1701, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:09:07,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 10:09:07,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 142. [2018-02-02 10:09:07,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 10:09:07,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 154 transitions. [2018-02-02 10:09:07,937 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 154 transitions. Word has length 62 [2018-02-02 10:09:07,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:07,937 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 154 transitions. [2018-02-02 10:09:07,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:09:07,937 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 154 transitions. [2018-02-02 10:09:07,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:09:07,938 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:07,938 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:07,938 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:09:07,938 INFO L82 PathProgramCache]: Analyzing trace with hash -2102581007, now seen corresponding path program 2 times [2018-02-02 10:09:07,939 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:07,951 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:08,361 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:09:08,362 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:09:08,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:09:08,362 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:08,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:08,362 INFO L182 omatonBuilderFactory]: Interpolants [7392#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset)), 7393#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 7370#true, 7371#false, 7372#(= 0 |main_#t~malloc0.offset|), 7373#(= 0 main_~a~0.offset), 7374#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 7375#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 7376#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 7377#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 7378#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 7379#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| |main_#t~mem6.base|)) (not (= main_~a~0.base |main_#t~mem6.base|))), 7380#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 7381#(and (not (= main_~a~0.base |main_#t~malloc4.base|)) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 7382#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base)) (not (= main_~a~0.base main_~t~0.base))), 7383#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base))), 7384#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem6.base|))), 7385#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 7386#(and (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 7387#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 7388#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= main_~p~0.base main_~a~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))))), 7389#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 7390#(and (= 8 (select |#length| |main_#t~mem13.base|)) (= 0 |main_#t~mem13.offset|) (= main_~p~0.offset 0)), 7391#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset) (= main_~p~0.offset 0))] [2018-02-02 10:09:08,362 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:09:08,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:09:08,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:09:08,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:09:08,363 INFO L87 Difference]: Start difference. First operand 142 states and 154 transitions. Second operand 24 states. [2018-02-02 10:09:09,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:09,158 INFO L93 Difference]: Finished difference Result 162 states and 172 transitions. [2018-02-02 10:09:09,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:09:09,158 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 62 [2018-02-02 10:09:09,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:09,159 INFO L225 Difference]: With dead ends: 162 [2018-02-02 10:09:09,159 INFO L226 Difference]: Without dead ends: 162 [2018-02-02 10:09:09,160 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=374, Invalid=1696, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:09:09,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-02 10:09:09,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 141. [2018-02-02 10:09:09,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-02 10:09:09,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-02-02 10:09:09,162 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 62 [2018-02-02 10:09:09,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:09,162 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-02-02 10:09:09,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:09:09,162 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-02-02 10:09:09,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:09:09,162 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:09,162 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:09,162 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:09:09,162 INFO L82 PathProgramCache]: Analyzing trace with hash -755503312, now seen corresponding path program 3 times [2018-02-02 10:09:09,163 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:09,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:09,453 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:09:09,453 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:09:09,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:09:09,454 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:09,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:09,454 INFO L182 omatonBuilderFactory]: Interpolants [7744#(= 0 main_~a~0.offset), 7745#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 7746#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 7747#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (not (= |main_#t~malloc4.base| 0)) (= main_~p~0.base main_~a~0.base)), 7748#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (not (= main_~t~0.base 0))), 7749#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0))), 7750#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) 0)) (not (= main_~a~0.base |main_#t~mem6.base|))), 7751#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) 0)) (not (= main_~p~0.base main_~a~0.base))), 7752#(and (not (= main_~a~0.base |main_#t~malloc4.base|)) (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) 0)) (not (= main_~p~0.base main_~a~0.base))), 7753#(and (= 0 main_~a~0.offset) (not (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)) 0)) (not (= main_~a~0.base main_~t~0.base))), 7754#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) 0))), 7755#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) 0)) (not (= main_~a~0.base |main_#t~mem6.base|))), 7756#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) 0)) (not (= main_~p~0.base main_~a~0.base))), 7757#(and (= 0 main_~a~0.offset) (not (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)) 0))), 7758#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) 0))), 7759#(and (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0))), 7760#(and (not (= |main_#t~mem13.base| 0)) (= main_~p~0.offset 0)), 7761#(and (= main_~p~0.offset 0) (not (= main_~t~0.base 0))), 7762#(not (= main_~t~0.base 0)), 7763#(not (= main_~p~0.base 0)), 7741#true, 7742#false, 7743#(= 0 |main_#t~malloc0.offset|)] [2018-02-02 10:09:09,454 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:09:09,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:09:09,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:09:09,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:09:09,455 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 23 states. [2018-02-02 10:09:10,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:10,041 INFO L93 Difference]: Finished difference Result 154 states and 164 transitions. [2018-02-02 10:09:10,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:09:10,042 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 63 [2018-02-02 10:09:10,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:10,042 INFO L225 Difference]: With dead ends: 154 [2018-02-02 10:09:10,042 INFO L226 Difference]: Without dead ends: 154 [2018-02-02 10:09:10,043 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=389, Invalid=1681, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:09:10,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-02 10:09:10,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 147. [2018-02-02 10:09:10,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 10:09:10,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2018-02-02 10:09:10,059 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 63 [2018-02-02 10:09:10,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:10,060 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2018-02-02 10:09:10,060 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:09:10,060 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2018-02-02 10:09:10,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 10:09:10,060 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:10,060 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:10,060 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:09:10,060 INFO L82 PathProgramCache]: Analyzing trace with hash -317817434, now seen corresponding path program 7 times [2018-02-02 10:09:10,061 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:10,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:11,009 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 10:09:11,010 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:09:11,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 10:09:11,010 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:11,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:11,010 INFO L182 omatonBuilderFactory]: Interpolants [8128#(and (= 0 main_~a~0.offset) (or (and (<= 2 main_~i~0) (= main_~a~0.offset main_~t~0.offset)) (not (= main_~a~0.base main_~t~0.base))) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)) main_~t~0.base))), 8129#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (or (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (and (<= 2 main_~i~0) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))), 8130#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|)) (or (and (<= 2 main_~i~0) (= main_~a~0.offset |main_#t~mem6.offset|)) (not (= main_~a~0.base |main_#t~mem6.base|)))), 8131#(and (= 0 main_~a~0.offset) (or (and (not (= main_~i~0 0)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))))), 8132#(and (= 0 main_~a~0.offset) (or (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4))))) (and (not (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 0)) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset)))), 8133#(and (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))) (not (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 0))) (= 0 main_~a~0.offset)), 8134#(and (or (not (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) main_~i~0)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))) (= main_~p~0.offset 0)), 8135#(and (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= |main_#t~mem10| main_~i~0))) (= main_~p~0.offset 0)), 8136#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 8137#(and (= 0 |main_#t~mem11.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ 0 4))))), 8138#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 8139#(= 1 (select |#valid| |main_#t~mem11.base|)), 8140#(= 1 (select |#valid| main_~p~0.base)), 8111#true, 8112#false, 8113#(= |main_#t~malloc0.offset| 0), 8114#(= main_~a~0.offset 0), 8115#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0)), 8116#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0)), 8117#(and (= (select |#valid| |main_#t~malloc4.base|) 1) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|) (= main_~i~0 0)), 8118#(and (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0) (= (select |#valid| main_~t~0.base) 1)), 8119#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0)), 8120#(and (= (select |#valid| main_~a~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= 0 |main_#t~mem6.offset|) (= (select |#valid| |main_#t~mem6.base|) 1) (not (= main_~a~0.base |main_#t~mem6.base|)) (= main_~i~0 0)), 8121#(and (<= 1 main_~i~0) (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 8122#(and (not (= main_~a~0.base |main_#t~malloc4.base|)) (<= 1 main_~i~0) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 8123#(and (<= 1 main_~i~0) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 8124#(and (<= 1 main_~i~0) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 8125#(and (<= 1 main_~i~0) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|)) (not (= main_~a~0.base |main_#t~mem6.base|))), 8126#(and (<= 2 main_~i~0) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~a~0.base))), 8127#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~malloc4.base|)) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (or (and (<= 2 main_~i~0) (= main_~a~0.offset |main_#t~malloc4.offset|)) (not (= main_~a~0.base |main_#t~malloc4.base|))))] [2018-02-02 10:09:11,010 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 10:09:11,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 10:09:11,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 10:09:11,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=780, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:09:11,011 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand 30 states. [2018-02-02 10:09:12,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:12,792 INFO L93 Difference]: Finished difference Result 176 states and 188 transitions. [2018-02-02 10:09:12,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 10:09:12,792 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 64 [2018-02-02 10:09:12,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:12,793 INFO L225 Difference]: With dead ends: 176 [2018-02-02 10:09:12,793 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 10:09:12,794 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=524, Invalid=3258, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 10:09:12,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 10:09:12,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 151. [2018-02-02 10:09:12,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 10:09:12,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2018-02-02 10:09:12,796 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 64 [2018-02-02 10:09:12,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:12,797 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2018-02-02 10:09:12,797 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 10:09:12,797 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2018-02-02 10:09:12,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 10:09:12,797 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:12,797 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:12,798 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:09:12,798 INFO L82 PathProgramCache]: Analyzing trace with hash -317817433, now seen corresponding path program 5 times [2018-02-02 10:09:12,798 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:12,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:13,970 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 10:09:13,970 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:09:13,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 10:09:13,971 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:13,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:13,971 INFO L182 omatonBuilderFactory]: Interpolants [8532#true, 8533#false, 8534#(= |main_#t~malloc0.offset| 0), 8535#(= main_~a~0.offset 0), 8536#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0)), 8537#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0)), 8538#(and (= (select |#valid| |main_#t~malloc4.base|) 1) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|)) (= main_~i~0 0)), 8539#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0) (= (select |#valid| main_~t~0.base) 1)), 8540#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0)), 8541#(and (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0) (= 0 |main_#t~mem6.offset|) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| |main_#t~mem6.base|)) (= (select |#valid| |main_#t~mem6.base|) 1) (not (= main_~a~0.base |main_#t~mem6.base|)) (= main_~i~0 0)), 8542#(and (<= 1 main_~i~0) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0) (or (<= (+ main_~p~0.offset 1) 0) (= main_~p~0.offset 0)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 8543#(and (<= 1 main_~i~0) (= 1 (select |#valid| main_~a~0.base)) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 8544#(and (= (select |#length| main_~p~0.base) 8) (not (= main_~a~0.base |main_#t~malloc4.base|)) (<= 1 main_~i~0) (= 1 (select |#valid| main_~a~0.base)) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 8545#(and (= 8 (select |#length| main_~t~0.base)) (= (select |#length| main_~p~0.base) 8) (<= 1 main_~i~0) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| main_~a~0.base)) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (not (= main_~a~0.base main_~t~0.base))), 8546#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select |#length| main_~p~0.base) 8) (<= 1 main_~i~0) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| main_~a~0.base)) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 8547#(and (<= 1 main_~i~0) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 8) (= 1 (select |#valid| main_~a~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|)) (= 8 (select |#length| |main_#t~mem6.base|)) (not (= main_~a~0.base |main_#t~mem6.base|))), 8548#(and (<= 2 main_~i~0) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 8) (= 1 (select |#valid| main_~a~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 8549#(and (<= 2 main_~i~0) (not (= main_~a~0.base |main_#t~malloc4.base|)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~malloc4.base|)) (= main_~a~0.offset |main_#t~malloc4.offset|) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 8) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 8550#(and (<= 2 main_~i~0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= main_~a~0.offset main_~t~0.offset) (not (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)) main_~t~0.base)) (<= (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) 8) (= 8 (select |#length| main_~p~0.base)) (not (= main_~a~0.base main_~t~0.base))), 8551#(and (<= 2 main_~i~0) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 8) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 8 (select |#length| main_~p~0.base))), 8552#(and (<= 2 main_~i~0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 8) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|)) (= main_~a~0.offset |main_#t~mem6.offset|) (not (= main_~a~0.base |main_#t~mem6.base|))), 8553#(and (= 0 main_~a~0.offset) (or (and (not (= main_~i~0 0)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 8) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))))), 8554#(and (or (and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (<= (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) 8)) (and (not (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 0)) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))) (= 0 main_~a~0.offset)), 8555#(and (= 0 main_~a~0.offset) (or (not (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 0)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 8) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))))), 8556#(and (or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 8) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (not (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) main_~i~0))) (= main_~p~0.offset 0)), 8557#(and (or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 8) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (not (= |main_#t~mem10| main_~i~0))) (= main_~p~0.offset 0)), 8558#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 8) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))), 8559#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ 0 4))) (<= (select |#length| |main_#t~mem11.base|) 8)), 8560#(and (or (not (= main_~p~0.offset 0)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))) (or (<= main_~p~0.offset 0) (<= (select |#length| main_~p~0.base) 8))), 8561#(and (<= 0 main_~p~0.offset) (or (not (= main_~p~0.offset 0)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))) (or (<= main_~p~0.offset 0) (<= (select |#length| main_~p~0.base) 8))), 8562#(and (= 0 |main_#t~mem11.offset|) (= 8 (select |#length| |main_#t~mem11.base|))), 8563#(and (= main_~p~0.offset 0) (= 8 (select |#length| main_~p~0.base)))] [2018-02-02 10:09:13,971 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 10:09:13,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 10:09:13,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 10:09:13,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:09:13,972 INFO L87 Difference]: Start difference. First operand 151 states and 163 transitions. Second operand 32 states. [2018-02-02 10:09:15,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:15,608 INFO L93 Difference]: Finished difference Result 193 states and 205 transitions. [2018-02-02 10:09:15,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:09:15,608 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 64 [2018-02-02 10:09:15,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:15,609 INFO L225 Difference]: With dead ends: 193 [2018-02-02 10:09:15,609 INFO L226 Difference]: Without dead ends: 193 [2018-02-02 10:09:15,609 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=428, Invalid=2878, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 10:09:15,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-02 10:09:15,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 153. [2018-02-02 10:09:15,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-02 10:09:15,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 164 transitions. [2018-02-02 10:09:15,611 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 164 transitions. Word has length 64 [2018-02-02 10:09:15,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:15,611 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 164 transitions. [2018-02-02 10:09:15,611 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 10:09:15,611 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2018-02-02 10:09:15,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 10:09:15,612 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:15,612 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:15,612 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:09:15,612 INFO L82 PathProgramCache]: Analyzing trace with hash 368980324, now seen corresponding path program 6 times [2018-02-02 10:09:15,613 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:15,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:16,424 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:16,424 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:09:16,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 10:09:16,425 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:16,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:16,425 INFO L182 omatonBuilderFactory]: Interpolants [8962#true, 8963#false, 8964#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 8965#(and (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base))), 8966#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 8967#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 8968#(and (= (select |#valid| |main_#t~malloc4.base|) 1) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|)), 8969#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base) (= (select |#valid| main_~t~0.base) 1)), 8970#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 8971#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|) (not (= 0 main_~a~0.base)) (= 0 |main_#t~mem6.offset|) (= (select |#valid| |main_#t~mem6.base|) 1) (not (= main_~a~0.base |main_#t~mem6.base|))), 8972#(and (or (and (= main_~p~0.offset 0) (not (= 0 main_~a~0.base))) (<= (+ main_~p~0.offset 1) 0)) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 8973#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 8974#(and (not (= main_~a~0.base |main_#t~malloc4.base|)) (= 0 main_~a~0.offset) (= 1 (select |#valid| |main_#t~malloc4.base|)) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base |main_#t~malloc4.base|)) (not (= main_~p~0.base main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) main_~p~0.base)), 8975#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base main_~t~0.base)) (= 1 (select |#valid| main_~t~0.base)) (not (= main_~a~0.base main_~t~0.base))), 8976#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 8977#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|)) (not (= main_~a~0.base |main_#t~mem6.base|))), 8978#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base main_~a~0.base))), 8979#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= main_~a~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4))))), 8980#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (not (= 0 main_~a~0.base))), 8981#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.base main_~a~0.base) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))))), 8982#(and (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ 0 4)))) (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ 0 4)))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ 0 4))))), 8983#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 8984#(and (= 1 (select (store |#valid| main_~p~0.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (not (= 0 main_~p~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))))), 8985#(and (= main_~p~0.offset 0) (not (= main_~p~0.base 0)) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) (+ 0 4)))) (= 1 (select (store |#valid| main_~p~0.base 0) (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) (+ 0 4))))), 8986#(and (= main_~t~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) (select (select |#memory_$Pointer$.base| main_~t~0.base) (+ 0 4)))) (not (= main_~p~0.base 0)) (= 1 (select (store |#valid| main_~p~0.base 0) (select (select |#memory_$Pointer$.base| main_~t~0.base) (+ 0 4))))), 8987#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~t~0.base) (+ 0 4)))) (not (= main_~t~0.base (select (select |#memory_$Pointer$.base| main_~t~0.base) (+ 0 4))))), 8988#(or (<= (+ main_~p~0.offset 1) 0) (<= 1 main_~p~0.offset) (= 1 (select (store |#valid| main_~p~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 8989#(or (not (= main_~p~0.offset 0)) (and (not (= main_~p~0.base 0)) (= 1 (select (store |#valid| main_~p~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))))), 8990#(or (not (= main_~p~0.offset 0)) (and (not (= main_~p~0.base 0)) (= 1 (select (store |#valid| main_~p~0.base 0) |main_#t~mem13.base|)))), 8991#(or (not (= main_~p~0.offset 0)) (and (not (= main_~p~0.base 0)) (= 1 (select (store |#valid| main_~p~0.base 0) main_~t~0.base)))), 8992#(= 1 (select |#valid| main_~t~0.base)), 8993#(= (select |#valid| main_~p~0.base) 1)] [2018-02-02 10:09:16,425 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:16,425 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 10:09:16,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 10:09:16,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=883, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:09:16,426 INFO L87 Difference]: Start difference. First operand 153 states and 164 transitions. Second operand 32 states. [2018-02-02 10:09:17,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:17,914 INFO L93 Difference]: Finished difference Result 165 states and 176 transitions. [2018-02-02 10:09:17,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 10:09:17,914 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 68 [2018-02-02 10:09:17,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:17,914 INFO L225 Difference]: With dead ends: 165 [2018-02-02 10:09:17,914 INFO L226 Difference]: Without dead ends: 165 [2018-02-02 10:09:17,915 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1152 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=613, Invalid=3943, Unknown=0, NotChecked=0, Total=4556 [2018-02-02 10:09:17,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-02 10:09:17,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2018-02-02 10:09:17,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-02 10:09:17,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 170 transitions. [2018-02-02 10:09:17,917 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 170 transitions. Word has length 68 [2018-02-02 10:09:17,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:17,917 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 170 transitions. [2018-02-02 10:09:17,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 10:09:17,917 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 170 transitions. [2018-02-02 10:09:17,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 10:09:17,917 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:17,917 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:17,917 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:09:17,918 INFO L82 PathProgramCache]: Analyzing trace with hash 368980325, now seen corresponding path program 3 times [2018-02-02 10:09:17,918 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:17,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:18,701 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:18,702 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:09:18,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 10:09:18,702 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:18,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:18,702 INFO L182 omatonBuilderFactory]: Interpolants [9408#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ 0 4)))) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ 0 4)))), 9409#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))))), 9410#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))), 9411#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) (+ 0 4)))), 9412#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~t~0.base) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~t~0.base) (+ 0 4))))), 9413#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~t~0.base) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~t~0.base) (+ 0 4))))), 9414#(or (<= (+ main_~p~0.offset 1) 0) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (<= 1 main_~p~0.offset)), 9415#(or (and (= 8 (select |#length| |main_#t~mem13.base|)) (= 0 |main_#t~mem13.offset|)) (<= (+ main_~p~0.offset 1) 0) (<= 1 main_~p~0.offset)), 9416#(or (<= (+ main_~p~0.offset 1) 0) (and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset)) (<= 1 main_~p~0.offset)), 9417#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset)), 9418#(and (= main_~p~0.offset 0) (= 8 (select |#length| main_~p~0.base))), 9388#true, 9389#false, 9390#(= 0 |main_#t~malloc0.offset|), 9391#(= 0 main_~a~0.offset), 9392#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 9393#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 9394#(and (= (select |#valid| |main_#t~malloc4.base|) 1) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|)), 9395#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= (select |#valid| main_~t~0.base) 1)), 9396#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 9397#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|) (= 0 |main_#t~mem6.offset|) (= (select |#valid| |main_#t~mem6.base|) 1) (not (= main_~a~0.base |main_#t~mem6.base|))), 9398#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (or (<= (+ main_~p~0.offset 1) 0) (= main_~p~0.offset 0)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 9399#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 9400#(and (not (= main_~a~0.base |main_#t~malloc4.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 9401#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (not (= main_~a~0.base main_~t~0.base))), 9402#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))))), 9403#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|)) (not (= main_~a~0.base |main_#t~mem6.base|))), 9404#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 9405#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4)))), 9406#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))), 9407#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))))] [2018-02-02 10:09:18,703 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:18,703 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 10:09:18,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 10:09:18,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:09:18,703 INFO L87 Difference]: Start difference. First operand 157 states and 170 transitions. Second operand 31 states. [2018-02-02 10:09:19,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:19,881 INFO L93 Difference]: Finished difference Result 176 states and 187 transitions. [2018-02-02 10:09:19,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 10:09:19,881 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 68 [2018-02-02 10:09:19,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:19,881 INFO L225 Difference]: With dead ends: 176 [2018-02-02 10:09:19,881 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 10:09:19,882 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=491, Invalid=3415, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 10:09:19,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 10:09:19,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 159. [2018-02-02 10:09:19,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 10:09:19,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 171 transitions. [2018-02-02 10:09:19,885 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 171 transitions. Word has length 68 [2018-02-02 10:09:19,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:19,885 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 171 transitions. [2018-02-02 10:09:19,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 10:09:19,885 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 171 transitions. [2018-02-02 10:09:19,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 10:09:19,886 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:19,886 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:19,886 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:09:19,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1446513348, now seen corresponding path program 4 times [2018-02-02 10:09:19,887 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:19,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:20,424 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:09:20,424 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:09:20,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 10:09:20,425 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:20,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:20,425 INFO L182 omatonBuilderFactory]: Interpolants [9818#true, 9819#false, 9820#(= 0 |main_#t~malloc0.offset|), 9821#(= 0 main_~a~0.offset), 9822#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 9823#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 9824#(and (= (select |#valid| |main_#t~malloc4.base|) 1) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|)), 9825#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= (select |#valid| main_~t~0.base) 1)), 9826#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 9827#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|) (= 0 |main_#t~mem6.offset|) (= (select |#valid| |main_#t~mem6.base|) 1) (not (= main_~a~0.base |main_#t~mem6.base|))), 9828#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (or (<= (+ main_~p~0.offset 1) 0) (= main_~p~0.offset 0)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 9829#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 9830#(and (not (= main_~a~0.base |main_#t~malloc4.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (not (= |main_#t~malloc4.base| 0)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 9831#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (not (= main_~t~0.base 0)) (not (= main_~a~0.base main_~t~0.base))), 9832#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)) 0))), 9833#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)) 0)) (not (= main_~a~0.base |main_#t~mem6.base|))), 9834#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base main_~a~0.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)) 0))), 9835#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4)) 0)) (= 0 main_~a~0.offset)), 9836#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)) 0))), 9837#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)) 0)) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 9838#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ 0 4)) 0)) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 9839#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)) 0)) (= main_~p~0.offset 0)), 9840#(and (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) (+ 0 4)) 0)) (= main_~p~0.offset 0)), 9841#(and (not (= (select (select |#memory_$Pointer$.base| main_~t~0.base) (+ 0 4)) 0)) (= main_~p~0.offset 0)), 9842#(not (= (select (select |#memory_$Pointer$.base| main_~t~0.base) (+ 0 4)) 0)), 9843#(or (<= (+ main_~p~0.offset 1) 0) (<= 1 main_~p~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0))), 9844#(or (not (= |main_#t~mem13.base| 0)) (<= (+ main_~p~0.offset 1) 0) (<= 1 main_~p~0.offset)), 9845#(or (<= (+ main_~p~0.offset 1) 0) (not (= main_~t~0.base 0)) (<= 1 main_~p~0.offset)), 9846#(not (= main_~t~0.base 0)), 9847#(not (= main_~p~0.base 0))] [2018-02-02 10:09:20,425 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:09:20,425 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 10:09:20,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 10:09:20,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:09:20,426 INFO L87 Difference]: Start difference. First operand 159 states and 171 transitions. Second operand 30 states. [2018-02-02 10:09:21,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:21,489 INFO L93 Difference]: Finished difference Result 173 states and 184 transitions. [2018-02-02 10:09:21,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 10:09:21,489 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 69 [2018-02-02 10:09:21,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:21,489 INFO L225 Difference]: With dead ends: 173 [2018-02-02 10:09:21,489 INFO L226 Difference]: Without dead ends: 173 [2018-02-02 10:09:21,490 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=552, Invalid=3480, Unknown=0, NotChecked=0, Total=4032 [2018-02-02 10:09:21,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-02-02 10:09:21,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 159. [2018-02-02 10:09:21,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 10:09:21,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 170 transitions. [2018-02-02 10:09:21,492 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 170 transitions. Word has length 69 [2018-02-02 10:09:21,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:21,492 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 170 transitions. [2018-02-02 10:09:21,492 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 10:09:21,492 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2018-02-02 10:09:21,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 10:09:21,492 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:21,492 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:21,492 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:09:21,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1205982595, now seen corresponding path program 8 times [2018-02-02 10:09:21,493 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:21,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:22,032 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:22,033 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:09:22,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 10:09:22,033 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:22,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:22,033 INFO L182 omatonBuilderFactory]: Interpolants [10248#true, 10249#false, 10250#(= 0 |main_#t~malloc0.offset|), 10251#(= 0 main_~a~0.offset), 10252#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 10253#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 10254#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base)), 10255#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 10256#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 10257#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem6.base|))), 10258#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 10259#(and (not (= main_~a~0.base |main_#t~malloc4.base|)) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 10260#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 10261#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1)), 10262#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1) (not (= main_~a~0.base |main_#t~mem6.base|))), 10263#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1) (not (= main_~p~0.base main_~a~0.base))), 10264#(and (not (= main_~a~0.base |main_#t~malloc4.base|)) (= 0 main_~a~0.offset) (not (= (select |#valid| main_~a~0.base) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 10265#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (not (= (select |#valid| main_~a~0.base) 0)) (not (= main_~a~0.base main_~t~0.base))), 10266#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= (select |#valid| main_~a~0.base) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 10267#(and (= 0 main_~a~0.offset) (not (= (select |#valid| main_~a~0.base) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~a~0.base |main_#t~mem6.base|))), 10268#(and (= 0 main_~a~0.offset) (not (= (select |#valid| main_~a~0.base) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 10269#(and (not (= main_~a~0.base |main_#t~malloc4.base|)) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 10270#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (not (= main_~a~0.base main_~t~0.base))), 10271#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 10272#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~a~0.base |main_#t~mem6.base|))), 10273#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 10274#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 10275#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 10276#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 10277#(= 1 (select |#valid| |main_#t~mem11.base|)), 10278#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:09:22,033 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:22,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 10:09:22,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 10:09:22,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=807, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:09:22,034 INFO L87 Difference]: Start difference. First operand 159 states and 170 transitions. Second operand 31 states. [2018-02-02 10:09:22,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:22,721 INFO L93 Difference]: Finished difference Result 161 states and 172 transitions. [2018-02-02 10:09:22,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:09:22,722 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 69 [2018-02-02 10:09:22,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:22,722 INFO L225 Difference]: With dead ends: 161 [2018-02-02 10:09:22,722 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 10:09:22,723 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=471, Invalid=2285, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 10:09:22,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 10:09:22,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2018-02-02 10:09:22,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-02 10:09:22,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 172 transitions. [2018-02-02 10:09:22,724 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 172 transitions. Word has length 69 [2018-02-02 10:09:22,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:22,724 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 172 transitions. [2018-02-02 10:09:22,724 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 10:09:22,724 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 172 transitions. [2018-02-02 10:09:22,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 10:09:22,724 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:22,725 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:22,725 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:09:22,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1205982594, now seen corresponding path program 6 times [2018-02-02 10:09:22,725 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:22,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:23,451 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:23,452 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:09:23,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 10:09:23,452 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:23,452 INFO L182 omatonBuilderFactory]: Interpolants [10644#true, 10645#false, 10646#(= 0 |main_#t~malloc0.offset|), 10647#(= 0 main_~a~0.offset), 10648#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 10649#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 10650#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 10651#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 10652#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 10653#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| |main_#t~mem6.base|)) (not (= main_~a~0.base |main_#t~mem6.base|))), 10654#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 10655#(and (<= 0 main_~p~0.offset) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 10656#(and (<= 0 main_~p~0.offset) (= (select |#length| main_~p~0.base) 8) (not (= main_~a~0.base |main_#t~malloc4.base|)) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 10657#(and (<= 0 main_~p~0.offset) (= (select |#length| main_~p~0.base) 8) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 10658#(and (= (select |#length| main_~p~0.base) 8) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1)), 10659#(and (= (select |#valid| main_~a~0.base) 1) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1) (not (= main_~a~0.base |main_#t~mem6.base|))), 10660#(and (= (select |#valid| main_~a~0.base) 1) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1) (not (= main_~p~0.base main_~a~0.base))), 10661#(and (not (= main_~a~0.base |main_#t~malloc4.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (not (= (select |#valid| main_~a~0.base) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 10662#(and (= 0 main_~a~0.offset) (not (= (select |#valid| main_~a~0.base) 0)) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 10663#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (not (= (select |#valid| main_~a~0.base) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 10664#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (not (= (select |#valid| main_~a~0.base) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem6.base|))), 10665#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (not (= (select |#valid| main_~a~0.base) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 10666#(and (not (= main_~a~0.base |main_#t~malloc4.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 10667#(and (= 0 main_~a~0.offset) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 10668#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 10669#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem6.base|))), 10670#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 10671#(and (= 0 main_~a~0.offset) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))), 10672#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 10673#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 10674#(and (<= 8 (select |#length| |main_#t~mem11.base|)) (= 0 |main_#t~mem11.offset|)), 10675#(and (= main_~p~0.offset 0) (<= 8 (select |#length| main_~p~0.base)))] [2018-02-02 10:09:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:23,452 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 10:09:23,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 10:09:23,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=841, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:09:23,453 INFO L87 Difference]: Start difference. First operand 160 states and 172 transitions. Second operand 32 states. [2018-02-02 10:09:24,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:24,386 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2018-02-02 10:09:24,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:09:24,386 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2018-02-02 10:09:24,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:24,386 INFO L225 Difference]: With dead ends: 163 [2018-02-02 10:09:24,386 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 10:09:24,387 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=504, Invalid=2358, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 10:09:24,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 10:09:24,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2018-02-02 10:09:24,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 10:09:24,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 170 transitions. [2018-02-02 10:09:24,388 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 170 transitions. Word has length 69 [2018-02-02 10:09:24,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:24,389 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 170 transitions. [2018-02-02 10:09:24,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 10:09:24,389 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2018-02-02 10:09:24,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 10:09:24,389 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:24,389 INFO L351 BasicCegarLoop]: trace histogram [4, 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] [2018-02-02 10:09:24,389 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:09:24,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1916713364, now seen corresponding path program 9 times [2018-02-02 10:09:24,390 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:24,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:25,813 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:25,813 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:09:25,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-02 10:09:25,813 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:25,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:25,814 INFO L182 omatonBuilderFactory]: Interpolants [11072#(and (<= 0 main_~p~0.offset) (or (not (= main_~p~0.offset 0)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))))) (or (<= main_~p~0.offset 0) (<= (select |#length| main_~p~0.base) 8))), 11073#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ 0 4)))) (= 8 (select |#length| |main_#t~mem11.base|))), 11074#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (<= (+ main_~p~0.offset 1) 0) (and (<= 1 main_~p~0.offset) (= 8 (select |#length| main_~p~0.base)))), 11075#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (and (<= 1 main_~p~0.offset) (= 8 (select |#length| main_~p~0.base)))), 11076#(= 1 (select |#valid| |main_#t~mem11.base|)), 11077#(= 1 (select |#valid| main_~p~0.base)), 11042#true, 11043#false, 11044#(= |main_#t~malloc0.offset| 0), 11045#(= main_~a~0.offset 0), 11046#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0)), 11047#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0)), 11048#(and (= (select |#valid| |main_#t~malloc4.base|) 1) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|)) (= main_~i~0 0)), 11049#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0) (= (select |#valid| main_~t~0.base) 1)), 11050#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0)), 11051#(and (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0) (= 0 |main_#t~mem6.offset|) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| |main_#t~mem6.base|)) (= (select |#valid| |main_#t~mem6.base|) 1) (not (= main_~a~0.base |main_#t~mem6.base|)) (= main_~i~0 0)), 11052#(and (<= 1 main_~i~0) (= (select |#valid| main_~a~0.base) 1) (or (<= (+ main_~p~0.offset 1) 0) (and (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1))) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 11053#(and (<= 1 main_~i~0) (= 1 (select |#valid| main_~a~0.base)) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 11054#(and (= (select |#valid| |main_#t~malloc4.base|) 1) (not (= main_~a~0.base |main_#t~malloc4.base|)) (<= 1 main_~i~0) (= 1 (select |#valid| main_~a~0.base)) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (<= (select |#length| main_~p~0.base) 8) (not (= main_~p~0.base main_~a~0.base)) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 11055#(and (= 8 (select |#length| main_~t~0.base)) (<= 1 main_~i~0) (= 1 (select |#valid| main_~a~0.base)) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (<= (select |#length| main_~p~0.base) 8) (not (= main_~a~0.base main_~t~0.base)) (= (select |#valid| main_~t~0.base) 1)), 11056#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (<= 1 main_~i~0) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| main_~a~0.base)) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (<= (select |#length| main_~p~0.base) 8)), 11057#(and (<= 1 main_~i~0) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 8) (= 1 (select |#valid| main_~a~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|)) (= 0 |main_#t~mem6.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)) |main_#t~mem6.base|) (= 8 (select |#length| |main_#t~mem6.base|)) (= (select |#valid| |main_#t~mem6.base|) 1) (not (= main_~a~0.base |main_#t~mem6.base|))), 11058#(and (<= 2 main_~i~0) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 8) (= main_~a~0.offset 0) (or (and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 1 (select |#valid| main_~a~0.base)) (= main_~p~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= (select |#valid| main_~p~0.base) 1) (= 8 (select |#length| main_~p~0.base))) (<= (+ main_~p~0.offset 1) 0)) (not (= main_~p~0.base main_~a~0.base))), 11059#(and (<= 2 main_~i~0) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 8) (= 1 (select |#valid| main_~a~0.base)) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 11060#(and (<= 2 main_~i~0) (= main_~a~0.offset |main_#t~malloc4.offset|) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 8) (= 1 (select |#valid| |main_#t~malloc4.base|)) (= main_~p~0.offset 0) (= 8 (select |#length| main_~p~0.base)) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc4.base|)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~malloc4.base|)) (not (= main_~p~0.base |main_#t~malloc4.base|))), 11061#(and (<= 2 main_~i~0) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= main_~a~0.offset main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (not (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)) main_~t~0.base)) (= 8 (select |#length| main_~p~0.base)) (<= (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) 8) (= 1 (select |#valid| main_~t~0.base)) (not (= main_~a~0.base main_~t~0.base))), 11062#(and (<= 2 main_~i~0) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 8) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 8 (select |#length| main_~p~0.base))), 11063#(and (<= 2 main_~i~0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (+ 0 4)))) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 8) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)) |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|)) (= main_~a~0.offset |main_#t~mem6.offset|) (not (= main_~a~0.base |main_#t~mem6.base|))), 11064#(and (or (and (not (= main_~i~0 0)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (+ 0 4)))) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 8) (not (= main_~p~0.base main_~a~0.base)))) (= 0 main_~a~0.offset)), 11065#(and (= 0 main_~a~0.offset) (or (and (not (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 0)) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset)) (and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4)))) (<= (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) 8) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (+ 0 4))))))), 11066#(and (= 0 main_~a~0.offset) (or (not (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 0)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (+ 0 4)))) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 8)))), 11067#(and (= main_~p~0.offset 0) (or (not (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) main_~i~0)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (+ 0 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 8)))), 11068#(and (= main_~p~0.offset 0) (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (+ 0 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 8)) (not (= |main_#t~mem10| main_~i~0)))), 11069#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (+ 0 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (<= (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 8)), 11070#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ 0 4))) (+ 0 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ 0 4)))) (<= (select |#length| |main_#t~mem11.base|) 8)), 11071#(and (or (not (= main_~p~0.offset 0)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))))) (or (<= main_~p~0.offset 0) (<= (select |#length| main_~p~0.base) 8)))] [2018-02-02 10:09:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:25,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 10:09:25,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 10:09:25,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1147, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:09:25,814 INFO L87 Difference]: Start difference. First operand 159 states and 170 transitions. Second operand 36 states. [2018-02-02 10:09:28,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:28,147 INFO L93 Difference]: Finished difference Result 191 states and 204 transitions. [2018-02-02 10:09:28,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 10:09:28,215 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-02-02 10:09:28,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:28,216 INFO L225 Difference]: With dead ends: 191 [2018-02-02 10:09:28,216 INFO L226 Difference]: Without dead ends: 191 [2018-02-02 10:09:28,216 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1197 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=581, Invalid=4531, Unknown=0, NotChecked=0, Total=5112 [2018-02-02 10:09:28,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-02 10:09:28,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 166. [2018-02-02 10:09:28,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-02 10:09:28,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 179 transitions. [2018-02-02 10:09:28,218 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 179 transitions. Word has length 70 [2018-02-02 10:09:28,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:28,218 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 179 transitions. [2018-02-02 10:09:28,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 10:09:28,218 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2018-02-02 10:09:28,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 10:09:28,219 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:28,219 INFO L351 BasicCegarLoop]: trace histogram [4, 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] [2018-02-02 10:09:28,219 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:09:28,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1916713365, now seen corresponding path program 7 times [2018-02-02 10:09:28,220 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:28,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:29,523 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:29,524 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:09:29,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-02 10:09:29,524 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:29,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 10:09:29,524 INFO L182 omatonBuilderFactory]: Interpolants [11520#(and (= 8 (select |#length| main_~t~0.base)) (<= 1 main_~i~0) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base)) (not (= main_~a~0.base main_~t~0.base)) (= (select |#valid| main_~t~0.base) 1)), 11521#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (<= 1 main_~i~0) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base))), 11522#(and (<= 1 main_~i~0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|)) (= 0 |main_#t~mem6.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)) |main_#t~mem6.base|) (= 8 (select |#length| |main_#t~mem6.base|)) (= (select |#valid| |main_#t~mem6.base|) 1) (not (= main_~a~0.base |main_#t~mem6.base|))), 11523#(or (<= (+ main_~p~0.offset 1) 0) (and (<= 2 main_~i~0) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base)))), 11524#(and (<= 2 main_~i~0) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 11525#(and (<= 2 main_~i~0) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~malloc4.base|)) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base)) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 11526#(and (= 8 (select |#length| main_~t~0.base)) (<= 2 main_~i~0) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= main_~a~0.offset main_~t~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (not (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)) main_~t~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 8 (select |#length| main_~p~0.base))), 11527#(and (<= 2 main_~i~0) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (= 8 (select |#length| main_~p~0.base))), 11528#(and (<= 2 main_~i~0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)) |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem6.base|)) (= main_~a~0.offset |main_#t~mem6.offset|) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (+ 0 4))))), 11529#(or (and (not (= main_~i~0 0)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (+ 0 4)))))), 11530#(or (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (+ 0 4))) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (+ 0 4)))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))) (and (not (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 0)) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))), 11531#(or (not (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 0)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (+ 0 4)))))), 11532#(or (not (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) main_~i~0)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (+ 0 4))))), 11533#(or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (+ 0 4)))) (not (= |main_#t~mem10| main_~i~0))), 11534#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (+ 0 4)))), 11535#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ 0 4))) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ 0 4))) (+ 0 4)))) (= 8 (select |#length| |main_#t~mem11.base|))), 11536#(and (= (select |#length| main_~p~0.base) 8) (or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (<= (+ main_~p~0.offset 1) 0) (<= 1 main_~p~0.offset))), 11537#(and (= (select |#length| main_~p~0.base) 8) (or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (<= 1 main_~p~0.offset))), 11538#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ 0 4)))) (= 8 (select |#length| |main_#t~mem11.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ 0 4)))), 11539#(or (and (= (select |#length| main_~p~0.base) 8) (<= 1 main_~p~0.offset)) (<= (+ main_~p~0.offset 1) 0) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))), 11540#(or (and (= (select |#length| main_~p~0.base) 8) (<= 1 main_~p~0.offset)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))), 11541#(and (= 0 |main_#t~mem11.offset|) (= 8 (select |#length| |main_#t~mem11.base|))), 11542#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 11507#true, 11508#false, 11509#(= |main_#t~malloc0.offset| 0), 11510#(= main_~a~0.offset 0), 11511#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0)), 11512#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0)), 11513#(and (= (select |#valid| |main_#t~malloc4.base|) 1) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|)) (= main_~i~0 0)), 11514#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0) (= (select |#valid| main_~t~0.base) 1)), 11515#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0)), 11516#(and (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= 0 |main_#t~mem6.offset|) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| |main_#t~mem6.base|)) (= (select |#valid| |main_#t~mem6.base|) 1) (not (= main_~a~0.base |main_#t~mem6.base|)) (= main_~i~0 0)), 11517#(and (<= 1 main_~i~0) (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (or (<= (+ main_~p~0.offset 1) 0) (= main_~p~0.offset 0)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 11518#(and (<= 1 main_~i~0) (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 11519#(and (= (select |#valid| |main_#t~malloc4.base|) 1) (not (= main_~a~0.base |main_#t~malloc4.base|)) (<= 1 main_~i~0) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base)) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|)))] [2018-02-02 10:09:29,524 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:29,524 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 10:09:29,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 10:09:29,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1149, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:09:29,525 INFO L87 Difference]: Start difference. First operand 166 states and 179 transitions. Second operand 36 states. [2018-02-02 10:09:32,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:32,173 INFO L93 Difference]: Finished difference Result 208 states and 221 transitions. [2018-02-02 10:09:32,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 10:09:32,173 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-02-02 10:09:32,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:32,174 INFO L225 Difference]: With dead ends: 208 [2018-02-02 10:09:32,174 INFO L226 Difference]: Without dead ends: 208 [2018-02-02 10:09:32,174 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=537, Invalid=4575, Unknown=0, NotChecked=0, Total=5112 [2018-02-02 10:09:32,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-02 10:09:32,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 165. [2018-02-02 10:09:32,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 10:09:32,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 177 transitions. [2018-02-02 10:09:32,176 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 177 transitions. Word has length 70 [2018-02-02 10:09:32,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:32,176 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 177 transitions. [2018-02-02 10:09:32,176 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 10:09:32,176 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 177 transitions. [2018-02-02 10:09:32,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 10:09:32,177 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:32,177 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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] [2018-02-02 10:09:32,177 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:09:32,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1608060491, now seen corresponding path program 7 times [2018-02-02 10:09:32,177 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:32,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:32,858 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:32,858 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:09:32,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 10:09:32,858 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:32,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 10:09:32,859 INFO L182 omatonBuilderFactory]: Interpolants [11988#true, 11989#false, 11990#(and (not (= 0 |main_#t~malloc0.base|)) (= |main_#t~malloc0.offset| 0)), 11991#(and (= main_~a~0.offset 0) (not (= 0 main_~a~0.base))), 11992#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0)), 11993#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= 0 main_~a~0.base)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0)), 11994#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0)), 11995#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0)), 11996#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= 0 main_~a~0.base)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0)), 11997#(and (= (select |#valid| main_~a~0.base) 1) (= main_~a~0.offset 0) (not (= 0 main_~a~0.base)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem6.base|)) (= main_~i~0 0)), 11998#(and (<= 1 main_~i~0) (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base main_~a~0.base))), 11999#(and (not (= main_~a~0.base |main_#t~malloc4.base|)) (<= 1 main_~i~0) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base main_~a~0.base))), 12000#(and (<= 1 main_~i~0) (= main_~a~0.offset 0) (not (= 0 main_~a~0.base)) (not (= main_~a~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (not (= main_~a~0.base main_~t~0.base))), 12001#(and (<= 1 main_~i~0) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0) (not (= 0 main_~a~0.base))), 12002#(and (<= 1 main_~i~0) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0) (not (= 0 main_~a~0.base)) (not (= main_~a~0.base |main_#t~mem6.base|))), 12003#(and (<= 2 main_~i~0) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base main_~a~0.base))), 12004#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base main_~a~0.base)) (or (and (<= 2 main_~i~0) (= main_~a~0.offset |main_#t~malloc4.offset|)) (not (= main_~a~0.base |main_#t~malloc4.base|)))), 12005#(and (= 0 main_~a~0.offset) (or (and (<= 2 main_~i~0) (= main_~a~0.offset main_~t~0.offset)) (not (= main_~a~0.base main_~t~0.base))) (not (= 0 main_~a~0.base)) (not (= main_~a~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))))), 12006#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (or (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (and (<= 2 main_~i~0) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))), 12007#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (or (and (<= 2 main_~i~0) (= main_~a~0.offset |main_#t~mem6.offset|)) (not (= main_~a~0.base |main_#t~mem6.base|)))), 12008#(and (= 0 main_~a~0.offset) (or (and (not (= main_~i~0 0)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base)))) (not (= 0 main_~a~0.base))), 12009#(and (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (not (= main_~a~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 12010#(and (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (or (not (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 0)) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))))), 12011#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (or (not (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) main_~i~0)) (and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.base main_~a~0.base))) (not (= 0 main_~a~0.base))), 12012#(and (or (and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.base main_~a~0.base)) (not (= |main_#t~mem10| main_~i~0))) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base))), 12013#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 12014#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem11.base|) (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~mem11.base|)) (not (= 0 main_~a~0.base))), 12015#(and (not (= main_~a~0.base main_~p~0.base)) (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 12016#(and (not (= main_~a~0.base main_~p~0.base)) (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 12017#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base))), 12018#(and (not (= 0 main_~p~0.base)) (= 1 (select (store |#valid| main_~p~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 12019#(and (not (= main_~p~0.base 0)) (= 1 (select (store |#valid| main_~p~0.base 0) |main_#t~mem13.base|))), 12020#(and (not (= main_~p~0.base 0)) (= 1 (select (store |#valid| main_~p~0.base 0) main_~t~0.base))), 12021#(= 1 (select |#valid| main_~t~0.base)), 12022#(= (select |#valid| main_~p~0.base) 1)] [2018-02-02 10:09:32,859 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:32,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 10:09:32,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 10:09:32,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1030, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:09:32,859 INFO L87 Difference]: Start difference. First operand 165 states and 177 transitions. Second operand 35 states. [2018-02-02 10:09:34,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:34,131 INFO L93 Difference]: Finished difference Result 175 states and 187 transitions. [2018-02-02 10:09:34,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:09:34,132 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 73 [2018-02-02 10:09:34,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:34,132 INFO L225 Difference]: With dead ends: 175 [2018-02-02 10:09:34,132 INFO L226 Difference]: Without dead ends: 175 [2018-02-02 10:09:34,133 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=712, Invalid=3320, Unknown=0, NotChecked=0, Total=4032 [2018-02-02 10:09:34,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-02 10:09:34,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 166. [2018-02-02 10:09:34,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-02 10:09:34,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 179 transitions. [2018-02-02 10:09:34,135 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 179 transitions. Word has length 73 [2018-02-02 10:09:34,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:34,136 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 179 transitions. [2018-02-02 10:09:34,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 10:09:34,136 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2018-02-02 10:09:34,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 10:09:34,136 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:34,136 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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] [2018-02-02 10:09:34,136 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:09:34,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1608060490, now seen corresponding path program 4 times [2018-02-02 10:09:34,137 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:34,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:34,967 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:34,967 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:09:34,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 10:09:34,967 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:34,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:34,968 INFO L182 omatonBuilderFactory]: Interpolants [12422#true, 12423#false, 12424#(= |main_#t~malloc0.offset| 0), 12425#(= main_~a~0.offset 0), 12426#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0)), 12427#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0)), 12428#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base |main_#t~malloc4.base|)) (= main_~p~0.base main_~a~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|)) (= main_~i~0 0)), 12429#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0)), 12430#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (= main_~i~0 0)), 12431#(and (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| |main_#t~mem6.base|)) (not (= main_~a~0.base |main_#t~mem6.base|)) (= main_~i~0 0)), 12432#(and (<= 1 main_~i~0) (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 12433#(and (not (= main_~a~0.base |main_#t~malloc4.base|)) (<= 1 main_~i~0) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 12434#(and (<= 1 main_~i~0) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base)) (not (= main_~a~0.base main_~t~0.base))), 12435#(and (<= 1 main_~i~0) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base))), 12436#(and (<= 1 main_~i~0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem6.base|))), 12437#(and (<= 2 main_~i~0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~a~0.base))), 12438#(and (<= 2 main_~i~0) (= main_~a~0.offset |main_#t~malloc4.offset|) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 12439#(and (<= 2 main_~i~0) (= 0 main_~a~0.offset) (= main_~a~0.offset main_~t~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))))), 12440#(and (<= 2 main_~i~0) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 12441#(and (<= 2 main_~i~0) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset |main_#t~mem6.offset|)), 12442#(and (or (and (not (= main_~i~0 0)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)))) (= 0 main_~a~0.offset)), 12443#(and (= 0 main_~a~0.offset) (or (and (not (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 0)) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset)) (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))))), 12444#(and (= 0 main_~a~0.offset) (or (not (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 0)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))))), 12445#(and (or (not (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) main_~i~0)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))) (= 0 main_~a~0.offset)), 12446#(and (= 0 main_~a~0.offset) (or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)) (not (= |main_#t~mem10| main_~i~0)))), 12447#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 12448#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| |main_#t~mem11.base|))), 12449#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base))), 12450#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 12451#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 12452#(and (= 8 (select |#length| |main_#t~mem13.base|)) (= 0 |main_#t~mem13.offset|) (= main_~p~0.offset 0)), 12453#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset) (= main_~p~0.offset 0)), 12454#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset)), 12455#(and (= main_~p~0.offset 0) (= 8 (select |#length| main_~p~0.base)))] [2018-02-02 10:09:34,968 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:34,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 10:09:34,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 10:09:34,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=973, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:09:34,968 INFO L87 Difference]: Start difference. First operand 166 states and 179 transitions. Second operand 34 states. [2018-02-02 10:09:36,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:36,552 INFO L93 Difference]: Finished difference Result 210 states and 224 transitions. [2018-02-02 10:09:36,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 10:09:36,552 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 73 [2018-02-02 10:09:36,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:36,553 INFO L225 Difference]: With dead ends: 210 [2018-02-02 10:09:36,553 INFO L226 Difference]: Without dead ends: 210 [2018-02-02 10:09:36,553 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1067 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=665, Invalid=3891, Unknown=0, NotChecked=0, Total=4556 [2018-02-02 10:09:36,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-02 10:09:36,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 176. [2018-02-02 10:09:36,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-02 10:09:36,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 193 transitions. [2018-02-02 10:09:36,555 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 193 transitions. Word has length 73 [2018-02-02 10:09:36,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:36,555 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 193 transitions. [2018-02-02 10:09:36,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 10:09:36,555 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 193 transitions. [2018-02-02 10:09:36,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 10:09:36,555 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:36,555 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:36,555 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:09:36,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1388057304, now seen corresponding path program 8 times [2018-02-02 10:09:36,556 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:36,570 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 10:09:36,963 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:09:36,967 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:09:36,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:09:36 BoogieIcfgContainer [2018-02-02 10:09:36,967 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:09:36,968 INFO L168 Benchmark]: Toolchain (without parser) took 52515.91 ms. Allocated memory was 403.2 MB in the beginning and 1.3 GB in the end (delta: 855.6 MB). Free memory was 359.9 MB in the beginning and 573.7 MB in the end (delta: -213.9 MB). Peak memory consumption was 641.8 MB. Max. memory is 5.3 GB. [2018-02-02 10:09:36,968 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 403.2 MB. Free memory is still 365.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:09:36,969 INFO L168 Benchmark]: CACSL2BoogieTranslator took 179.32 ms. Allocated memory is still 403.2 MB. Free memory was 359.9 MB in the beginning and 349.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:09:36,969 INFO L168 Benchmark]: Boogie Preprocessor took 28.64 ms. Allocated memory is still 403.2 MB. Free memory was 349.3 MB in the beginning and 346.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:09:36,969 INFO L168 Benchmark]: RCFGBuilder took 252.16 ms. Allocated memory is still 403.2 MB. Free memory was 346.7 MB in the beginning and 324.1 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:09:36,969 INFO L168 Benchmark]: TraceAbstraction took 52053.18 ms. Allocated memory was 403.2 MB in the beginning and 1.3 GB in the end (delta: 855.6 MB). Free memory was 321.5 MB in the beginning and 573.7 MB in the end (delta: -252.2 MB). Peak memory consumption was 603.4 MB. Max. memory is 5.3 GB. [2018-02-02 10:09:36,971 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.10 ms. Allocated memory is still 403.2 MB. Free memory is still 365.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 179.32 ms. Allocated memory is still 403.2 MB. Free memory was 359.9 MB in the beginning and 349.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.64 ms. Allocated memory is still 403.2 MB. Free memory was 349.3 MB in the beginning and 346.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 252.16 ms. Allocated memory is still 403.2 MB. Free memory was 346.7 MB in the beginning and 324.1 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 52053.18 ms. Allocated memory was 403.2 MB in the beginning and 1.3 GB in the end (delta: 855.6 MB). Free memory was 321.5 MB in the beginning and 573.7 MB in the end (delta: -252.2 MB). Peak memory consumption was 603.4 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 638). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 627]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 75 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 67 locations, 19 error locations. TIMEOUT Result, 52.0s OverallTime, 41 OverallIterations, 5 TraceHistogramMax, 32.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1563 SDtfs, 11410 SDslu, 14125 SDs, 0 SdLazy, 25183 SolverSat, 3194 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1715 GetRequests, 85 SyntacticMatches, 58 SemanticMatches, 1572 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17503 ImplicationChecksByTransitivity, 34.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 67/1191 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 40 MinimizatonAttempts, 823 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 17.7s InterpolantComputationTime, 2009 NumberOfCodeBlocks, 2009 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1969 ConstructedInterpolants, 0 QuantifiedInterpolants, 2853930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 6 PerfectInterpolantSequences, 67/1191 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/simple-ext_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-09-36-977.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple-ext_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-09-36-977.csv Completed graceful shutdown