java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 15:04:20,487 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 15:04:20,488 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 15:04:20,501 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 15:04:20,501 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 15:04:20,502 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 15:04:20,503 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 15:04:20,504 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 15:04:20,506 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 15:04:20,507 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 15:04:20,507 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 15:04:20,508 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 15:04:20,508 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 15:04:20,509 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 15:04:20,510 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 15:04:20,512 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 15:04:20,513 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 15:04:20,515 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 15:04:20,516 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 15:04:20,517 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 15:04:20,519 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 15:04:20,519 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 15:04:20,519 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 15:04:20,520 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 15:04:20,521 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 15:04:20,522 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 15:04:20,522 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 15:04:20,522 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 15:04:20,522 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 15:04:20,523 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 15:04:20,523 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 15:04:20,523 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 15:04:20,533 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 15:04:20,533 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 15:04:20,534 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 15:04:20,534 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 15:04:20,534 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 15:04:20,534 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 15:04:20,534 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 15:04:20,534 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 15:04:20,534 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 15:04:20,535 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 15:04:20,535 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 15:04:20,535 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 15:04:20,535 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 15:04:20,535 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 15:04:20,535 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 15:04:20,535 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 15:04:20,535 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 15:04:20,535 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 15:04:20,535 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 15:04:20,536 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 15:04:20,536 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 15:04:20,536 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 15:04:20,567 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 15:04:20,575 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 15:04:20,577 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 15:04:20,578 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 15:04:20,578 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 15:04:20,579 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-02-04 15:04:20,702 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 15:04:20,703 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 15:04:20,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 15:04:20,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 15:04:20,707 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 15:04:20,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:04:20" (1/1) ... [2018-02-04 15:04:20,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5663edf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:04:20, skipping insertion in model container [2018-02-04 15:04:20,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:04:20" (1/1) ... [2018-02-04 15:04:20,719 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 15:04:20,747 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 15:04:20,830 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 15:04:20,842 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 15:04:20,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:04:20 WrapperNode [2018-02-04 15:04:20,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 15:04:20,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 15:04:20,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 15:04:20,848 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 15:04:20,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:04:20" (1/1) ... [2018-02-04 15:04:20,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:04:20" (1/1) ... [2018-02-04 15:04:20,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:04:20" (1/1) ... [2018-02-04 15:04:20,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:04:20" (1/1) ... [2018-02-04 15:04:20,869 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:04:20" (1/1) ... [2018-02-04 15:04:20,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:04:20" (1/1) ... [2018-02-04 15:04:20,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:04:20" (1/1) ... [2018-02-04 15:04:20,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 15:04:20,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 15:04:20,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 15:04:20,876 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 15:04:20,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:04:20" (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-04 15:04:20,917 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 15:04:20,918 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 15:04:20,918 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-02-04 15:04:20,918 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-02-04 15:04:20,918 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrstr [2018-02-04 15:04:20,918 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 15:04:20,918 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 15:04:20,918 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 15:04:20,918 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 15:04:20,918 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 15:04:20,918 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 15:04:20,918 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 15:04:20,918 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-02-04 15:04:20,919 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-02-04 15:04:20,919 INFO L128 BoogieDeclarations]: Found specification of procedure cstrstr [2018-02-04 15:04:20,919 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 15:04:20,919 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 15:04:20,919 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 15:04:21,218 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 15:04:21,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:04:21 BoogieIcfgContainer [2018-02-04 15:04:21,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 15:04:21,219 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 15:04:21,219 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 15:04:21,221 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 15:04:21,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:04:20" (1/3) ... [2018-02-04 15:04:21,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e3c7b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:04:21, skipping insertion in model container [2018-02-04 15:04:21,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:04:20" (2/3) ... [2018-02-04 15:04:21,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e3c7b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:04:21, skipping insertion in model container [2018-02-04 15:04:21,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:04:21" (3/3) ... [2018-02-04 15:04:21,224 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-02-04 15:04:21,232 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 15:04:21,238 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-02-04 15:04:21,271 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 15:04:21,272 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 15:04:21,272 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 15:04:21,272 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 15:04:21,272 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 15:04:21,272 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 15:04:21,272 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 15:04:21,272 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 15:04:21,273 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 15:04:21,286 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2018-02-04 15:04:21,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 15:04:21,295 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:21,295 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:21,295 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:21,300 INFO L82 PathProgramCache]: Analyzing trace with hash -718609434, now seen corresponding path program 1 times [2018-02-04 15:04:21,347 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:21,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:21,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:21,519 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:04:21,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 15:04:21,520 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:21,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:21,521 INFO L182 omatonBuilderFactory]: Interpolants [96#(= 1 (select |#valid| main_~nondetString1~0.base)), 93#true, 94#false, 95#(= (select |#valid| |main_#t~malloc20.base|) 1)] [2018-02-04 15:04:21,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:21,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 15:04:21,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 15:04:21,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 15:04:21,536 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 4 states. [2018-02-04 15:04:21,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:21,699 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-02-04 15:04:21,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 15:04:21,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 15:04:21,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:21,709 INFO L225 Difference]: With dead ends: 89 [2018-02-04 15:04:21,709 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 15:04:21,710 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:04:21,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 15:04:21,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-02-04 15:04:21,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 15:04:21,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-02-04 15:04:21,736 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 13 [2018-02-04 15:04:21,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:21,736 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-02-04 15:04:21,736 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 15:04:21,736 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-02-04 15:04:21,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 15:04:21,737 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:21,737 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:21,737 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:21,737 INFO L82 PathProgramCache]: Analyzing trace with hash -718609433, now seen corresponding path program 1 times [2018-02-04 15:04:21,738 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:21,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:21,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:21,823 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:04:21,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 15:04:21,823 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:21,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:21,824 INFO L182 omatonBuilderFactory]: Interpolants [274#true, 275#false, 276#(<= 1 main_~length1~0), 277#(and (= 0 |main_#t~malloc20.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc20.base|)) (<= 1 main_~length1~0) (= (select |#valid| |main_#t~malloc20.base|) 1)), 278#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 279#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0))] [2018-02-04 15:04:21,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:21,825 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 15:04:21,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 15:04:21,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 15:04:21,826 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 6 states. [2018-02-04 15:04:21,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:21,872 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-02-04 15:04:21,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 15:04:21,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-04 15:04:21,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:21,873 INFO L225 Difference]: With dead ends: 85 [2018-02-04 15:04:21,873 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 15:04:21,874 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-02-04 15:04:21,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 15:04:21,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-02-04 15:04:21,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 15:04:21,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-02-04 15:04:21,879 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 13 [2018-02-04 15:04:21,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:21,880 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-02-04 15:04:21,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 15:04:21,880 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-02-04 15:04:21,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 15:04:21,880 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:21,881 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:21,881 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:21,881 INFO L82 PathProgramCache]: Analyzing trace with hash -802055959, now seen corresponding path program 1 times [2018-02-04 15:04:21,881 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:21,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:21,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:21,915 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:04:21,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 15:04:21,915 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:21,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:21,916 INFO L182 omatonBuilderFactory]: Interpolants [452#true, 453#false, 454#(= 1 (select |#valid| |main_#t~malloc21.base|)), 455#(= 1 (select |#valid| main_~nondetString2~0.base))] [2018-02-04 15:04:21,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:21,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 15:04:21,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 15:04:21,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 15:04:21,917 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 4 states. [2018-02-04 15:04:21,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:21,966 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-02-04 15:04:21,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 15:04:21,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 15:04:21,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:21,967 INFO L225 Difference]: With dead ends: 84 [2018-02-04 15:04:21,967 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 15:04:21,967 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:04:21,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 15:04:21,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-02-04 15:04:21,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 15:04:21,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2018-02-04 15:04:21,973 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 14 [2018-02-04 15:04:21,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:21,974 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-02-04 15:04:21,974 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 15:04:21,974 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2018-02-04 15:04:21,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 15:04:21,974 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:21,974 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:21,975 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:21,975 INFO L82 PathProgramCache]: Analyzing trace with hash -802055958, now seen corresponding path program 1 times [2018-02-04 15:04:21,976 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:21,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:22,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:22,036 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:04:22,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 15:04:22,036 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:22,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:22,036 INFO L182 omatonBuilderFactory]: Interpolants [626#true, 627#false, 628#(<= 1 main_~length2~0), 629#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|)) (<= 1 main_~length2~0)), 630#(and (= main_~nondetString2~0.offset 0) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base)))] [2018-02-04 15:04:22,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:22,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 15:04:22,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 15:04:22,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:04:22,038 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 5 states. [2018-02-04 15:04:22,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:22,075 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-02-04 15:04:22,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 15:04:22,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 15:04:22,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:22,076 INFO L225 Difference]: With dead ends: 83 [2018-02-04 15:04:22,076 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 15:04:22,077 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-04 15:04:22,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 15:04:22,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-02-04 15:04:22,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 15:04:22,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-02-04 15:04:22,081 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 14 [2018-02-04 15:04:22,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:22,081 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-02-04 15:04:22,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 15:04:22,082 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-02-04 15:04:22,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 15:04:22,082 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:22,082 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:22,082 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:22,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1145880583, now seen corresponding path program 1 times [2018-02-04 15:04:22,083 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:22,093 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:22,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:22,118 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:04:22,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 15:04:22,118 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:22,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:22,118 INFO L182 omatonBuilderFactory]: Interpolants [800#false, 801#(= 1 (select |#valid| main_~nondetString2~0.base)), 802#(= 1 (select |#valid| |cstrstr_#in~find.base|)), 803#(= 1 (select |#valid| |cstrstr_#t~post11.base|)), 799#true] [2018-02-04 15:04:22,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:22,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 15:04:22,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 15:04:22,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:04:22,119 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 5 states. [2018-02-04 15:04:22,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:22,191 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-02-04 15:04:22,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 15:04:22,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 15:04:22,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:22,196 INFO L225 Difference]: With dead ends: 82 [2018-02-04 15:04:22,196 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 15:04:22,196 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 15:04:22,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 15:04:22,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-02-04 15:04:22,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 15:04:22,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-02-04 15:04:22,200 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 17 [2018-02-04 15:04:22,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:22,201 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-02-04 15:04:22,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 15:04:22,201 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-02-04 15:04:22,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 15:04:22,201 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:22,202 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:22,202 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:22,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1145880582, now seen corresponding path program 1 times [2018-02-04 15:04:22,203 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:22,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:22,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:22,290 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:04:22,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 15:04:22,291 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:22,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:22,291 INFO L182 omatonBuilderFactory]: Interpolants [976#(and (<= 1 (select |#length| |cstrstr_#in~find.base|)) (= 0 |cstrstr_#in~find.offset|)), 977#(and (<= 1 (select |#length| |cstrstr_#t~post11.base|)) (= |cstrstr_#t~post11.offset| 0)), 970#true, 971#false, 972#(<= 1 main_~length2~0), 973#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|)) (<= 1 main_~length2~0)), 974#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 975#(and (= 0 main_~nondetString2~0.offset) (<= 1 (select |#length| main_~nondetString2~0.base)))] [2018-02-04 15:04:22,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:22,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 15:04:22,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 15:04:22,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 15:04:22,292 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 8 states. [2018-02-04 15:04:22,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:22,388 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-02-04 15:04:22,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 15:04:22,389 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-02-04 15:04:22,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:22,390 INFO L225 Difference]: With dead ends: 81 [2018-02-04 15:04:22,390 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 15:04:22,390 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 15:04:22,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 15:04:22,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-04 15:04:22,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 15:04:22,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-02-04 15:04:22,396 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 17 [2018-02-04 15:04:22,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:22,397 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-02-04 15:04:22,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 15:04:22,397 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-02-04 15:04:22,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 15:04:22,398 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:22,398 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-04 15:04:22,398 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:22,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1883098626, now seen corresponding path program 1 times [2018-02-04 15:04:22,399 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:22,412 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:22,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:22,450 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:04:22,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 15:04:22,451 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:22,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:22,451 INFO L182 omatonBuilderFactory]: Interpolants [1144#true, 1145#false, 1146#(= 1 (select |#valid| main_~nondetString2~0.base)), 1147#(= 1 (select |#valid| |cstrstr_#in~find.base|)), 1148#(= 1 (select |#valid| cstrstr_~find.base)), 1149#(= 1 (select |#valid| |cstrlen_#in~str.base|)), 1150#(= 1 (select |#valid| cstrlen_~s~0.base))] [2018-02-04 15:04:22,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:22,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 15:04:22,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 15:04:22,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 15:04:22,452 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 7 states. [2018-02-04 15:04:22,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:22,574 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2018-02-04 15:04:22,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 15:04:22,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-04 15:04:22,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:22,575 INFO L225 Difference]: With dead ends: 80 [2018-02-04 15:04:22,575 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 15:04:22,575 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 15:04:22,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 15:04:22,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-04 15:04:22,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 15:04:22,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-02-04 15:04:22,580 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 23 [2018-02-04 15:04:22,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:22,580 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-02-04 15:04:22,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 15:04:22,580 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-02-04 15:04:22,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 15:04:22,581 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:22,581 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-04 15:04:22,581 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:22,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1883098625, now seen corresponding path program 1 times [2018-02-04 15:04:22,584 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:22,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:22,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:22,711 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:04:22,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 15:04:22,711 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:22,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:22,711 INFO L182 omatonBuilderFactory]: Interpolants [1315#true, 1316#false, 1317#(and (<= main_~length2~0 1) (<= 1 main_~length2~0)), 1318#(and (<= main_~length2~0 1) (= 0 |main_#t~malloc21.offset|) (<= 1 main_~length2~0)), 1319#(and (= main_~nondetString2~0.offset 0) (<= 1 main_~length2~0) (<= (+ main_~nondetString2~0.offset main_~length2~0) 1)), 1320#(and (= main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString2~0.base) main_~nondetString2~0.offset))), 1321#(= 0 (select (select |#memory_int| |cstrstr_#in~find.base|) |cstrstr_#in~find.offset|)), 1322#(= 0 (select (select |#memory_int| |cstrstr_#t~post11.base|) |cstrstr_#t~post11.offset|)), 1323#(= 0 |cstrstr_#t~mem12|), 1324#(= 0 cstrstr_~c~0)] [2018-02-04 15:04:22,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:22,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 15:04:22,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 15:04:22,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 15:04:22,712 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 10 states. [2018-02-04 15:04:22,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:22,804 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-02-04 15:04:22,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 15:04:22,804 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-02-04 15:04:22,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:22,806 INFO L225 Difference]: With dead ends: 104 [2018-02-04 15:04:22,806 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 15:04:22,807 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-02-04 15:04:22,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 15:04:22,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2018-02-04 15:04:22,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 15:04:22,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2018-02-04 15:04:22,810 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 23 [2018-02-04 15:04:22,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:22,810 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2018-02-04 15:04:22,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 15:04:22,810 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2018-02-04 15:04:22,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 15:04:22,811 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:22,811 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-04 15:04:22,811 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:22,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1390800317, now seen corresponding path program 1 times [2018-02-04 15:04:22,811 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:22,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:22,997 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:04:22,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 15:04:22,997 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:22,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:22,997 INFO L182 omatonBuilderFactory]: Interpolants [1537#true, 1538#false, 1539#(<= 1 main_~length2~0), 1540#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|)) (<= 1 main_~length2~0)), 1541#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 1542#(and (= 0 main_~nondetString2~0.offset) (or (= 0 (select (select |#memory_int| main_~nondetString2~0.base) main_~nondetString2~0.offset)) (<= 2 (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base))))), 1543#(and (or (= 0 (select (select |#memory_int| |cstrstr_#in~find.base|) |cstrstr_#in~find.offset|)) (<= 2 (select |#length| |cstrstr_#in~find.base|))) (= 0 |cstrstr_#in~find.offset|)), 1544#(and (<= (+ |cstrstr_#t~post11.offset| 1) cstrstr_~find.offset) (or (= 0 (select (select |#memory_int| |cstrstr_#t~post11.base|) |cstrstr_#t~post11.offset|)) (<= (+ cstrstr_~find.offset 1) (+ |cstrstr_#t~post11.offset| (select |#length| cstrstr_~find.base)))) (= |cstrstr_#t~post11.offset| 0)), 1545#(and (or (= 0 |cstrstr_#t~mem12|) (<= (+ cstrstr_~find.offset 1) (select |#length| cstrstr_~find.base))) (<= 1 cstrstr_~find.offset)), 1546#(and (or (= 0 cstrstr_~c~0) (<= (+ cstrstr_~find.offset 1) (select |#length| cstrstr_~find.base))) (<= 1 cstrstr_~find.offset)), 1547#(and (<= (+ cstrstr_~find.offset 1) (select |#length| cstrstr_~find.base)) (<= 1 cstrstr_~find.offset)), 1548#(and (<= (+ |cstrlen_#in~str.offset| 1) (select |#length| |cstrlen_#in~str.base|)) (<= 1 |cstrlen_#in~str.offset|)), 1549#(and (<= 1 cstrlen_~s~0.offset) (<= (+ cstrlen_~s~0.offset 1) (select |#length| cstrlen_~s~0.base)))] [2018-02-04 15:04:22,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:22,998 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 15:04:22,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 15:04:22,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-04 15:04:22,998 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 13 states. [2018-02-04 15:04:23,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:23,275 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2018-02-04 15:04:23,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 15:04:23,275 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-02-04 15:04:23,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:23,276 INFO L225 Difference]: With dead ends: 104 [2018-02-04 15:04:23,276 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 15:04:23,276 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2018-02-04 15:04:23,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 15:04:23,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2018-02-04 15:04:23,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 15:04:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-02-04 15:04:23,278 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 23 [2018-02-04 15:04:23,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:23,279 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-02-04 15:04:23,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 15:04:23,279 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-02-04 15:04:23,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 15:04:23,279 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:23,279 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:23,280 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:23,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1853436480, now seen corresponding path program 1 times [2018-02-04 15:04:23,280 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:23,291 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:23,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:23,492 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:23,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 15:04:23,493 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:23,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:23,495 INFO L182 omatonBuilderFactory]: Interpolants [1768#true, 1769#false, 1770#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|))), 1771#(and (= 0 main_~nondetString2~0.offset) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 1772#(and (= 0 main_~nondetString2~0.offset) (or (= 0 (select (select |#memory_int| main_~nondetString2~0.base) 1)) (<= (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base)) 1) (<= 3 (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base))))), 1773#(and (or (<= 3 (select |#length| |cstrstr_#in~find.base|)) (= 0 (select (select |#memory_int| |cstrstr_#in~find.base|) 1)) (<= (select |#length| |cstrstr_#in~find.base|) 1)) (= 0 |cstrstr_#in~find.offset|)), 1774#(and (or (<= (+ |cstrstr_#t~post11.offset| (select |#length| cstrstr_~find.base)) cstrstr_~find.offset) (and (<= cstrstr_~find.offset (+ |cstrstr_#t~post11.offset| 1)) (= 0 (select (select |#memory_int| cstrstr_~find.base) 1)) (<= (+ |cstrstr_#t~post11.offset| 1) cstrstr_~find.offset)) (<= (+ cstrstr_~find.offset 2) (+ |cstrstr_#t~post11.offset| (select |#length| cstrstr_~find.base)))) (= |cstrstr_#t~post11.offset| 0)), 1775#(or (<= (+ cstrstr_~find.offset 2) (select |#length| cstrstr_~find.base)) (and (<= cstrstr_~find.offset 1) (= 0 (select (select |#memory_int| cstrstr_~find.base) 1)) (<= 1 cstrstr_~find.offset)) (<= (select |#length| cstrstr_~find.base) cstrstr_~find.offset)), 1776#(or (<= (select |#length| |cstrlen_#in~str.base|) |cstrlen_#in~str.offset|) (<= (+ |cstrlen_#in~str.offset| 2) (select |#length| |cstrlen_#in~str.base|)) (and (= 0 (select (select |#memory_int| |cstrlen_#in~str.base|) 1)) (= 1 |cstrlen_#in~str.offset|))), 1777#(or (= 0 (select (select |#memory_int| cstrlen_~s~0.base) cstrlen_~s~0.offset)) (<= (select |#length| cstrlen_~s~0.base) cstrlen_~s~0.offset) (<= (+ cstrlen_~s~0.offset 2) (select |#length| cstrlen_~s~0.base))), 1778#(and (or (= |cstrlen_#t~mem1| 0) (<= (+ cstrlen_~s~0.offset 2) (select |#length| cstrlen_~s~0.base))) (<= 0 cstrlen_~s~0.offset)), 1779#(and (<= (+ cstrlen_~s~0.offset 2) (select |#length| cstrlen_~s~0.base)) (<= 0 cstrlen_~s~0.offset)), 1780#(and (<= 1 cstrlen_~s~0.offset) (<= (+ cstrlen_~s~0.offset 1) (select |#length| cstrlen_~s~0.base)))] [2018-02-04 15:04:23,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:23,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 15:04:23,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 15:04:23,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-04 15:04:23,495 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 13 states. [2018-02-04 15:04:23,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:23,843 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2018-02-04 15:04:23,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 15:04:23,843 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-02-04 15:04:23,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:23,844 INFO L225 Difference]: With dead ends: 108 [2018-02-04 15:04:23,844 INFO L226 Difference]: Without dead ends: 108 [2018-02-04 15:04:23,844 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2018-02-04 15:04:23,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-04 15:04:23,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2018-02-04 15:04:23,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-04 15:04:23,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2018-02-04 15:04:23,848 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 27 [2018-02-04 15:04:23,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:23,848 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2018-02-04 15:04:23,848 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 15:04:23,848 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2018-02-04 15:04:23,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 15:04:23,849 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:23,849 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:23,849 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:23,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1699013504, now seen corresponding path program 1 times [2018-02-04 15:04:23,849 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:23,855 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:23,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:23,899 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:04:23,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 15:04:23,899 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:23,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:23,900 INFO L182 omatonBuilderFactory]: Interpolants [2007#true, 2008#false, 2009#(= |#valid| |old(#valid)|), 2010#(and (= (store |#valid| |main_#t~malloc20.base| 0) |old(#valid)|) (= (select |#valid| |main_#t~malloc20.base|) 1)), 2011#(and (= (store (store |#valid| |main_#t~malloc21.base| 0) |main_#t~malloc20.base| (select (store |#valid| |main_#t~malloc20.base| 0) |main_#t~malloc20.base|)) |old(#valid)|) (not (= |main_#t~malloc20.base| |main_#t~malloc21.base|))), 2012#(= (store |#valid| |main_#t~malloc21.base| (select (store |#valid| |main_#t~malloc21.base| 0) |main_#t~malloc21.base|)) |old(#valid)|)] [2018-02-04 15:04:23,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:23,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 15:04:23,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 15:04:23,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 15:04:23,900 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 6 states. [2018-02-04 15:04:24,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:24,086 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2018-02-04 15:04:24,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 15:04:24,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-02-04 15:04:24,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:24,087 INFO L225 Difference]: With dead ends: 99 [2018-02-04 15:04:24,087 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 15:04:24,087 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 15:04:24,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 15:04:24,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-02-04 15:04:24,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 15:04:24,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2018-02-04 15:04:24,089 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 28 [2018-02-04 15:04:24,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:24,089 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-02-04 15:04:24,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 15:04:24,089 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2018-02-04 15:04:24,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 15:04:24,089 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:24,089 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:24,089 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:24,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1948682038, now seen corresponding path program 1 times [2018-02-04 15:04:24,090 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:24,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:24,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-04 15:04:24,113 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:04:24,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 15:04:24,113 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:24,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:24,113 INFO L182 omatonBuilderFactory]: Interpolants [2192#false, 2193#(= 1 (select |#valid| main_~nondetString1~0.base)), 2194#(= 1 (select |#valid| |cstrstr_#in~s.base|)), 2195#(= 1 (select |#valid| cstrstr_~s.base)), 2196#(= 1 (select |#valid| |cstrstr_#t~post15.base|)), 2191#true] [2018-02-04 15:04:24,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:24,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 15:04:24,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 15:04:24,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 15:04:24,114 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 6 states. [2018-02-04 15:04:24,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:24,153 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-02-04 15:04:24,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 15:04:24,153 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-04 15:04:24,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:24,154 INFO L225 Difference]: With dead ends: 74 [2018-02-04 15:04:24,154 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 15:04:24,154 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 15:04:24,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 15:04:24,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-04 15:04:24,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 15:04:24,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2018-02-04 15:04:24,155 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 31 [2018-02-04 15:04:24,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:24,156 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-02-04 15:04:24,156 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 15:04:24,156 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-02-04 15:04:24,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 15:04:24,156 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:24,156 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:24,156 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:24,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1948682039, now seen corresponding path program 1 times [2018-02-04 15:04:24,157 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:24,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:24,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:24,250 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:04:24,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 15:04:24,250 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:24,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:24,251 INFO L182 omatonBuilderFactory]: Interpolants [2352#(and (= 0 |main_#t~malloc20.offset|) (<= 1 main_~length1~0)), 2353#(and (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 2354#(and (<= (+ main_~nondetString1~0.offset 1) (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 2355#(and (= 0 |cstrstr_#in~s.offset|) (<= 1 (select |#length| |cstrstr_#in~s.base|))), 2356#(and (<= 1 (select |#length| cstrstr_~s.base)) (= 0 cstrstr_~s.offset)), 2357#(and (<= 1 (select |#length| |cstrstr_#t~post15.base|)) (= |cstrstr_#t~post15.offset| 0)), 2349#true, 2350#false, 2351#(<= 1 main_~length1~0)] [2018-02-04 15:04:24,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:24,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 15:04:24,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 15:04:24,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 15:04:24,252 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 9 states. [2018-02-04 15:04:24,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:24,362 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2018-02-04 15:04:24,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 15:04:24,362 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-02-04 15:04:24,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:24,363 INFO L225 Difference]: With dead ends: 79 [2018-02-04 15:04:24,363 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 15:04:24,364 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-02-04 15:04:24,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 15:04:24,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-02-04 15:04:24,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 15:04:24,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-02-04 15:04:24,365 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 31 [2018-02-04 15:04:24,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:24,366 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-02-04 15:04:24,366 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 15:04:24,366 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-02-04 15:04:24,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 15:04:24,366 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:24,367 INFO L351 BasicCegarLoop]: trace histogram [3, 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-04 15:04:24,367 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:24,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1308654915, now seen corresponding path program 2 times [2018-02-04 15:04:24,368 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:24,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:24,524 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:24,524 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:24,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 15:04:24,526 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:24,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:24,526 INFO L182 omatonBuilderFactory]: Interpolants [2528#(= 0 (select (select |#memory_int| cstrstr_~find.base) (+ (select |#length| cstrstr_~find.base) (- 1)))), 2529#(= 0 (select (select |#memory_int| |cstrlen_#in~str.base|) (+ (select |#length| |cstrlen_#in~str.base|) (- 1)))), 2530#(= 0 (select (select |#memory_int| cstrlen_~s~0.base) (+ (select |#length| cstrlen_~s~0.base) (- 1)))), 2531#(and (= 0 (select (select |#memory_int| cstrlen_~s~0.base) (+ (select |#length| cstrlen_~s~0.base) (- 1)))) (<= 0 cstrlen_~s~0.offset)), 2532#(and (<= 1 cstrlen_~s~0.offset) (or (= 0 (select (select |#memory_int| cstrlen_~s~0.base) cstrlen_~s~0.offset)) (<= (select |#length| cstrlen_~s~0.base) cstrlen_~s~0.offset) (<= (+ cstrlen_~s~0.offset 2) (select |#length| cstrlen_~s~0.base)))), 2533#(and (<= 1 cstrlen_~s~0.offset) (or (= |cstrlen_#t~mem1| 0) (<= (+ cstrlen_~s~0.offset 2) (select |#length| cstrlen_~s~0.base)))), 2534#(and (<= 1 cstrlen_~s~0.offset) (<= (+ cstrlen_~s~0.offset 2) (select |#length| cstrlen_~s~0.base))), 2535#(and (<= 2 cstrlen_~s~0.offset) (<= (+ cstrlen_~s~0.offset 1) (select |#length| cstrlen_~s~0.base))), 2522#true, 2523#false, 2524#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|))), 2525#(and (= main_~nondetString2~0.offset 0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 2526#(and (= main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString2~0.base) (+ (select |#length| main_~nondetString2~0.base) (+ main_~nondetString2~0.offset (- 1)))))), 2527#(= 0 (select (select |#memory_int| |cstrstr_#in~find.base|) (+ (select |#length| |cstrstr_#in~find.base|) (- 1))))] [2018-02-04 15:04:24,526 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:24,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 15:04:24,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 15:04:24,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-02-04 15:04:24,527 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 14 states. [2018-02-04 15:04:24,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:24,857 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2018-02-04 15:04:24,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 15:04:24,858 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2018-02-04 15:04:24,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:24,859 INFO L225 Difference]: With dead ends: 84 [2018-02-04 15:04:24,859 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 15:04:24,859 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2018-02-04 15:04:24,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 15:04:24,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 70. [2018-02-04 15:04:24,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 15:04:24,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-02-04 15:04:24,860 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 31 [2018-02-04 15:04:24,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:24,861 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-02-04 15:04:24,861 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 15:04:24,861 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-02-04 15:04:24,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 15:04:24,861 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:24,861 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:24,861 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:24,861 INFO L82 PathProgramCache]: Analyzing trace with hash -211494479, now seen corresponding path program 1 times [2018-02-04 15:04:24,862 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:24,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:25,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:25,019 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:04:25,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 15:04:25,020 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:25,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:25,020 INFO L182 omatonBuilderFactory]: Interpolants [2720#(= 0 (select (select |#memory_int| |cstrstr_#in~s.base|) |cstrstr_#in~s.offset|)), 2721#(= 0 (select (select |#memory_int| cstrstr_~s.base) cstrstr_~s.offset)), 2722#(= 0 (select (select |#memory_int| |cstrstr_#t~post15.base|) |cstrstr_#t~post15.offset|)), 2723#(= 0 |cstrstr_#t~mem16|), 2724#(= cstrstr_~sc~0 0), 2712#true, 2713#false, 2714#(and (<= 1 main_~length1~0) (<= main_~length1~0 1)), 2715#(and (= 0 |main_#t~malloc20.offset|) (<= 1 main_~length1~0) (<= main_~length1~0 1) (= (select |#valid| |main_#t~malloc20.base|) 1)), 2716#(and (= (select |#valid| main_~nondetString1~0.base) 1) (<= 1 main_~length1~0) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 2717#(and (not (= main_~nondetString1~0.base |main_#t~malloc21.base|)) (<= 1 main_~length1~0) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 2718#(and (<= 1 main_~length1~0) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 2719#(and (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) main_~nondetString1~0.offset)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0))] [2018-02-04 15:04:25,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:25,020 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 15:04:25,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 15:04:25,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-04 15:04:25,021 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 13 states. [2018-02-04 15:04:25,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:25,142 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-02-04 15:04:25,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 15:04:25,142 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-02-04 15:04:25,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:25,143 INFO L225 Difference]: With dead ends: 89 [2018-02-04 15:04:25,143 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 15:04:25,143 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2018-02-04 15:04:25,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 15:04:25,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-04 15:04:25,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 15:04:25,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-02-04 15:04:25,152 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 36 [2018-02-04 15:04:25,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:25,152 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-02-04 15:04:25,152 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 15:04:25,152 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-02-04 15:04:25,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 15:04:25,152 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:25,152 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:25,152 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:25,153 INFO L82 PathProgramCache]: Analyzing trace with hash -188862225, now seen corresponding path program 1 times [2018-02-04 15:04:25,153 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:25,161 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:25,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:25,335 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:25,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 15:04:25,336 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:25,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:25,336 INFO L182 omatonBuilderFactory]: Interpolants [2912#(and (or (= cstrstr_~sc~0 0) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base))) (<= 1 cstrstr_~s.offset)), 2913#(and (<= 1 cstrstr_~s.offset) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base))), 2914#(and (<= (+ |cstrstr_#t~post15.offset| 1) (select |#length| |cstrstr_#t~post15.base|)) (<= 1 |cstrstr_#t~post15.offset|)), 2900#true, 2901#false, 2902#(<= 1 main_~length1~0), 2903#(and (= 0 |main_#t~malloc20.offset|) (<= 1 main_~length1~0) (= (select |#valid| |main_#t~malloc20.base|) 1)), 2904#(and (= 0 main_~nondetString1~0.offset) (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 1)) (= (select |#valid| main_~nondetString1~0.base) 1)) (<= 1 main_~length1~0)), 2905#(and (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 1)) (not (= main_~nondetString1~0.base |main_#t~malloc21.base|))) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 2906#(and (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 1)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 2907#(and (= 0 main_~nondetString1~0.offset) (or (and (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) main_~nondetString1~0.offset)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (<= 2 (select |#length| main_~nondetString1~0.base)))), 2908#(and (or (= 0 (select (select |#memory_int| |cstrstr_#in~s.base|) |cstrstr_#in~s.offset|)) (<= 2 (select |#length| |cstrstr_#in~s.base|))) (= 0 |cstrstr_#in~s.offset|)), 2909#(and (or (= 0 (select (select |#memory_int| cstrstr_~s.base) cstrstr_~s.offset)) (<= 2 (select |#length| cstrstr_~s.base))) (= 0 cstrstr_~s.offset)), 2910#(and (or (<= (+ cstrstr_~s.offset 1) (+ |cstrstr_#t~post15.offset| (select |#length| |cstrstr_#t~post15.base|))) (= 0 (select (select |#memory_int| |cstrstr_#t~post15.base|) |cstrstr_#t~post15.offset|))) (<= (+ |cstrstr_#t~post15.offset| 1) cstrstr_~s.offset) (= |cstrstr_#t~post15.offset| 0) (= |cstrstr_#t~post15.base| cstrstr_~s.base)), 2911#(and (<= 1 cstrstr_~s.offset) (or (= 0 |cstrstr_#t~mem16|) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base))))] [2018-02-04 15:04:25,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:25,336 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 15:04:25,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 15:04:25,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-04 15:04:25,336 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 15 states. [2018-02-04 15:04:25,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:25,643 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2018-02-04 15:04:25,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 15:04:25,644 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-02-04 15:04:25,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:25,644 INFO L225 Difference]: With dead ends: 81 [2018-02-04 15:04:25,644 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 15:04:25,645 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2018-02-04 15:04:25,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 15:04:25,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-02-04 15:04:25,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-04 15:04:25,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-02-04 15:04:25,647 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 36 [2018-02-04 15:04:25,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:25,647 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-02-04 15:04:25,647 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 15:04:25,647 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-02-04 15:04:25,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 15:04:25,649 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:25,649 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:25,649 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:25,649 INFO L82 PathProgramCache]: Analyzing trace with hash -7823713, now seen corresponding path program 1 times [2018-02-04 15:04:25,649 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:25,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:25,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:25,686 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:04:25,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 15:04:25,686 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:25,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:25,686 INFO L182 omatonBuilderFactory]: Interpolants [3095#true, 3096#false, 3097#(= 1 (select |#valid| main_~nondetString1~0.base)), 3098#(= 1 (select |#valid| |cstrstr_#in~s.base|)), 3099#(= 1 (select |#valid| cstrstr_~s.base)), 3100#(= 1 (select |#valid| |cstrncmp_#in~s1.base|)), 3101#(= 1 (select |#valid| cstrncmp_~s1.base))] [2018-02-04 15:04:25,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:25,686 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 15:04:25,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 15:04:25,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 15:04:25,687 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 7 states. [2018-02-04 15:04:25,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:25,746 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2018-02-04 15:04:25,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 15:04:25,746 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-02-04 15:04:25,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:25,747 INFO L225 Difference]: With dead ends: 77 [2018-02-04 15:04:25,747 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 15:04:25,747 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 15:04:25,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 15:04:25,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-04 15:04:25,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 15:04:25,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-02-04 15:04:25,749 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 39 [2018-02-04 15:04:25,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:25,750 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-02-04 15:04:25,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 15:04:25,750 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-02-04 15:04:25,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 15:04:25,751 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:25,751 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:25,751 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:25,751 INFO L82 PathProgramCache]: Analyzing trace with hash -7823712, now seen corresponding path program 1 times [2018-02-04 15:04:25,752 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:25,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:25,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:25,841 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:04:25,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 15:04:25,841 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:25,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:25,842 INFO L182 omatonBuilderFactory]: Interpolants [3264#(and (<= |cstrstr_#t~ret13| 0) (<= 0 |cstrstr_#t~ret13|)), 3265#(and (<= 0 cstrstr_~len~0) (<= cstrstr_~len~0 0)), 3266#(and (<= 0 |cstrncmp_#in~n|) (<= |cstrncmp_#in~n| 0)), 3267#(and (< 0 (+ (div cstrncmp_~n 4294967296) 1)) (<= cstrncmp_~n (* 4294967296 (div cstrncmp_~n 4294967296)))), 3260#true, 3261#false, 3262#(= cstrlen_~s~0.offset cstrlen_~str.offset), 3263#(and (<= 0 |cstrlen_#res|) (<= |cstrlen_#res| 0))] [2018-02-04 15:04:25,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:25,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 15:04:25,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 15:04:25,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 15:04:25,843 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 8 states. [2018-02-04 15:04:25,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:25,893 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-02-04 15:04:25,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 15:04:25,893 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-02-04 15:04:25,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:25,894 INFO L225 Difference]: With dead ends: 111 [2018-02-04 15:04:25,894 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 15:04:25,894 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 15:04:25,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 15:04:25,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-02-04 15:04:25,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 15:04:25,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2018-02-04 15:04:25,897 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 39 [2018-02-04 15:04:25,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:25,898 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2018-02-04 15:04:25,898 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 15:04:25,898 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2018-02-04 15:04:25,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 15:04:25,898 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:25,898 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:25,898 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:25,899 INFO L82 PathProgramCache]: Analyzing trace with hash -701857031, now seen corresponding path program 2 times [2018-02-04 15:04:25,899 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:25,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:26,279 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:26,279 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:26,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 15:04:26,279 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:26,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:26,280 INFO L182 omatonBuilderFactory]: Interpolants [3492#true, 3493#false, 3494#(and (= 0 |main_#t~malloc20.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc20.base|)) (= (select |#valid| |main_#t~malloc20.base|) 1)), 3495#(and (= 0 main_~nondetString1~0.offset) (= (select |#valid| main_~nondetString1~0.base) 1) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2))), 3496#(and (= 0 main_~nondetString1~0.offset) (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 2)) (not (= main_~nondetString1~0.base |main_#t~malloc21.base|))) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2))), 3497#(and (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 2)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (= 0 main_~nondetString1~0.offset) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2))), 3498#(and (or (and (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) 1)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (<= 3 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (<= (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base)) 1)) (= 0 main_~nondetString1~0.offset)), 3499#(and (= 0 |cstrstr_#in~s.offset|) (or (= 0 (select (select |#memory_int| |cstrstr_#in~s.base|) 1)) (<= 3 (select |#length| |cstrstr_#in~s.base|)) (<= (select |#length| |cstrstr_#in~s.base|) 1))), 3500#(and (or (= 0 (select (select |#memory_int| cstrstr_~s.base) 1)) (<= 3 (select |#length| cstrstr_~s.base)) (<= (select |#length| cstrstr_~s.base) 1)) (= 0 cstrstr_~s.offset)), 3501#(and (or (and (or (<= (+ |cstrstr_#t~post15.offset| (select |#length| |cstrstr_#t~post15.base|)) cstrstr_~s.offset) (<= (+ cstrstr_~s.offset 2) (+ |cstrstr_#t~post15.offset| (select |#length| |cstrstr_#t~post15.base|)))) (<= (+ |cstrstr_#t~post15.offset| 1) cstrstr_~s.offset) (= |cstrstr_#t~post15.base| cstrstr_~s.base)) (and (<= (+ |cstrstr_#t~post15.offset| 1) cstrstr_~s.offset) (= 0 (select (select |#memory_int| |cstrstr_#t~post15.base|) 1)) (= |cstrstr_#t~post15.base| cstrstr_~s.base) (<= cstrstr_~s.offset (+ |cstrstr_#t~post15.offset| 1)))) (= |cstrstr_#t~post15.offset| 0)), 3502#(or (and (<= 1 cstrstr_~s.offset) (or (<= (+ cstrstr_~s.offset 2) (select |#length| cstrstr_~s.base)) (<= (select |#length| cstrstr_~s.base) cstrstr_~s.offset))) (and (= 0 (select (select |#memory_int| cstrstr_~s.base) 1)) (<= cstrstr_~s.offset 1) (<= 1 cstrstr_~s.offset))), 3503#(or (and (= 1 |cstrstr_#t~post15.offset|) (= 0 (select (select |#memory_int| |cstrstr_#t~post15.base|) |cstrstr_#t~post15.offset|))) (and (or (<= (select |#length| |cstrstr_#t~post15.base|) |cstrstr_#t~post15.offset|) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base))) (<= 2 cstrstr_~s.offset))), 3504#(or (and (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base)) (<= 2 cstrstr_~s.offset)) (= 0 |cstrstr_#t~mem16|)), 3505#(or (= cstrstr_~sc~0 0) (and (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base)) (<= 2 cstrstr_~s.offset))), 3506#(and (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base)) (<= 2 cstrstr_~s.offset)), 3507#(and (<= (+ |cstrstr_#t~post15.offset| 1) (select |#length| |cstrstr_#t~post15.base|)) (<= 2 |cstrstr_#t~post15.offset|))] [2018-02-04 15:04:26,280 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:26,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 15:04:26,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 15:04:26,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-02-04 15:04:26,280 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand 16 states. [2018-02-04 15:04:26,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:26,829 INFO L93 Difference]: Finished difference Result 131 states and 148 transitions. [2018-02-04 15:04:26,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 15:04:26,829 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-02-04 15:04:26,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:26,830 INFO L225 Difference]: With dead ends: 131 [2018-02-04 15:04:26,830 INFO L226 Difference]: Without dead ends: 131 [2018-02-04 15:04:26,830 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2018-02-04 15:04:26,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-04 15:04:26,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2018-02-04 15:04:26,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-04 15:04:26,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 144 transitions. [2018-02-04 15:04:26,833 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 144 transitions. Word has length 41 [2018-02-04 15:04:26,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:26,833 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 144 transitions. [2018-02-04 15:04:26,833 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 15:04:26,834 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 144 transitions. [2018-02-04 15:04:26,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 15:04:26,834 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:26,834 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:26,834 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:26,835 INFO L82 PathProgramCache]: Analyzing trace with hash 648064035, now seen corresponding path program 1 times [2018-02-04 15:04:26,835 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:26,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:27,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 15:04:27,085 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:04:27,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-04 15:04:27,085 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:27,085 INFO L182 omatonBuilderFactory]: Interpolants [3790#true, 3791#false, 3792#(<= 1 main_~length1~0), 3793#(and (= 0 |main_#t~malloc20.offset|) (<= 1 main_~length1~0) (= (select |#valid| |main_#t~malloc20.base|) 1)), 3794#(and (= 0 main_~nondetString1~0.offset) (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 1)) (= (select |#valid| main_~nondetString1~0.base) 1)) (<= 1 main_~length1~0)), 3795#(and (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 1)) (not (= main_~nondetString1~0.base |main_#t~malloc21.base|))) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 3796#(and (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 1)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 3797#(and (= 0 main_~nondetString1~0.offset) (or (and (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) main_~nondetString1~0.offset)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (<= 2 (select |#length| main_~nondetString1~0.base)))), 3798#(and (or (= 0 (select (select |#memory_int| |cstrstr_#in~s.base|) |cstrstr_#in~s.offset|)) (<= 2 (select |#length| |cstrstr_#in~s.base|))) (= 0 |cstrstr_#in~s.offset|)), 3799#(and (or (= 0 (select (select |#memory_int| cstrstr_~s.base) cstrstr_~s.offset)) (<= 2 (select |#length| cstrstr_~s.base))) (= 0 cstrstr_~s.offset)), 3800#(and (= |cstrstr_#t~post15.offset| 0) (= |cstrstr_#t~post15.base| cstrstr_~s.base) (or (and (<= (+ cstrstr_~s.offset 1) (+ |cstrstr_#t~post15.offset| (select |#length| |cstrstr_#t~post15.base|))) (<= (+ |cstrstr_#t~post15.offset| 1) cstrstr_~s.offset)) (= 0 (select (select |#memory_int| |cstrstr_#t~post15.base|) |cstrstr_#t~post15.offset|)))), 3801#(or (= 0 |cstrstr_#t~mem16|) (and (<= 1 cstrstr_~s.offset) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base)))), 3802#(or (= cstrstr_~sc~0 0) (and (<= 1 cstrstr_~s.offset) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base)))), 3803#(and (<= 1 cstrstr_~s.offset) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base))), 3804#(and (<= (+ |cstrncmp_#in~s1.offset| 1) (select |#length| |cstrncmp_#in~s1.base|)) (<= 1 |cstrncmp_#in~s1.offset|)), 3805#(and (<= 1 cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 1) (select |#length| cstrncmp_~s1.base)))] [2018-02-04 15:04:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 15:04:27,086 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 15:04:27,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 15:04:27,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-02-04 15:04:27,086 INFO L87 Difference]: Start difference. First operand 127 states and 144 transitions. Second operand 16 states. [2018-02-04 15:04:27,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:27,405 INFO L93 Difference]: Finished difference Result 172 states and 192 transitions. [2018-02-04 15:04:27,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 15:04:27,406 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-02-04 15:04:27,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:27,406 INFO L225 Difference]: With dead ends: 172 [2018-02-04 15:04:27,406 INFO L226 Difference]: Without dead ends: 172 [2018-02-04 15:04:27,407 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2018-02-04 15:04:27,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-04 15:04:27,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2018-02-04 15:04:27,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-04 15:04:27,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 185 transitions. [2018-02-04 15:04:27,410 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 185 transitions. Word has length 43 [2018-02-04 15:04:27,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:27,411 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 185 transitions. [2018-02-04 15:04:27,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 15:04:27,411 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 185 transitions. [2018-02-04 15:04:27,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 15:04:27,412 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:27,412 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:27,412 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:27,412 INFO L82 PathProgramCache]: Analyzing trace with hash 19279971, now seen corresponding path program 1 times [2018-02-04 15:04:27,413 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:27,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:27,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:27,459 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:27,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 15:04:27,459 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:27,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:27,459 INFO L182 omatonBuilderFactory]: Interpolants [4160#(= 1 (select |#valid| cstrncmp_~s2.base)), 4161#(= 1 (select |#valid| |cstrncmp_#t~post3.base|)), 4153#true, 4154#false, 4155#(= cstrlen_~s~0.base |cstrlen_#in~str.base|), 4156#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (= 1 (select |#valid| cstrlen_~s~0.base))), 4157#(= 1 (select |#valid| |cstrlen_#in~str.base|)), 4158#(= 1 (select |#valid| cstrstr_~find.base)), 4159#(= 1 (select |#valid| |cstrncmp_#in~s2.base|))] [2018-02-04 15:04:27,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:27,460 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 15:04:27,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 15:04:27,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 15:04:27,460 INFO L87 Difference]: Start difference. First operand 155 states and 185 transitions. Second operand 9 states. [2018-02-04 15:04:27,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:27,518 INFO L93 Difference]: Finished difference Result 154 states and 182 transitions. [2018-02-04 15:04:27,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 15:04:27,518 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-02-04 15:04:27,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:27,519 INFO L225 Difference]: With dead ends: 154 [2018-02-04 15:04:27,519 INFO L226 Difference]: Without dead ends: 154 [2018-02-04 15:04:27,519 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-04 15:04:27,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-04 15:04:27,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-02-04 15:04:27,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-04 15:04:27,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 182 transitions. [2018-02-04 15:04:27,522 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 182 transitions. Word has length 45 [2018-02-04 15:04:27,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:27,522 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 182 transitions. [2018-02-04 15:04:27,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 15:04:27,522 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 182 transitions. [2018-02-04 15:04:27,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 15:04:27,523 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:27,523 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:27,523 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:27,523 INFO L82 PathProgramCache]: Analyzing trace with hash 19279972, now seen corresponding path program 1 times [2018-02-04 15:04:27,523 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:27,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:27,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:27,654 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:27,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 15:04:27,654 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:27,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:27,655 INFO L182 omatonBuilderFactory]: Interpolants [4480#(and (<= (+ |cstrstr_#t~post11.offset| 1) cstrstr_~find.offset) (= |cstrstr_#t~post11.offset| 0)), 4481#(<= 1 cstrstr_~find.offset), 4482#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 4483#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset) (<= (+ cstrlen_~s~0.offset 1) (select |#length| cstrlen_~s~0.base))), 4484#(<= (+ |cstrlen_#in~str.offset| 1) (select |#length| |cstrlen_#in~str.base|)), 4485#(and (<= (+ cstrstr_~find.offset 1) (select |#length| cstrstr_~find.base)) (<= 1 cstrstr_~find.offset)), 4486#(and (<= 1 |cstrncmp_#in~s2.offset|) (<= (+ |cstrncmp_#in~s2.offset| 1) (select |#length| |cstrncmp_#in~s2.base|))), 4487#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 4488#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 1 |cstrncmp_#t~post3.offset|)), 4474#true, 4475#false, 4476#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|))), 4477#(and (= 0 main_~nondetString2~0.offset) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 4478#(= 0 main_~nondetString2~0.offset), 4479#(= 0 |cstrstr_#in~find.offset|)] [2018-02-04 15:04:27,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:27,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 15:04:27,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 15:04:27,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-02-04 15:04:27,655 INFO L87 Difference]: Start difference. First operand 154 states and 182 transitions. Second operand 15 states. [2018-02-04 15:04:27,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:27,818 INFO L93 Difference]: Finished difference Result 165 states and 194 transitions. [2018-02-04 15:04:27,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 15:04:27,818 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-02-04 15:04:27,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:27,819 INFO L225 Difference]: With dead ends: 165 [2018-02-04 15:04:27,819 INFO L226 Difference]: Without dead ends: 165 [2018-02-04 15:04:27,819 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-02-04 15:04:27,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-04 15:04:27,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 158. [2018-02-04 15:04:27,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-04 15:04:27,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 186 transitions. [2018-02-04 15:04:27,823 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 186 transitions. Word has length 45 [2018-02-04 15:04:27,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:27,824 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 186 transitions. [2018-02-04 15:04:27,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 15:04:27,824 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 186 transitions. [2018-02-04 15:04:27,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 15:04:27,824 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:27,824 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:27,825 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:27,825 INFO L82 PathProgramCache]: Analyzing trace with hash -156113105, now seen corresponding path program 3 times [2018-02-04 15:04:27,825 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:27,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:28,034 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 15:04:28,034 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:28,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 15:04:28,034 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:28,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:28,034 INFO L182 omatonBuilderFactory]: Interpolants [4832#(= 0 (select (select |#memory_int| cstrstr_~s.base) (+ (select |#length| cstrstr_~s.base) (- 1)))), 4833#(and (= 0 (select (select |#memory_int| |cstrstr_#t~post15.base|) (+ (select |#length| |cstrstr_#t~post15.base|) (- 1)))) (= |cstrstr_#t~post15.base| cstrstr_~s.base)), 4834#(or (and (or (<= (select |#length| |cstrstr_#t~post15.base|) |cstrstr_#t~post15.offset|) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base))) (<= (+ |cstrstr_#t~post15.offset| 1) cstrstr_~s.offset)) (= 0 (select (select |#memory_int| |cstrstr_#t~post15.base|) |cstrstr_#t~post15.offset|))), 4835#(or (= 0 |cstrstr_#t~mem16|) (and (<= 1 cstrstr_~s.offset) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base)))), 4836#(or (= cstrstr_~sc~0 0) (and (<= 1 cstrstr_~s.offset) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base)))), 4837#(and (<= 1 cstrstr_~s.offset) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base))), 4838#(and (<= (+ |cstrstr_#t~post15.offset| 1) (select |#length| |cstrstr_#t~post15.base|)) (<= 1 |cstrstr_#t~post15.offset|)), 4824#true, 4825#false, 4826#(and (= 0 |main_#t~malloc20.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc20.base|)) (= (select |#valid| |main_#t~malloc20.base|) 1)), 4827#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 4828#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base |main_#t~malloc21.base|)) (= main_~nondetString1~0.offset 0)), 4829#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 4830#(and (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) (+ (select |#length| main_~nondetString1~0.base) (+ main_~nondetString1~0.offset (- 1))))) (= main_~nondetString1~0.offset 0)), 4831#(= 0 (select (select |#memory_int| |cstrstr_#in~s.base|) (+ (select |#length| |cstrstr_#in~s.base|) (- 1))))] [2018-02-04 15:04:28,035 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 15:04:28,035 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 15:04:28,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 15:04:28,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-02-04 15:04:28,035 INFO L87 Difference]: Start difference. First operand 158 states and 186 transitions. Second operand 15 states. [2018-02-04 15:04:28,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:28,395 INFO L93 Difference]: Finished difference Result 157 states and 184 transitions. [2018-02-04 15:04:28,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 15:04:28,396 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-02-04 15:04:28,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:28,396 INFO L225 Difference]: With dead ends: 157 [2018-02-04 15:04:28,396 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 15:04:28,397 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2018-02-04 15:04:28,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 15:04:28,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 101. [2018-02-04 15:04:28,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 15:04:28,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2018-02-04 15:04:28,398 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 46 [2018-02-04 15:04:28,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:28,398 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2018-02-04 15:04:28,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 15:04:28,399 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2018-02-04 15:04:28,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 15:04:28,399 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:28,399 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:28,399 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:28,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1348184644, now seen corresponding path program 1 times [2018-02-04 15:04:28,400 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:28,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:28,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 15:04:28,450 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:04:28,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 15:04:28,450 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:28,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:28,451 INFO L182 omatonBuilderFactory]: Interpolants [5121#true, 5122#false, 5123#(= 1 (select |#valid| main_~nondetString1~0.base)), 5124#(= 1 (select |#valid| |cstrstr_#in~s.base|)), 5125#(= 1 (select |#valid| cstrstr_~s.base)), 5126#(= 1 (select |#valid| |cstrncmp_#in~s1.base|)), 5127#(= 1 (select |#valid| cstrncmp_~s1.base)), 5128#(= 1 (select |#valid| |cstrncmp_#t~post9.base|))] [2018-02-04 15:04:28,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 15:04:28,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 15:04:28,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 15:04:28,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 15:04:28,451 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand 8 states. [2018-02-04 15:04:28,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:28,561 INFO L93 Difference]: Finished difference Result 100 states and 119 transitions. [2018-02-04 15:04:28,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 15:04:28,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-02-04 15:04:28,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:28,561 INFO L225 Difference]: With dead ends: 100 [2018-02-04 15:04:28,561 INFO L226 Difference]: Without dead ends: 100 [2018-02-04 15:04:28,561 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-04 15:04:28,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-04 15:04:28,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-02-04 15:04:28,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-04 15:04:28,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2018-02-04 15:04:28,564 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 47 [2018-02-04 15:04:28,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:28,564 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2018-02-04 15:04:28,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 15:04:28,564 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2018-02-04 15:04:28,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 15:04:28,564 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:28,565 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:28,565 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:28,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1348184645, now seen corresponding path program 1 times [2018-02-04 15:04:28,565 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:28,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:28,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 15:04:28,625 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:04:28,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 15:04:28,625 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:28,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:28,626 INFO L182 omatonBuilderFactory]: Interpolants [5335#true, 5336#false, 5337#(= |cstrstr_#t~post15.base| cstrstr_~s.base), 5338#(and (<= 0 cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 1) (select |#length| cstrncmp_~s1.base))), 5339#(and (<= (+ |cstrncmp_#t~post9.offset| 1) (select |#length| |cstrncmp_#t~post9.base|)) (<= 0 |cstrncmp_#t~post9.offset|))] [2018-02-04 15:04:28,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 15:04:28,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 15:04:28,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 15:04:28,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:04:28,630 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand 5 states. [2018-02-04 15:04:28,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:28,674 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2018-02-04 15:04:28,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 15:04:28,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-02-04 15:04:28,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:28,675 INFO L225 Difference]: With dead ends: 102 [2018-02-04 15:04:28,675 INFO L226 Difference]: Without dead ends: 102 [2018-02-04 15:04:28,676 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:04:28,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-04 15:04:28,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2018-02-04 15:04:28,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 15:04:28,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2018-02-04 15:04:28,678 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 47 [2018-02-04 15:04:28,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:28,678 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2018-02-04 15:04:28,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 15:04:28,678 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2018-02-04 15:04:28,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 15:04:28,679 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:28,679 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:28,679 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:28,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1381663923, now seen corresponding path program 1 times [2018-02-04 15:04:28,680 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:28,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:29,140 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 15:04:29,141 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:29,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 15:04:29,141 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:29,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:29,141 INFO L182 omatonBuilderFactory]: Interpolants [5538#true, 5539#false, 5540#(and (= 0 |main_#t~malloc20.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc20.base|)) (= (select |#valid| |main_#t~malloc20.base|) 1)), 5541#(and (= 0 main_~nondetString1~0.offset) (= (select |#valid| main_~nondetString1~0.base) 1) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2))), 5542#(and (= 0 main_~nondetString1~0.offset) (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 2)) (not (= main_~nondetString1~0.base |main_#t~malloc21.base|))) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2))), 5543#(and (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 2)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (= 0 main_~nondetString1~0.offset) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2))), 5544#(and (or (and (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) 1)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (<= 3 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (<= (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base)) 1)) (= 0 main_~nondetString1~0.offset)), 5545#(and (= 0 |cstrstr_#in~s.offset|) (or (= 0 (select (select |#memory_int| |cstrstr_#in~s.base|) 1)) (<= 3 (select |#length| |cstrstr_#in~s.base|)) (<= (select |#length| |cstrstr_#in~s.base|) 1))), 5546#(and (or (= 0 (select (select |#memory_int| cstrstr_~s.base) 1)) (<= 3 (select |#length| cstrstr_~s.base)) (<= (select |#length| cstrstr_~s.base) 1)) (= 0 cstrstr_~s.offset)), 5547#(and (or (and (or (<= (+ |cstrstr_#t~post15.offset| (select |#length| |cstrstr_#t~post15.base|)) cstrstr_~s.offset) (<= (+ cstrstr_~s.offset 2) (+ |cstrstr_#t~post15.offset| (select |#length| |cstrstr_#t~post15.base|)))) (<= (+ |cstrstr_#t~post15.offset| 1) cstrstr_~s.offset) (= |cstrstr_#t~post15.base| cstrstr_~s.base)) (and (<= (+ |cstrstr_#t~post15.offset| 1) cstrstr_~s.offset) (= 0 (select (select |#memory_int| |cstrstr_#t~post15.base|) 1)) (= |cstrstr_#t~post15.base| cstrstr_~s.base) (<= cstrstr_~s.offset (+ |cstrstr_#t~post15.offset| 1)))) (= |cstrstr_#t~post15.offset| 0)), 5548#(or (and (<= 1 cstrstr_~s.offset) (or (<= (+ cstrstr_~s.offset 2) (select |#length| cstrstr_~s.base)) (<= (select |#length| cstrstr_~s.base) cstrstr_~s.offset))) (and (= 0 (select (select |#memory_int| cstrstr_~s.base) 1)) (<= cstrstr_~s.offset 1) (<= 1 cstrstr_~s.offset))), 5549#(or (and (= 1 |cstrstr_#t~post15.offset|) (= 0 (select (select |#memory_int| |cstrstr_#t~post15.base|) |cstrstr_#t~post15.offset|))) (and (or (<= (select |#length| |cstrstr_#t~post15.base|) |cstrstr_#t~post15.offset|) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base))) (<= 2 cstrstr_~s.offset))), 5550#(or (and (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base)) (<= 2 cstrstr_~s.offset)) (= 0 |cstrstr_#t~mem16|)), 5551#(or (= cstrstr_~sc~0 0) (and (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base)) (<= 2 cstrstr_~s.offset))), 5552#(and (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base)) (<= 2 cstrstr_~s.offset)), 5553#(and (<= (+ |cstrncmp_#in~s1.offset| 1) (select |#length| |cstrncmp_#in~s1.base|)) (<= 2 |cstrncmp_#in~s1.offset|)), 5554#(and (<= 2 cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 1) (select |#length| cstrncmp_~s1.base)))] [2018-02-04 15:04:29,141 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 15:04:29,142 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 15:04:29,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 15:04:29,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-02-04 15:04:29,142 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand 17 states. [2018-02-04 15:04:29,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:29,672 INFO L93 Difference]: Finished difference Result 144 states and 166 transitions. [2018-02-04 15:04:29,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 15:04:29,672 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 48 [2018-02-04 15:04:29,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:29,673 INFO L225 Difference]: With dead ends: 144 [2018-02-04 15:04:29,673 INFO L226 Difference]: Without dead ends: 144 [2018-02-04 15:04:29,673 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2018-02-04 15:04:29,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-04 15:04:29,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 127. [2018-02-04 15:04:29,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-04 15:04:29,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 152 transitions. [2018-02-04 15:04:29,675 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 152 transitions. Word has length 48 [2018-02-04 15:04:29,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:29,675 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 152 transitions. [2018-02-04 15:04:29,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 15:04:29,676 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 152 transitions. [2018-02-04 15:04:29,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 15:04:29,676 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:29,676 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:29,676 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:29,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1474955739, now seen corresponding path program 1 times [2018-02-04 15:04:29,676 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:29,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:29,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 15:04:29,714 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:29,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 15:04:29,714 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:29,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:29,714 INFO L182 omatonBuilderFactory]: Interpolants [5856#(= 1 (select |#valid| cstrncmp_~s2.base)), 5857#(= 1 (select |#valid| |cstrncmp_#t~pre6.base|)), 5850#true, 5851#false, 5852#(= cstrlen_~s~0.base |cstrlen_#in~str.base|), 5853#(= 1 (select |#valid| |cstrlen_#in~str.base|)), 5854#(= 1 (select |#valid| cstrstr_~find.base)), 5855#(= 1 (select |#valid| |cstrncmp_#in~s2.base|))] [2018-02-04 15:04:29,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 15:04:29,714 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 15:04:29,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 15:04:29,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 15:04:29,715 INFO L87 Difference]: Start difference. First operand 127 states and 152 transitions. Second operand 8 states. [2018-02-04 15:04:29,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:29,801 INFO L93 Difference]: Finished difference Result 126 states and 149 transitions. [2018-02-04 15:04:29,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 15:04:29,801 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-02-04 15:04:29,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:29,803 INFO L225 Difference]: With dead ends: 126 [2018-02-04 15:04:29,803 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 15:04:29,803 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-04 15:04:29,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 15:04:29,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-02-04 15:04:29,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-04 15:04:29,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 149 transitions. [2018-02-04 15:04:29,806 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 149 transitions. Word has length 49 [2018-02-04 15:04:29,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:29,807 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 149 transitions. [2018-02-04 15:04:29,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 15:04:29,807 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 149 transitions. [2018-02-04 15:04:29,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 15:04:29,807 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:29,807 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:29,808 INFO L371 AbstractCegarLoop]: === Iteration 28 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:29,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1474955738, now seen corresponding path program 1 times [2018-02-04 15:04:29,808 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:29,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:29,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:29,972 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:29,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 15:04:29,972 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:29,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:29,972 INFO L182 omatonBuilderFactory]: Interpolants [6116#true, 6117#false, 6118#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|))), 6119#(and (= 0 main_~nondetString2~0.offset) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 6120#(= 0 main_~nondetString2~0.offset), 6121#(= 0 |cstrstr_#in~find.offset|), 6122#(and (<= (+ |cstrstr_#t~post11.offset| 1) cstrstr_~find.offset) (= |cstrstr_#t~post11.offset| 0)), 6123#(<= 1 cstrstr_~find.offset), 6124#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 6125#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset) (<= (+ cstrlen_~s~0.offset 1) (select |#length| cstrlen_~s~0.base))), 6126#(<= (+ |cstrlen_#in~str.offset| 1) (select |#length| |cstrlen_#in~str.base|)), 6127#(and (<= (+ cstrstr_~find.offset 1) (select |#length| cstrstr_~find.base)) (<= 1 cstrstr_~find.offset)), 6128#(and (<= 1 |cstrncmp_#in~s2.offset|) (<= (+ |cstrncmp_#in~s2.offset| 1) (select |#length| |cstrncmp_#in~s2.base|))), 6129#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 6130#(and (<= 2 cstrncmp_~s2.offset) (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base))), 6131#(and (<= 1 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|)))] [2018-02-04 15:04:29,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:29,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 15:04:29,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 15:04:29,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-02-04 15:04:29,973 INFO L87 Difference]: Start difference. First operand 126 states and 149 transitions. Second operand 16 states. [2018-02-04 15:04:30,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:30,219 INFO L93 Difference]: Finished difference Result 180 states and 213 transitions. [2018-02-04 15:04:30,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 15:04:30,219 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-02-04 15:04:30,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:30,220 INFO L225 Difference]: With dead ends: 180 [2018-02-04 15:04:30,220 INFO L226 Difference]: Without dead ends: 180 [2018-02-04 15:04:30,221 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-02-04 15:04:30,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-04 15:04:30,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 138. [2018-02-04 15:04:30,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-04 15:04:30,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 164 transitions. [2018-02-04 15:04:30,225 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 164 transitions. Word has length 49 [2018-02-04 15:04:30,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:30,225 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 164 transitions. [2018-02-04 15:04:30,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 15:04:30,225 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 164 transitions. [2018-02-04 15:04:30,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 15:04:30,226 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:30,226 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:30,226 INFO L371 AbstractCegarLoop]: === Iteration 29 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:30,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1071735008, now seen corresponding path program 1 times [2018-02-04 15:04:30,227 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:30,236 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:30,353 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:30,353 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:30,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 15:04:30,354 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:30,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:30,354 INFO L182 omatonBuilderFactory]: Interpolants [6464#true, 6465#false, 6466#(= cstrlen_~s~0.offset cstrlen_~str.offset), 6467#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 6468#(and (<= 1 |cstrlen_#res|) (<= |cstrlen_#res| 1)), 6469#(and (<= 1 |cstrstr_#t~ret13|) (<= |cstrstr_#t~ret13| 1)), 6470#(and (<= 1 cstrstr_~len~0) (<= cstrstr_~len~0 1)), 6471#(and (<= |cstrncmp_#in~n| 1) (<= 1 |cstrncmp_#in~n|)), 6472#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 6473#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|))] [2018-02-04 15:04:30,354 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:30,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 15:04:30,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 15:04:30,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 15:04:30,355 INFO L87 Difference]: Start difference. First operand 138 states and 164 transitions. Second operand 10 states. [2018-02-04 15:04:30,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:30,435 INFO L93 Difference]: Finished difference Result 236 states and 272 transitions. [2018-02-04 15:04:30,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 15:04:30,436 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-02-04 15:04:30,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:30,437 INFO L225 Difference]: With dead ends: 236 [2018-02-04 15:04:30,437 INFO L226 Difference]: Without dead ends: 236 [2018-02-04 15:04:30,437 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 15:04:30,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-02-04 15:04:30,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 225. [2018-02-04 15:04:30,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-04 15:04:30,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 262 transitions. [2018-02-04 15:04:30,442 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 262 transitions. Word has length 52 [2018-02-04 15:04:30,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:30,442 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 262 transitions. [2018-02-04 15:04:30,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 15:04:30,442 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 262 transitions. [2018-02-04 15:04:30,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 15:04:30,443 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:30,443 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:30,443 INFO L371 AbstractCegarLoop]: === Iteration 30 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:30,443 INFO L82 PathProgramCache]: Analyzing trace with hash 515999267, now seen corresponding path program 2 times [2018-02-04 15:04:30,443 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:30,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:30,674 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 15:04:30,674 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:30,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 15:04:30,675 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:30,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:30,675 INFO L182 omatonBuilderFactory]: Interpolants [6944#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 6945#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base |main_#t~malloc21.base|)) (= main_~nondetString1~0.offset 0)), 6946#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 6947#(and (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) (+ (select |#length| main_~nondetString1~0.base) (+ main_~nondetString1~0.offset (- 1))))) (= main_~nondetString1~0.offset 0)), 6948#(= 0 (select (select |#memory_int| |cstrstr_#in~s.base|) (+ (select |#length| |cstrstr_#in~s.base|) (- 1)))), 6949#(= 0 (select (select |#memory_int| cstrstr_~s.base) (+ (select |#length| cstrstr_~s.base) (- 1)))), 6950#(and (= 0 (select (select |#memory_int| |cstrstr_#t~post15.base|) (+ (select |#length| |cstrstr_#t~post15.base|) (- 1)))) (= |cstrstr_#t~post15.base| cstrstr_~s.base)), 6951#(and (<= (+ |cstrstr_#t~post15.offset| 1) cstrstr_~s.offset) (or (<= (select |#length| |cstrstr_#t~post15.base|) |cstrstr_#t~post15.offset|) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base)) (= 0 (select (select |#memory_int| |cstrstr_#t~post15.base|) |cstrstr_#t~post15.offset|)))), 6952#(and (<= 1 cstrstr_~s.offset) (or (= 0 |cstrstr_#t~mem16|) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base)))), 6953#(and (or (= cstrstr_~sc~0 0) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base))) (<= 1 cstrstr_~s.offset)), 6954#(and (<= 1 cstrstr_~s.offset) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base))), 6955#(and (<= (+ |cstrncmp_#in~s1.offset| 1) (select |#length| |cstrncmp_#in~s1.base|)) (<= 1 |cstrncmp_#in~s1.offset|)), 6956#(and (<= 1 cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 1) (select |#length| cstrncmp_~s1.base))), 6941#true, 6942#false, 6943#(and (= 0 |main_#t~malloc20.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc20.base|)) (= (select |#valid| |main_#t~malloc20.base|) 1))] [2018-02-04 15:04:30,675 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 15:04:30,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 15:04:30,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 15:04:30,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-02-04 15:04:30,676 INFO L87 Difference]: Start difference. First operand 225 states and 262 transitions. Second operand 16 states. [2018-02-04 15:04:30,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:30,946 INFO L93 Difference]: Finished difference Result 240 states and 275 transitions. [2018-02-04 15:04:30,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 15:04:30,947 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2018-02-04 15:04:30,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:30,947 INFO L225 Difference]: With dead ends: 240 [2018-02-04 15:04:30,947 INFO L226 Difference]: Without dead ends: 151 [2018-02-04 15:04:30,948 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2018-02-04 15:04:30,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-04 15:04:30,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 74. [2018-02-04 15:04:30,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 15:04:30,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-02-04 15:04:30,949 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 53 [2018-02-04 15:04:30,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:30,949 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-02-04 15:04:30,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 15:04:30,949 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-02-04 15:04:30,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 15:04:30,950 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:30,950 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:30,950 INFO L371 AbstractCegarLoop]: === Iteration 31 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:30,950 INFO L82 PathProgramCache]: Analyzing trace with hash 931438653, now seen corresponding path program 2 times [2018-02-04 15:04:30,950 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:30,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:31,503 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 15:04:31,503 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:31,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 15:04:31,503 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:31,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:31,503 INFO L182 omatonBuilderFactory]: Interpolants [7296#(and (= 0 main_~nondetString2~0.offset) (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (or (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (not (= 2 (+ main_~nondetString1~0.offset main_~length1~0)))) (= main_~nondetString1~0.offset 0)), 7297#(and (or (and (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) 1)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (<= 3 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (<= (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base)) 1)) (= 0 main_~nondetString2~0.offset) (= main_~nondetString1~0.offset 0)), 7298#(and (= 0 |cstrstr_#in~s.offset|) (or (= 0 (select (select |#memory_int| |cstrstr_#in~s.base|) 1)) (<= 3 (select |#length| |cstrstr_#in~s.base|)) (<= (select |#length| |cstrstr_#in~s.base|) 1)) (= 0 |cstrstr_#in~find.offset|)), 7299#(and (<= cstrstr_~find.offset (+ |cstrstr_#t~post11.offset| 1)) (or (= 0 (select (select |#memory_int| cstrstr_~s.base) 1)) (<= 3 (select |#length| cstrstr_~s.base)) (<= (select |#length| cstrstr_~s.base) 1)) (<= (+ |cstrstr_#t~post11.offset| 1) cstrstr_~find.offset) (= |cstrstr_#t~post11.offset| 0) (= 0 cstrstr_~s.offset)), 7300#(and (<= cstrstr_~find.offset 1) (or (= 0 (select (select |#memory_int| cstrstr_~s.base) 1)) (<= 3 (select |#length| cstrstr_~s.base)) (<= (select |#length| cstrstr_~s.base) 1)) (<= 1 cstrstr_~find.offset) (= 0 cstrstr_~s.offset)), 7301#(or (not (= 1 |cstrlen_#in~str.offset|)) (and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (= cstrlen_~s~0.offset 1))), 7302#(or (not (= 1 |cstrlen_#in~str.offset|)) (and (= |cstrlen_#t~mem1| (select (select |#memory_int| cstrlen_~s~0.base) 1)) (= cstrlen_~s~0.base |cstrlen_#in~str.base|))), 7303#(or (not (= 1 |cstrlen_#in~str.offset|)) (and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (not (= (select (select |#memory_int| cstrlen_~s~0.base) 1) 0)))), 7304#(or (not (= (select (select |#memory_int| |cstrlen_#in~str.base|) 1) 0)) (not (= 1 |cstrlen_#in~str.offset|))), 7305#(and (<= cstrstr_~find.offset 1) (or (<= 3 (select |#length| cstrstr_~s.base)) (<= (select |#length| cstrstr_~s.base) 1) (not (= (select (select |#memory_int| cstrstr_~find.base) 1) (select (select |#memory_int| cstrstr_~s.base) 1)))) (<= 1 cstrstr_~find.offset) (= 0 cstrstr_~s.offset)), 7306#(and (<= cstrstr_~find.offset 1) (<= (+ |cstrstr_#t~post15.offset| 1) cstrstr_~s.offset) (= |cstrstr_#t~post15.offset| 0) (<= 1 cstrstr_~find.offset) (or (and (not (= (select (select |#memory_int| cstrstr_~find.base) 1) (select (select |#memory_int| |cstrstr_#t~post15.base|) 1))) (= |cstrstr_#t~post15.base| cstrstr_~s.base)) (and (<= (+ |cstrstr_#t~post15.offset| (select |#length| |cstrstr_#t~post15.base|)) cstrstr_~s.offset) (= |cstrstr_#t~post15.base| cstrstr_~s.base)) (and (<= (+ cstrstr_~s.offset 2) (+ |cstrstr_#t~post15.offset| (select |#length| |cstrstr_#t~post15.base|))) (= |cstrstr_#t~post15.base| cstrstr_~s.base))) (<= cstrstr_~s.offset (+ |cstrstr_#t~post15.offset| 1))), 7307#(and (<= cstrstr_~find.offset 1) (<= cstrstr_~s.offset 1) (<= 1 cstrstr_~s.offset) (or (<= (+ cstrstr_~s.offset 2) (select |#length| cstrstr_~s.base)) (not (= (select (select |#memory_int| cstrstr_~find.base) 1) (select (select |#memory_int| cstrstr_~s.base) 1))) (<= (select |#length| cstrstr_~s.base) cstrstr_~s.offset)) (<= 1 cstrstr_~find.offset)), 7308#(and (<= 1 |cstrncmp_#in~s2.offset|) (<= 1 |cstrncmp_#in~s1.offset|) (<= |cstrncmp_#in~s2.offset| 1) (<= |cstrncmp_#in~s1.offset| 1) (or (<= (select |#length| |cstrncmp_#in~s1.base|) |cstrncmp_#in~s1.offset|) (<= (+ |cstrncmp_#in~s1.offset| 2) (select |#length| |cstrncmp_#in~s1.base|)) (not (= (select (select |#memory_int| |cstrncmp_#in~s2.base|) 1) (select (select |#memory_int| |cstrncmp_#in~s1.base|) 1))))), 7309#(and (= cstrncmp_~s1.offset 1) (<= cstrncmp_~s2.offset 1) (or (<= (+ cstrncmp_~s1.offset 2) (select |#length| cstrncmp_~s1.base)) (not (= (select (select |#memory_int| cstrncmp_~s2.base) 1) (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset))) (<= (select |#length| cstrncmp_~s1.base) cstrncmp_~s1.offset)) (<= 1 cstrncmp_~s2.offset)), 7310#(and (= cstrncmp_~s1.offset 1) (or (<= (+ cstrncmp_~s1.offset 2) (select |#length| cstrncmp_~s1.base)) (not (= (select (select |#memory_int| cstrncmp_~s2.base) 1) |cstrncmp_#t~mem4|))) (<= cstrncmp_~s2.offset 1) (<= 1 cstrncmp_~s2.offset)), 7311#(and (= cstrncmp_~s1.offset 1) (or (<= (+ cstrncmp_~s1.offset 2) (select |#length| cstrncmp_~s1.base)) (not (= (select (select |#memory_int| |cstrncmp_#t~post3.base|) |cstrncmp_#t~post3.offset|) |cstrncmp_#t~mem4|))) (= 1 |cstrncmp_#t~post3.offset|)), 7312#(and (= cstrncmp_~s1.offset 1) (or (not (= |cstrncmp_#t~mem5| |cstrncmp_#t~mem4|)) (<= (+ cstrncmp_~s1.offset 2) (select |#length| cstrncmp_~s1.base)))), 7313#(and (<= (+ |cstrncmp_#t~post9.offset| 1) cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 1) (select |#length| cstrncmp_~s1.base))), 7314#(and (<= 1 cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 1) (select |#length| cstrncmp_~s1.base))), 7291#true, 7292#false, 7293#(and (= 0 |main_#t~malloc20.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc20.base|)) (= (select |#valid| |main_#t~malloc20.base|) 1)), 7294#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 7295#(and (= 0 |main_#t~malloc21.offset|) (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (or (not (= main_~nondetString1~0.base |main_#t~malloc21.base|)) (not (= 2 (+ main_~nondetString1~0.offset main_~length1~0)))) (= main_~nondetString1~0.offset 0))] [2018-02-04 15:04:31,504 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 15:04:31,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 15:04:31,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 15:04:31,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=504, Unknown=0, NotChecked=0, Total=552 [2018-02-04 15:04:31,504 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 24 states. [2018-02-04 15:04:32,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:32,431 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2018-02-04 15:04:32,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 15:04:32,432 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 56 [2018-02-04 15:04:32,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:32,432 INFO L225 Difference]: With dead ends: 134 [2018-02-04 15:04:32,432 INFO L226 Difference]: Without dead ends: 134 [2018-02-04 15:04:32,432 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=147, Invalid=1493, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 15:04:32,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-04 15:04:32,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 113. [2018-02-04 15:04:32,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 15:04:32,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2018-02-04 15:04:32,434 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 56 [2018-02-04 15:04:32,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:32,434 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2018-02-04 15:04:32,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 15:04:32,435 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2018-02-04 15:04:32,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 15:04:32,435 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:32,435 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:32,435 INFO L371 AbstractCegarLoop]: === Iteration 32 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:32,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1759348222, now seen corresponding path program 1 times [2018-02-04 15:04:32,436 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:32,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:32,545 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:32,545 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:32,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 15:04:32,545 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:32,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:32,545 INFO L182 omatonBuilderFactory]: Interpolants [7596#true, 7597#false, 7598#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 7599#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 7600#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 7601#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 7602#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 7603#(<= (+ |cstrlen_#in~str.offset| 3) (select |#length| |cstrlen_#in~str.base|)), 7604#(<= (+ cstrstr_~find.offset 3) (select |#length| cstrstr_~find.base)), 7605#(<= (+ |cstrncmp_#in~s2.offset| 3) (select |#length| |cstrncmp_#in~s2.base|)), 7606#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 7607#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 7608#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 7609#(and (<= (+ |cstrncmp_#t~post3.offset| 2) (select |#length| |cstrncmp_#t~post3.base|)) (<= 1 |cstrncmp_#t~post3.offset|))] [2018-02-04 15:04:32,545 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:32,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 15:04:32,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 15:04:32,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-04 15:04:32,546 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand 14 states. [2018-02-04 15:04:32,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:32,718 INFO L93 Difference]: Finished difference Result 141 states and 163 transitions. [2018-02-04 15:04:32,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 15:04:32,718 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2018-02-04 15:04:32,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:32,719 INFO L225 Difference]: With dead ends: 141 [2018-02-04 15:04:32,719 INFO L226 Difference]: Without dead ends: 141 [2018-02-04 15:04:32,719 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2018-02-04 15:04:32,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-04 15:04:32,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 123. [2018-02-04 15:04:32,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 15:04:32,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2018-02-04 15:04:32,722 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 58 [2018-02-04 15:04:32,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:32,723 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2018-02-04 15:04:32,723 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 15:04:32,723 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2018-02-04 15:04:32,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 15:04:32,723 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:32,723 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:32,723 INFO L371 AbstractCegarLoop]: === Iteration 33 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:32,724 INFO L82 PathProgramCache]: Analyzing trace with hash 189332755, now seen corresponding path program 1 times [2018-02-04 15:04:32,724 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:32,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:33,006 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 15:04:33,006 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:33,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 15:04:33,006 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:33,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:33,007 INFO L182 omatonBuilderFactory]: Interpolants [7904#(and (<= 1 cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 1) (select |#length| cstrncmp_~s1.base))), 7889#true, 7890#false, 7891#(and (= 0 |main_#t~malloc20.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc20.base|)) (= (select |#valid| |main_#t~malloc20.base|) 1)), 7892#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 7893#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base |main_#t~malloc21.base|)) (= main_~nondetString1~0.offset 0)), 7894#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 7895#(and (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) (+ (select |#length| main_~nondetString1~0.base) (+ main_~nondetString1~0.offset (- 1))))) (= main_~nondetString1~0.offset 0)), 7896#(= 0 (select (select |#memory_int| |cstrstr_#in~s.base|) (+ (select |#length| |cstrstr_#in~s.base|) (- 1)))), 7897#(= 0 (select (select |#memory_int| cstrstr_~s.base) (+ (select |#length| cstrstr_~s.base) (- 1)))), 7898#(and (= 0 (select (select |#memory_int| |cstrstr_#t~post15.base|) (+ (select |#length| |cstrstr_#t~post15.base|) (- 1)))) (= |cstrstr_#t~post15.base| cstrstr_~s.base)), 7899#(= 0 (select (select |#memory_int| |cstrncmp_#in~s1.base|) (+ (select |#length| |cstrncmp_#in~s1.base|) (- 1)))), 7900#(= 0 (select (select |#memory_int| cstrncmp_~s1.base) (+ (select |#length| cstrncmp_~s1.base) (- 1)))), 7901#(and (or (<= (+ cstrncmp_~s1.offset 2) (select |#length| cstrncmp_~s1.base)) (= 0 (select (select |#memory_int| cstrncmp_~s1.base) (+ (+ cstrncmp_~s1.offset 1) (- 1))))) (<= (+ cstrncmp_~s1.offset 1) (select |#length| cstrncmp_~s1.base))), 7902#(or (and (<= (+ |cstrncmp_#t~post9.offset| 1) cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 1) (select |#length| |cstrncmp_#t~post9.base|)) (= (select |#length| |cstrncmp_#t~post9.base|) (select |#length| cstrncmp_~s1.base))) (= 0 (select (select |#memory_int| |cstrncmp_#t~post9.base|) |cstrncmp_#t~post9.offset|))), 7903#(or (= |cstrncmp_#t~mem10| 0) (and (<= 1 cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 1) (select |#length| cstrncmp_~s1.base))))] [2018-02-04 15:04:33,007 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 15:04:33,007 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 15:04:33,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 15:04:33,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-02-04 15:04:33,035 INFO L87 Difference]: Start difference. First operand 123 states and 144 transitions. Second operand 16 states. [2018-02-04 15:04:33,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:33,343 INFO L93 Difference]: Finished difference Result 134 states and 153 transitions. [2018-02-04 15:04:33,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 15:04:33,343 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 61 [2018-02-04 15:04:33,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:33,343 INFO L225 Difference]: With dead ends: 134 [2018-02-04 15:04:33,343 INFO L226 Difference]: Without dead ends: 134 [2018-02-04 15:04:33,344 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2018-02-04 15:04:33,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-04 15:04:33,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 81. [2018-02-04 15:04:33,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 15:04:33,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2018-02-04 15:04:33,345 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 61 [2018-02-04 15:04:33,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:33,345 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2018-02-04 15:04:33,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 15:04:33,345 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2018-02-04 15:04:33,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 15:04:33,346 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:33,346 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:33,346 INFO L371 AbstractCegarLoop]: === Iteration 34 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:33,346 INFO L82 PathProgramCache]: Analyzing trace with hash 311750336, now seen corresponding path program 1 times [2018-02-04 15:04:33,346 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:33,352 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:33,538 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:33,538 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:33,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 15:04:33,538 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:33,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:33,538 INFO L182 omatonBuilderFactory]: Interpolants [8142#true, 8143#false, 8144#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|))), 8145#(and (= 0 main_~nondetString2~0.offset) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 8146#(= 0 main_~nondetString2~0.offset), 8147#(= 0 |cstrstr_#in~find.offset|), 8148#(and (<= (+ |cstrstr_#t~post11.offset| 1) cstrstr_~find.offset) (= |cstrstr_#t~post11.offset| 0)), 8149#(<= 1 cstrstr_~find.offset), 8150#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 8151#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 8152#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 8153#(<= (+ |cstrlen_#in~str.offset| 3) (select |#length| |cstrlen_#in~str.base|)), 8154#(and (<= (+ cstrstr_~find.offset 3) (select |#length| cstrstr_~find.base)) (<= 1 cstrstr_~find.offset)), 8155#(and (<= 1 |cstrncmp_#in~s2.offset|) (<= (+ |cstrncmp_#in~s2.offset| 3) (select |#length| |cstrncmp_#in~s2.base|))), 8156#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 8157#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 2 cstrncmp_~s2.offset)), 8158#(and (<= 3 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 8159#(and (<= (+ |cstrncmp_#t~pre6.offset| 2) (select |#length| |cstrncmp_#t~pre6.base|)) (<= 2 |cstrncmp_#t~pre6.offset|))] [2018-02-04 15:04:33,539 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:33,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 15:04:33,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 15:04:33,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-02-04 15:04:33,539 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 18 states. [2018-02-04 15:04:33,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:33,838 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2018-02-04 15:04:33,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 15:04:33,838 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 62 [2018-02-04 15:04:33,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:33,838 INFO L225 Difference]: With dead ends: 105 [2018-02-04 15:04:33,838 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 15:04:33,839 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2018-02-04 15:04:33,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 15:04:33,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 82. [2018-02-04 15:04:33,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 15:04:33,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-02-04 15:04:33,841 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 62 [2018-02-04 15:04:33,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:33,841 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-02-04 15:04:33,841 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 15:04:33,841 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-02-04 15:04:33,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 15:04:33,842 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:33,842 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:33,842 INFO L371 AbstractCegarLoop]: === Iteration 35 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:33,842 INFO L82 PathProgramCache]: Analyzing trace with hash 2045968775, now seen corresponding path program 2 times [2018-02-04 15:04:33,842 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:33,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:34,045 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:34,045 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:34,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 15:04:34,045 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:34,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:34,046 INFO L182 omatonBuilderFactory]: Interpolants [8365#true, 8366#false, 8367#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|))), 8368#(and (= 0 main_~nondetString2~0.offset) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 8369#(= 0 main_~nondetString2~0.offset), 8370#(= 0 |cstrstr_#in~find.offset|), 8371#(and (<= (+ |cstrstr_#t~post11.offset| 1) cstrstr_~find.offset) (= |cstrstr_#t~post11.offset| 0)), 8372#(<= 1 cstrstr_~find.offset), 8373#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 8374#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 8375#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 8376#(<= (+ |cstrlen_#in~str.offset| 3) (select |#length| |cstrlen_#in~str.base|)), 8377#(and (<= (+ cstrstr_~find.offset 3) (select |#length| cstrstr_~find.base)) (<= 1 cstrstr_~find.offset)), 8378#(and (<= 1 |cstrncmp_#in~s2.offset|) (<= (+ |cstrncmp_#in~s2.offset| 3) (select |#length| |cstrncmp_#in~s2.base|))), 8379#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 8380#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 2 cstrncmp_~s2.offset)), 8381#(and (<= 3 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 8382#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 3 |cstrncmp_#t~post3.offset|))] [2018-02-04 15:04:34,046 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:34,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 15:04:34,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 15:04:34,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-02-04 15:04:34,047 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 18 states. [2018-02-04 15:04:34,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:34,297 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2018-02-04 15:04:34,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 15:04:34,297 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2018-02-04 15:04:34,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:34,298 INFO L225 Difference]: With dead ends: 107 [2018-02-04 15:04:34,298 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 15:04:34,298 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2018-02-04 15:04:34,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 15:04:34,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 90. [2018-02-04 15:04:34,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-04 15:04:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2018-02-04 15:04:34,300 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 67 [2018-02-04 15:04:34,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:34,300 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2018-02-04 15:04:34,300 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 15:04:34,300 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2018-02-04 15:04:34,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-04 15:04:34,300 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:34,300 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:34,300 INFO L371 AbstractCegarLoop]: === Iteration 36 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:34,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1577024969, now seen corresponding path program 2 times [2018-02-04 15:04:34,301 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:34,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:34,605 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:34,605 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:34,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 15:04:34,605 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:34,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:34,606 INFO L182 omatonBuilderFactory]: Interpolants [8608#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 8609#(<= (+ |cstrlen_#in~str.offset| 3) (select |#length| |cstrlen_#in~str.base|)), 8610#(and (<= (+ cstrstr_~find.offset 3) (select |#length| cstrstr_~find.base)) (<= 1 cstrstr_~find.offset)), 8611#(and (<= 1 |cstrncmp_#in~s2.offset|) (<= (+ |cstrncmp_#in~s2.offset| 3) (select |#length| |cstrncmp_#in~s2.base|))), 8612#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 8613#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 2 cstrncmp_~s2.offset)), 8614#(and (<= 3 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 8615#(and (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base)) (<= 4 cstrncmp_~s2.offset)), 8616#(and (<= 3 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|))), 8598#true, 8599#false, 8600#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|))), 8601#(and (= 0 main_~nondetString2~0.offset) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 8602#(= 0 main_~nondetString2~0.offset), 8603#(= 0 |cstrstr_#in~find.offset|), 8604#(and (<= (+ |cstrstr_#t~post11.offset| 1) cstrstr_~find.offset) (= |cstrstr_#t~post11.offset| 0)), 8605#(<= 1 cstrstr_~find.offset), 8606#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 8607#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset))] [2018-02-04 15:04:34,606 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:34,606 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 15:04:34,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 15:04:34,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-02-04 15:04:34,606 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand 19 states. [2018-02-04 15:04:34,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:34,937 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2018-02-04 15:04:34,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 15:04:34,937 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 71 [2018-02-04 15:04:34,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:34,938 INFO L225 Difference]: With dead ends: 121 [2018-02-04 15:04:34,938 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 15:04:34,938 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2018-02-04 15:04:34,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 15:04:34,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 91. [2018-02-04 15:04:34,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 15:04:34,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2018-02-04 15:04:34,940 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 71 [2018-02-04 15:04:34,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:34,940 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2018-02-04 15:04:34,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 15:04:34,940 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2018-02-04 15:04:34,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-04 15:04:34,940 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:34,940 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:34,940 INFO L371 AbstractCegarLoop]: === Iteration 37 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:34,940 INFO L82 PathProgramCache]: Analyzing trace with hash -718966754, now seen corresponding path program 3 times [2018-02-04 15:04:34,941 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:34,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:35,077 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 26 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:04:35,078 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:35,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 15:04:35,078 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:35,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:35,078 INFO L182 omatonBuilderFactory]: Interpolants [8849#true, 8850#false, 8851#(= cstrlen_~s~0.offset cstrlen_~str.offset), 8852#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 8853#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 8854#(and (<= |cstrlen_#res| 2) (<= 2 |cstrlen_#res|)), 8855#(and (<= 2 |cstrstr_#t~ret13|) (<= |cstrstr_#t~ret13| 2)), 8856#(and (<= 2 cstrstr_~len~0) (<= cstrstr_~len~0 2)), 8857#(and (<= 2 |cstrncmp_#in~n|) (<= |cstrncmp_#in~n| 2)), 8858#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 8859#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 8860#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|))] [2018-02-04 15:04:35,078 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 26 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:04:35,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 15:04:35,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 15:04:35,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-04 15:04:35,079 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 12 states. [2018-02-04 15:04:35,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:35,164 INFO L93 Difference]: Finished difference Result 146 states and 166 transitions. [2018-02-04 15:04:35,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 15:04:35,164 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 76 [2018-02-04 15:04:35,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:35,165 INFO L225 Difference]: With dead ends: 146 [2018-02-04 15:04:35,165 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 15:04:35,165 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-02-04 15:04:35,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 15:04:35,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-02-04 15:04:35,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 15:04:35,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2018-02-04 15:04:35,166 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 76 [2018-02-04 15:04:35,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:35,166 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2018-02-04 15:04:35,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 15:04:35,166 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2018-02-04 15:04:35,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-04 15:04:35,167 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:35,167 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:35,167 INFO L371 AbstractCegarLoop]: === Iteration 38 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:35,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1136154501, now seen corresponding path program 4 times [2018-02-04 15:04:35,167 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:35,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:35,332 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:35,333 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:35,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 15:04:35,333 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:35,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:35,333 INFO L182 omatonBuilderFactory]: Interpolants [9120#(<= (+ |cstrncmp_#in~s2.offset| 4) (select |#length| |cstrncmp_#in~s2.base|)), 9121#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 9122#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 9123#(<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)), 9124#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 9125#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 9126#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 1 |cstrncmp_#t~post3.offset|)), 9110#true, 9111#false, 9112#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 9113#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 9114#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 9115#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 9116#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 9117#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 9118#(<= (+ |cstrlen_#in~str.offset| 4) (select |#length| |cstrlen_#in~str.base|)), 9119#(<= (+ cstrstr_~find.offset 4) (select |#length| cstrstr_~find.base))] [2018-02-04 15:04:35,334 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:35,334 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 15:04:35,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 15:04:35,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-02-04 15:04:35,334 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand 17 states. [2018-02-04 15:04:35,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:35,606 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2018-02-04 15:04:35,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 15:04:35,606 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 80 [2018-02-04 15:04:35,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:35,607 INFO L225 Difference]: With dead ends: 131 [2018-02-04 15:04:35,607 INFO L226 Difference]: Without dead ends: 131 [2018-02-04 15:04:35,607 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2018-02-04 15:04:35,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-04 15:04:35,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 103. [2018-02-04 15:04:35,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 15:04:35,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2018-02-04 15:04:35,609 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 80 [2018-02-04 15:04:35,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:35,609 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2018-02-04 15:04:35,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 15:04:35,610 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2018-02-04 15:04:35,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-04 15:04:35,610 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:35,610 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:04:35,610 INFO L371 AbstractCegarLoop]: === Iteration 39 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:35,610 INFO L82 PathProgramCache]: Analyzing trace with hash -2030073155, now seen corresponding path program 3 times [2018-02-04 15:04:35,610 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:35,617 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:35,814 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 8 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:35,815 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:35,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 15:04:35,815 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:35,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:35,815 INFO L182 omatonBuilderFactory]: Interpolants [9388#true, 9389#false, 9390#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 9391#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 9392#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 9393#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 9394#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 9395#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 9396#(<= (+ |cstrlen_#in~str.offset| 4) (select |#length| |cstrlen_#in~str.base|)), 9397#(<= (+ cstrstr_~find.offset 4) (select |#length| cstrstr_~find.base)), 9398#(<= (+ |cstrncmp_#in~s2.offset| 4) (select |#length| |cstrncmp_#in~s2.base|)), 9399#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 9400#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 9401#(<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)), 9402#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 9403#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 9404#(and (<= 2 cstrncmp_~s2.offset) (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base))), 9405#(and (<= 1 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|)))] [2018-02-04 15:04:35,815 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 8 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:35,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 15:04:35,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 15:04:35,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-02-04 15:04:35,816 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand 18 states. [2018-02-04 15:04:36,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:36,207 INFO L93 Difference]: Finished difference Result 145 states and 163 transitions. [2018-02-04 15:04:36,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 15:04:36,207 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 84 [2018-02-04 15:04:36,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:36,208 INFO L225 Difference]: With dead ends: 145 [2018-02-04 15:04:36,208 INFO L226 Difference]: Without dead ends: 145 [2018-02-04 15:04:36,208 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=962, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 15:04:36,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-04 15:04:36,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 104. [2018-02-04 15:04:36,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-04 15:04:36,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2018-02-04 15:04:36,210 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 84 [2018-02-04 15:04:36,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:36,210 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2018-02-04 15:04:36,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 15:04:36,210 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2018-02-04 15:04:36,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 15:04:36,210 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:36,210 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:04:36,210 INFO L371 AbstractCegarLoop]: === Iteration 40 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:36,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1722506154, now seen corresponding path program 5 times [2018-02-04 15:04:36,211 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:36,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 39 proven. 48 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:04:36,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:36,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 15:04:36,329 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:36,329 INFO L182 omatonBuilderFactory]: Interpolants [9696#(and (<= 3 cstrstr_~len~0) (<= cstrstr_~len~0 3)), 9697#(and (<= |cstrncmp_#in~n| 3) (<= 3 |cstrncmp_#in~n|)), 9698#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 9699#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 9700#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 9701#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|)), 9688#true, 9689#false, 9690#(= cstrlen_~s~0.offset cstrlen_~str.offset), 9691#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 9692#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 9693#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 9694#(and (<= |cstrlen_#res| 3) (<= 3 |cstrlen_#res|)), 9695#(and (<= 3 |cstrstr_#t~ret13|) (<= |cstrstr_#t~ret13| 3))] [2018-02-04 15:04:36,330 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 39 proven. 48 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:04:36,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 15:04:36,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 15:04:36,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-02-04 15:04:36,330 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand 14 states. [2018-02-04 15:04:36,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:36,448 INFO L93 Difference]: Finished difference Result 175 states and 201 transitions. [2018-02-04 15:04:36,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 15:04:36,448 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2018-02-04 15:04:36,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:36,449 INFO L225 Difference]: With dead ends: 175 [2018-02-04 15:04:36,449 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 15:04:36,449 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-02-04 15:04:36,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 15:04:36,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-02-04 15:04:36,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 15:04:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2018-02-04 15:04:36,451 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 89 [2018-02-04 15:04:36,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:36,451 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2018-02-04 15:04:36,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 15:04:36,451 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2018-02-04 15:04:36,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-04 15:04:36,451 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:36,451 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:04:36,451 INFO L371 AbstractCegarLoop]: === Iteration 41 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:36,451 INFO L82 PathProgramCache]: Analyzing trace with hash 947282541, now seen corresponding path program 6 times [2018-02-04 15:04:36,452 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:36,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:36,677 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 18 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:36,678 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:36,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 15:04:36,678 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:36,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:36,678 INFO L182 omatonBuilderFactory]: Interpolants [9995#true, 9996#false, 9997#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 9998#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 9999#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 10000#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 10001#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 10002#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 10003#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 10004#(<= (+ |cstrlen_#in~str.offset| 5) (select |#length| |cstrlen_#in~str.base|)), 10005#(<= (+ cstrstr_~find.offset 5) (select |#length| cstrstr_~find.base)), 10006#(<= (+ |cstrncmp_#in~s2.offset| 5) (select |#length| |cstrncmp_#in~s2.base|)), 10007#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 10008#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 10009#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 10010#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 10011#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 10012#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 10013#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 2 |cstrncmp_#t~post3.offset|))] [2018-02-04 15:04:36,678 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 18 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:36,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 15:04:36,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 15:04:36,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-02-04 15:04:36,679 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 19 states. [2018-02-04 15:04:37,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:37,057 INFO L93 Difference]: Finished difference Result 151 states and 170 transitions. [2018-02-04 15:04:37,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 15:04:37,057 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 93 [2018-02-04 15:04:37,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:37,058 INFO L225 Difference]: With dead ends: 151 [2018-02-04 15:04:37,058 INFO L226 Difference]: Without dead ends: 151 [2018-02-04 15:04:37,058 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 15:04:37,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-04 15:04:37,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 116. [2018-02-04 15:04:37,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 15:04:37,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2018-02-04 15:04:37,061 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 93 [2018-02-04 15:04:37,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:37,061 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2018-02-04 15:04:37,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 15:04:37,061 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2018-02-04 15:04:37,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-04 15:04:37,062 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:37,062 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:04:37,062 INFO L371 AbstractCegarLoop]: === Iteration 42 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:37,062 INFO L82 PathProgramCache]: Analyzing trace with hash 2021391279, now seen corresponding path program 4 times [2018-02-04 15:04:37,063 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:37,074 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:37,424 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 18 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:37,424 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:37,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 15:04:37,424 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:37,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-04 15:04:37,425 INFO L182 omatonBuilderFactory]: Interpolants [10312#true, 10313#false, 10314#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 10315#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 10316#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 10317#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 10318#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 10319#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 10320#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 10321#(<= (+ |cstrlen_#in~str.offset| 5) (select |#length| |cstrlen_#in~str.base|)), 10322#(<= (+ cstrstr_~find.offset 5) (select |#length| cstrstr_~find.base)), 10323#(<= (+ |cstrncmp_#in~s2.offset| 5) (select |#length| |cstrncmp_#in~s2.base|)), 10324#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 10325#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 10326#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 10327#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 10328#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 10329#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 10330#(and (<= 3 cstrncmp_~s2.offset) (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base))), 10331#(and (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|)) (<= 2 |cstrncmp_#t~pre6.offset|))] [2018-02-04 15:04:37,425 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 18 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:37,425 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 15:04:37,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 15:04:37,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-02-04 15:04:37,425 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand 20 states. [2018-02-04 15:04:37,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:37,886 INFO L93 Difference]: Finished difference Result 165 states and 186 transitions. [2018-02-04 15:04:37,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 15:04:37,886 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2018-02-04 15:04:37,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:37,887 INFO L225 Difference]: With dead ends: 165 [2018-02-04 15:04:37,887 INFO L226 Difference]: Without dead ends: 165 [2018-02-04 15:04:37,887 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=1160, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 15:04:37,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-04 15:04:37,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 117. [2018-02-04 15:04:37,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 15:04:37,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2018-02-04 15:04:37,889 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 97 [2018-02-04 15:04:37,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:37,889 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2018-02-04 15:04:37,889 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 15:04:37,889 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2018-02-04 15:04:37,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-04 15:04:37,890 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:37,890 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:04:37,890 INFO L371 AbstractCegarLoop]: === Iteration 43 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:37,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1100369416, now seen corresponding path program 7 times [2018-02-04 15:04:37,890 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:37,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:38,109 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 52 proven. 90 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:04:38,109 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:38,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 15:04:38,109 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:38,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:38,109 INFO L182 omatonBuilderFactory]: Interpolants [10656#(and (<= 4 |cstrlen_#res|) (<= |cstrlen_#res| 4)), 10657#(and (<= |cstrstr_#t~ret13| 4) (<= 4 |cstrstr_#t~ret13|)), 10658#(and (<= cstrstr_~len~0 4) (<= 4 cstrstr_~len~0)), 10659#(and (<= |cstrncmp_#in~n| 4) (<= 4 |cstrncmp_#in~n|)), 10660#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 10661#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 10662#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 10663#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 10664#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|)), 10649#true, 10650#false, 10651#(= cstrlen_~s~0.offset cstrlen_~str.offset), 10652#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 10653#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 10654#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 10655#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4)))] [2018-02-04 15:04:38,110 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 52 proven. 90 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:04:38,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 15:04:38,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 15:04:38,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-02-04 15:04:38,110 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand 16 states. [2018-02-04 15:04:38,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:38,273 INFO L93 Difference]: Finished difference Result 204 states and 236 transitions. [2018-02-04 15:04:38,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 15:04:38,273 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 102 [2018-02-04 15:04:38,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:38,274 INFO L225 Difference]: With dead ends: 204 [2018-02-04 15:04:38,274 INFO L226 Difference]: Without dead ends: 122 [2018-02-04 15:04:38,274 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-02-04 15:04:38,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-04 15:04:38,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-02-04 15:04:38,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 15:04:38,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2018-02-04 15:04:38,276 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 102 [2018-02-04 15:04:38,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:38,277 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2018-02-04 15:04:38,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 15:04:38,277 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2018-02-04 15:04:38,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-02-04 15:04:38,277 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:38,277 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:04:38,278 INFO L371 AbstractCegarLoop]: === Iteration 44 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:38,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1389821931, now seen corresponding path program 8 times [2018-02-04 15:04:38,278 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:38,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:38,570 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 32 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:38,570 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:38,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 15:04:38,571 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:38,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:38,571 INFO L182 omatonBuilderFactory]: Interpolants [11008#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 11009#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 11010#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 11011#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 11012#(<= (+ |cstrlen_#in~str.offset| 6) (select |#length| |cstrlen_#in~str.base|)), 11013#(<= (+ cstrstr_~find.offset 6) (select |#length| cstrstr_~find.base)), 11014#(<= (+ |cstrncmp_#in~s2.offset| 6) (select |#length| |cstrncmp_#in~s2.base|)), 11015#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 11016#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 11017#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 11018#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 11019#(<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)), 11020#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 11021#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 11022#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 1 |cstrncmp_#t~post3.offset|)), 11002#true, 11003#false, 11004#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 11005#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 11006#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 11007#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset))] [2018-02-04 15:04:38,571 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 32 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:38,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 15:04:38,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 15:04:38,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-02-04 15:04:38,572 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 21 states. [2018-02-04 15:04:39,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:39,047 INFO L93 Difference]: Finished difference Result 175 states and 197 transitions. [2018-02-04 15:04:39,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 15:04:39,047 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 106 [2018-02-04 15:04:39,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:39,048 INFO L225 Difference]: With dead ends: 175 [2018-02-04 15:04:39,048 INFO L226 Difference]: Without dead ends: 175 [2018-02-04 15:04:39,049 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=1308, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 15:04:39,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-04 15:04:39,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 129. [2018-02-04 15:04:39,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-04 15:04:39,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2018-02-04 15:04:39,051 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 106 [2018-02-04 15:04:39,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:39,052 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2018-02-04 15:04:39,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 15:04:39,052 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2018-02-04 15:04:39,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-04 15:04:39,053 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:39,053 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:04:39,053 INFO L371 AbstractCegarLoop]: === Iteration 45 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:39,053 INFO L82 PathProgramCache]: Analyzing trace with hash -237533865, now seen corresponding path program 5 times [2018-02-04 15:04:39,054 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:39,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:39,468 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 32 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:39,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:39,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 15:04:39,469 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:39,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:39,470 INFO L182 omatonBuilderFactory]: Interpolants [11366#true, 11367#false, 11368#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|))), 11369#(and (= 0 main_~nondetString2~0.offset) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 11370#(= 0 main_~nondetString2~0.offset), 11371#(= 0 |cstrstr_#in~find.offset|), 11372#(and (<= (+ |cstrstr_#t~post11.offset| 1) cstrstr_~find.offset) (= |cstrstr_#t~post11.offset| 0)), 11373#(<= 1 cstrstr_~find.offset), 11374#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 11375#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 11376#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 11377#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 11378#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 11379#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 11380#(<= (+ |cstrlen_#in~str.offset| 6) (select |#length| |cstrlen_#in~str.base|)), 11381#(and (<= (+ cstrstr_~find.offset 6) (select |#length| cstrstr_~find.base)) (<= 1 cstrstr_~find.offset)), 11382#(and (<= 1 |cstrncmp_#in~s2.offset|) (<= (+ |cstrncmp_#in~s2.offset| 6) (select |#length| |cstrncmp_#in~s2.base|))), 11383#(and (<= 1 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base))), 11384#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base))), 11385#(and (<= 3 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base))), 11386#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 4 cstrncmp_~s2.offset)), 11387#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 5 cstrncmp_~s2.offset)), 11388#(and (<= 6 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 11389#(and (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base)) (<= 7 cstrncmp_~s2.offset)), 11390#(and (<= 6 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|)))] [2018-02-04 15:04:39,470 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 32 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:39,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 15:04:39,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 15:04:39,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2018-02-04 15:04:39,471 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 25 states. [2018-02-04 15:04:40,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:40,330 INFO L93 Difference]: Finished difference Result 181 states and 205 transitions. [2018-02-04 15:04:40,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 15:04:40,330 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 110 [2018-02-04 15:04:40,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:40,331 INFO L225 Difference]: With dead ends: 181 [2018-02-04 15:04:40,331 INFO L226 Difference]: Without dead ends: 181 [2018-02-04 15:04:40,331 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=1283, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 15:04:40,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-04 15:04:40,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 130. [2018-02-04 15:04:40,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-04 15:04:40,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2018-02-04 15:04:40,333 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 110 [2018-02-04 15:04:40,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:40,333 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2018-02-04 15:04:40,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 15:04:40,333 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2018-02-04 15:04:40,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-02-04 15:04:40,334 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:40,334 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:04:40,334 INFO L371 AbstractCegarLoop]: === Iteration 46 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:40,334 INFO L82 PathProgramCache]: Analyzing trace with hash -863375024, now seen corresponding path program 9 times [2018-02-04 15:04:40,334 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:40,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:40,541 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 65 proven. 145 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:04:40,541 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:40,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 15:04:40,541 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:40,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:40,542 INFO L182 omatonBuilderFactory]: Interpolants [11744#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 11745#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|)), 11728#true, 11729#false, 11730#(= cstrlen_~s~0.offset cstrlen_~str.offset), 11731#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 11732#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 11733#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 11734#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 11735#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 11736#(and (<= |cstrlen_#res| 5) (<= 5 |cstrlen_#res|)), 11737#(and (<= |cstrstr_#t~ret13| 5) (<= 5 |cstrstr_#t~ret13|)), 11738#(and (<= cstrstr_~len~0 5) (<= 5 cstrstr_~len~0)), 11739#(and (<= |cstrncmp_#in~n| 5) (<= 5 |cstrncmp_#in~n|)), 11740#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 11741#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 11742#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 11743#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2))] [2018-02-04 15:04:40,542 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 65 proven. 145 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:04:40,542 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 15:04:40,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 15:04:40,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-02-04 15:04:40,542 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand 18 states. [2018-02-04 15:04:40,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:40,788 INFO L93 Difference]: Finished difference Result 233 states and 271 transitions. [2018-02-04 15:04:40,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 15:04:40,789 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 115 [2018-02-04 15:04:40,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:40,789 INFO L225 Difference]: With dead ends: 233 [2018-02-04 15:04:40,789 INFO L226 Difference]: Without dead ends: 135 [2018-02-04 15:04:40,789 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-02-04 15:04:40,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-04 15:04:40,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-02-04 15:04:40,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-04 15:04:40,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2018-02-04 15:04:40,791 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 115 [2018-02-04 15:04:40,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:40,791 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2018-02-04 15:04:40,791 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 15:04:40,792 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2018-02-04 15:04:40,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-02-04 15:04:40,792 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:40,792 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:04:40,792 INFO L371 AbstractCegarLoop]: === Iteration 47 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:40,792 INFO L82 PathProgramCache]: Analyzing trace with hash 901331539, now seen corresponding path program 10 times [2018-02-04 15:04:40,793 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:40,806 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:41,273 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 50 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:41,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:41,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 15:04:41,274 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:41,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:41,274 INFO L182 omatonBuilderFactory]: Interpolants [12127#true, 12128#false, 12129#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|))), 12130#(and (= 0 main_~nondetString2~0.offset) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 12131#(= 0 main_~nondetString2~0.offset), 12132#(= 0 |cstrstr_#in~find.offset|), 12133#(and (<= (+ |cstrstr_#t~post11.offset| 1) cstrstr_~find.offset) (= |cstrstr_#t~post11.offset| 0)), 12134#(<= 1 cstrstr_~find.offset), 12135#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 12136#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 12137#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 12138#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 12139#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 12140#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 12141#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 12142#(<= (+ |cstrlen_#in~str.offset| 7) (select |#length| |cstrlen_#in~str.base|)), 12143#(and (<= (+ cstrstr_~find.offset 7) (select |#length| cstrstr_~find.base)) (<= 1 cstrstr_~find.offset)), 12144#(and (<= 1 |cstrncmp_#in~s2.offset|) (<= (+ |cstrncmp_#in~s2.offset| 7) (select |#length| |cstrncmp_#in~s2.base|))), 12145#(and (<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 12146#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base))), 12147#(and (<= 3 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base))), 12148#(and (<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)) (<= 4 cstrncmp_~s2.offset)), 12149#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 5 cstrncmp_~s2.offset)), 12150#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 6 cstrncmp_~s2.offset)), 12151#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 7 cstrncmp_~s2.offset)), 12152#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 7 |cstrncmp_#t~post3.offset|))] [2018-02-04 15:04:41,274 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 50 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:41,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 15:04:41,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 15:04:41,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2018-02-04 15:04:41,275 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand 26 states. [2018-02-04 15:04:41,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:41,896 INFO L93 Difference]: Finished difference Result 187 states and 212 transitions. [2018-02-04 15:04:41,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 15:04:41,897 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 119 [2018-02-04 15:04:41,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:41,898 INFO L225 Difference]: With dead ends: 187 [2018-02-04 15:04:41,898 INFO L226 Difference]: Without dead ends: 187 [2018-02-04 15:04:41,898 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=1353, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 15:04:41,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-04 15:04:41,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 142. [2018-02-04 15:04:41,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-04 15:04:41,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 166 transitions. [2018-02-04 15:04:41,900 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 166 transitions. Word has length 119 [2018-02-04 15:04:41,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:41,901 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 166 transitions. [2018-02-04 15:04:41,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 15:04:41,901 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 166 transitions. [2018-02-04 15:04:41,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-02-04 15:04:41,901 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:41,901 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:04:41,901 INFO L371 AbstractCegarLoop]: === Iteration 48 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:41,901 INFO L82 PathProgramCache]: Analyzing trace with hash -417042283, now seen corresponding path program 6 times [2018-02-04 15:04:41,902 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:41,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:42,374 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 50 proven. 193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:42,374 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:42,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 15:04:42,375 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:42,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:42,375 INFO L182 omatonBuilderFactory]: Interpolants [12508#true, 12509#false, 12510#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|))), 12511#(and (= 0 main_~nondetString2~0.offset) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 12512#(= 0 main_~nondetString2~0.offset), 12513#(= 0 |cstrstr_#in~find.offset|), 12514#(and (<= (+ |cstrstr_#t~post11.offset| 1) cstrstr_~find.offset) (= |cstrstr_#t~post11.offset| 0)), 12515#(<= 1 cstrstr_~find.offset), 12516#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 12517#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 12518#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 12519#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 12520#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 12521#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 12522#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 12523#(<= (+ |cstrlen_#in~str.offset| 7) (select |#length| |cstrlen_#in~str.base|)), 12524#(and (<= (+ cstrstr_~find.offset 7) (select |#length| cstrstr_~find.base)) (<= 1 cstrstr_~find.offset)), 12525#(and (<= 1 |cstrncmp_#in~s2.offset|) (<= (+ |cstrncmp_#in~s2.offset| 7) (select |#length| |cstrncmp_#in~s2.base|))), 12526#(and (<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 12527#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base))), 12528#(and (<= 3 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base))), 12529#(and (<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)) (<= 4 cstrncmp_~s2.offset)), 12530#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 5 cstrncmp_~s2.offset)), 12531#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 6 cstrncmp_~s2.offset)), 12532#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 7 cstrncmp_~s2.offset)), 12533#(and (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base)) (<= 8 cstrncmp_~s2.offset)), 12534#(and (<= 7 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|)))] [2018-02-04 15:04:42,375 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 50 proven. 193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:42,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 15:04:42,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 15:04:42,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2018-02-04 15:04:42,376 INFO L87 Difference]: Start difference. First operand 142 states and 166 transitions. Second operand 27 states. [2018-02-04 15:04:43,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:43,239 INFO L93 Difference]: Finished difference Result 201 states and 228 transitions. [2018-02-04 15:04:43,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 15:04:43,239 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 123 [2018-02-04 15:04:43,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:43,240 INFO L225 Difference]: With dead ends: 201 [2018-02-04 15:04:43,240 INFO L226 Difference]: Without dead ends: 201 [2018-02-04 15:04:43,241 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=1503, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 15:04:43,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-02-04 15:04:43,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 143. [2018-02-04 15:04:43,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-04 15:04:43,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 168 transitions. [2018-02-04 15:04:43,243 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 168 transitions. Word has length 123 [2018-02-04 15:04:43,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:43,243 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 168 transitions. [2018-02-04 15:04:43,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 15:04:43,243 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 168 transitions. [2018-02-04 15:04:43,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-02-04 15:04:43,244 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:43,244 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:04:43,244 INFO L371 AbstractCegarLoop]: === Iteration 49 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:43,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1285268270, now seen corresponding path program 11 times [2018-02-04 15:04:43,244 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:43,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:43,535 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 78 proven. 213 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:04:43,535 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:43,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 15:04:43,536 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:43,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:43,536 INFO L182 omatonBuilderFactory]: Interpolants [12907#true, 12908#false, 12909#(= cstrlen_~s~0.offset cstrlen_~str.offset), 12910#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 12911#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 12912#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 12913#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 12914#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 12915#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 6)) (<= (+ cstrlen_~str.offset 6) cstrlen_~s~0.offset)), 12916#(and (<= |cstrlen_#res| 6) (<= 6 |cstrlen_#res|)), 12917#(and (<= |cstrstr_#t~ret13| 6) (<= 6 |cstrstr_#t~ret13|)), 12918#(and (<= 6 cstrstr_~len~0) (<= cstrstr_~len~0 6)), 12919#(and (<= |cstrncmp_#in~n| 6) (<= 6 |cstrncmp_#in~n|)), 12920#(and (<= cstrncmp_~n 6) (<= 6 cstrncmp_~n)), 12921#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 12922#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 12923#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 12924#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 12925#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 12926#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|))] [2018-02-04 15:04:43,536 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 78 proven. 213 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:04:43,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 15:04:43,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 15:04:43,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-02-04 15:04:43,537 INFO L87 Difference]: Start difference. First operand 143 states and 168 transitions. Second operand 20 states. [2018-02-04 15:04:43,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:43,864 INFO L93 Difference]: Finished difference Result 262 states and 306 transitions. [2018-02-04 15:04:43,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 15:04:43,865 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 128 [2018-02-04 15:04:43,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:43,865 INFO L225 Difference]: With dead ends: 262 [2018-02-04 15:04:43,866 INFO L226 Difference]: Without dead ends: 148 [2018-02-04 15:04:43,866 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2018-02-04 15:04:43,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-04 15:04:43,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-02-04 15:04:43,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-04 15:04:43,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 172 transitions. [2018-02-04 15:04:43,869 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 172 transitions. Word has length 128 [2018-02-04 15:04:43,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:43,869 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 172 transitions. [2018-02-04 15:04:43,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 15:04:43,869 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 172 transitions. [2018-02-04 15:04:43,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-04 15:04:43,870 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:43,870 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:04:43,870 INFO L371 AbstractCegarLoop]: === Iteration 50 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:43,870 INFO L82 PathProgramCache]: Analyzing trace with hash -760409937, now seen corresponding path program 12 times [2018-02-04 15:04:43,871 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:43,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:44,244 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 72 proven. 250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:44,245 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:44,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 15:04:44,245 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:44,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:44,245 INFO L182 omatonBuilderFactory]: Interpolants [13376#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 1 |cstrncmp_#t~post3.offset|)), 13352#true, 13353#false, 13354#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 13355#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 13356#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 13357#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 13358#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 13359#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 13360#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 13361#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 13362#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 13363#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 13364#(<= (+ |cstrlen_#in~str.offset| 8) (select |#length| |cstrlen_#in~str.base|)), 13365#(<= (+ cstrstr_~find.offset 8) (select |#length| cstrstr_~find.base)), 13366#(<= (+ |cstrncmp_#in~s2.offset| 8) (select |#length| |cstrncmp_#in~s2.base|)), 13367#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 13368#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 13369#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 13370#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 13371#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 13372#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 13373#(<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)), 13374#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 13375#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset))] [2018-02-04 15:04:44,245 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 72 proven. 250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:44,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 15:04:44,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 15:04:44,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2018-02-04 15:04:44,246 INFO L87 Difference]: Start difference. First operand 147 states and 172 transitions. Second operand 25 states. [2018-02-04 15:04:44,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:44,791 INFO L93 Difference]: Finished difference Result 219 states and 247 transitions. [2018-02-04 15:04:44,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 15:04:44,792 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 132 [2018-02-04 15:04:44,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:44,792 INFO L225 Difference]: With dead ends: 219 [2018-02-04 15:04:44,792 INFO L226 Difference]: Without dead ends: 219 [2018-02-04 15:04:44,793 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=417, Invalid=2033, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 15:04:44,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-04 15:04:44,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 155. [2018-02-04 15:04:44,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-04 15:04:44,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 182 transitions. [2018-02-04 15:04:44,795 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 182 transitions. Word has length 132 [2018-02-04 15:04:44,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:44,795 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 182 transitions. [2018-02-04 15:04:44,795 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 15:04:44,795 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 182 transitions. [2018-02-04 15:04:44,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-02-04 15:04:44,795 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:44,795 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:04:44,795 INFO L371 AbstractCegarLoop]: === Iteration 51 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:44,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1622296335, now seen corresponding path program 7 times [2018-02-04 15:04:44,796 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:44,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:45,401 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 72 proven. 257 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:45,402 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:45,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 15:04:45,402 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:45,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:45,402 INFO L182 omatonBuilderFactory]: Interpolants [13824#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 13825#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 13826#(and (<= 2 cstrncmp_~s2.offset) (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base))), 13827#(and (<= 1 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|))), 13802#true, 13803#false, 13804#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 13805#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 13806#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 13807#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 13808#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 13809#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 13810#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 13811#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 13812#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 13813#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 13814#(<= (+ |cstrlen_#in~str.offset| 8) (select |#length| |cstrlen_#in~str.base|)), 13815#(<= (+ cstrstr_~find.offset 8) (select |#length| cstrstr_~find.base)), 13816#(<= (+ |cstrncmp_#in~s2.offset| 8) (select |#length| |cstrncmp_#in~s2.base|)), 13817#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 13818#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 13819#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 13820#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 13821#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 13822#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 13823#(<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base))] [2018-02-04 15:04:45,402 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 72 proven. 257 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:45,403 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 15:04:45,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 15:04:45,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2018-02-04 15:04:45,403 INFO L87 Difference]: Start difference. First operand 155 states and 182 transitions. Second operand 26 states. [2018-02-04 15:04:46,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:46,107 INFO L93 Difference]: Finished difference Result 233 states and 263 transitions. [2018-02-04 15:04:46,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 15:04:46,107 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 136 [2018-02-04 15:04:46,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:46,108 INFO L225 Difference]: With dead ends: 233 [2018-02-04 15:04:46,108 INFO L226 Difference]: Without dead ends: 233 [2018-02-04 15:04:46,109 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=524, Invalid=2782, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 15:04:46,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-04 15:04:46,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 156. [2018-02-04 15:04:46,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-04 15:04:46,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 184 transitions. [2018-02-04 15:04:46,112 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 184 transitions. Word has length 136 [2018-02-04 15:04:46,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:46,113 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 184 transitions. [2018-02-04 15:04:46,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 15:04:46,113 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 184 transitions. [2018-02-04 15:04:46,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-02-04 15:04:46,113 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:46,114 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:04:46,114 INFO L371 AbstractCegarLoop]: === Iteration 52 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:46,114 INFO L82 PathProgramCache]: Analyzing trace with hash 650505718, now seen corresponding path program 13 times [2018-02-04 15:04:46,114 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:46,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:46,447 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 91 proven. 294 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:04:46,447 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:46,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 15:04:46,447 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:46,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:46,447 INFO L182 omatonBuilderFactory]: Interpolants [14282#true, 14283#false, 14284#(= cstrlen_~s~0.offset cstrlen_~str.offset), 14285#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 14286#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 14287#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 14288#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 14289#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 14290#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 6)) (<= (+ cstrlen_~str.offset 6) cstrlen_~s~0.offset)), 14291#(and (<= (+ cstrlen_~str.offset 7) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 7))), 14292#(and (<= 7 |cstrlen_#res|) (<= |cstrlen_#res| 7)), 14293#(and (<= 7 |cstrstr_#t~ret13|) (<= |cstrstr_#t~ret13| 7)), 14294#(and (<= 7 cstrstr_~len~0) (<= cstrstr_~len~0 7)), 14295#(and (<= 7 |cstrncmp_#in~n|) (<= |cstrncmp_#in~n| 7)), 14296#(and (<= 7 cstrncmp_~n) (<= cstrncmp_~n 7)), 14297#(and (<= cstrncmp_~n 6) (<= 6 cstrncmp_~n)), 14298#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 14299#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 14300#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 14301#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 14302#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 14303#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|))] [2018-02-04 15:04:46,448 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 91 proven. 294 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:04:46,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 15:04:46,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 15:04:46,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-02-04 15:04:46,448 INFO L87 Difference]: Start difference. First operand 156 states and 184 transitions. Second operand 22 states. [2018-02-04 15:04:46,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:46,779 INFO L93 Difference]: Finished difference Result 291 states and 341 transitions. [2018-02-04 15:04:46,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 15:04:46,780 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 141 [2018-02-04 15:04:46,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:46,780 INFO L225 Difference]: With dead ends: 291 [2018-02-04 15:04:46,780 INFO L226 Difference]: Without dead ends: 161 [2018-02-04 15:04:46,781 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2018-02-04 15:04:46,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-04 15:04:46,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2018-02-04 15:04:46,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-04 15:04:46,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 188 transitions. [2018-02-04 15:04:46,782 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 188 transitions. Word has length 141 [2018-02-04 15:04:46,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:46,782 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 188 transitions. [2018-02-04 15:04:46,782 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 15:04:46,783 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 188 transitions. [2018-02-04 15:04:46,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-02-04 15:04:46,783 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:46,783 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:04:46,783 INFO L371 AbstractCegarLoop]: === Iteration 53 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:46,784 INFO L82 PathProgramCache]: Analyzing trace with hash 753871161, now seen corresponding path program 14 times [2018-02-04 15:04:46,784 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:46,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:47,382 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 98 proven. 322 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:47,382 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:47,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 15:04:47,382 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:47,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:47,383 INFO L182 omatonBuilderFactory]: Interpolants [14784#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 14785#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 14786#(<= (+ |cstrlen_#in~str.offset| 9) (select |#length| |cstrlen_#in~str.base|)), 14787#(<= (+ cstrstr_~find.offset 9) (select |#length| cstrstr_~find.base)), 14788#(<= (+ |cstrncmp_#in~s2.offset| 9) (select |#length| |cstrncmp_#in~s2.base|)), 14789#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 14790#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 14791#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 14792#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 14793#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 14794#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 14795#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 14796#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 14797#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 14798#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 14799#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 2 |cstrncmp_#t~post3.offset|)), 14773#true, 14774#false, 14775#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 14776#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 14777#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 14778#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 14779#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 14780#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 14781#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 14782#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 14783#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset))] [2018-02-04 15:04:47,383 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 98 proven. 322 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:47,383 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 15:04:47,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 15:04:47,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2018-02-04 15:04:47,383 INFO L87 Difference]: Start difference. First operand 160 states and 188 transitions. Second operand 27 states. [2018-02-04 15:04:48,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:48,081 INFO L93 Difference]: Finished difference Result 239 states and 270 transitions. [2018-02-04 15:04:48,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 15:04:48,081 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 145 [2018-02-04 15:04:48,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:48,082 INFO L225 Difference]: With dead ends: 239 [2018-02-04 15:04:48,082 INFO L226 Difference]: Without dead ends: 239 [2018-02-04 15:04:48,082 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=450, Invalid=2412, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 15:04:48,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-04 15:04:48,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 168. [2018-02-04 15:04:48,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-04 15:04:48,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 198 transitions. [2018-02-04 15:04:48,084 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 198 transitions. Word has length 145 [2018-02-04 15:04:48,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:48,084 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 198 transitions. [2018-02-04 15:04:48,085 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 15:04:48,085 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 198 transitions. [2018-02-04 15:04:48,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-02-04 15:04:48,085 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:48,085 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:04:48,085 INFO L371 AbstractCegarLoop]: === Iteration 54 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:48,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1650228347, now seen corresponding path program 8 times [2018-02-04 15:04:48,086 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:48,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:48,554 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 98 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:48,554 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:48,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 15:04:48,555 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:48,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:48,555 INFO L182 omatonBuilderFactory]: Interpolants [15262#true, 15263#false, 15264#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 15265#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 15266#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 15267#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 15268#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 15269#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 15270#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 15271#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 15272#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 15273#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 15274#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 15275#(<= (+ |cstrlen_#in~str.offset| 9) (select |#length| |cstrlen_#in~str.base|)), 15276#(<= (+ cstrstr_~find.offset 9) (select |#length| cstrstr_~find.base)), 15277#(<= (+ |cstrncmp_#in~s2.offset| 9) (select |#length| |cstrncmp_#in~s2.base|)), 15278#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 15279#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 15280#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 15281#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 15282#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 15283#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 15284#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 15285#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 15286#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 15287#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 15288#(and (<= 3 cstrncmp_~s2.offset) (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base))), 15289#(and (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|)) (<= 2 |cstrncmp_#t~pre6.offset|))] [2018-02-04 15:04:48,555 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 98 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:48,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 15:04:48,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 15:04:48,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2018-02-04 15:04:48,556 INFO L87 Difference]: Start difference. First operand 168 states and 198 transitions. Second operand 28 states. [2018-02-04 15:04:49,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:49,605 INFO L93 Difference]: Finished difference Result 253 states and 286 transitions. [2018-02-04 15:04:49,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 15:04:49,605 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 149 [2018-02-04 15:04:49,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:49,606 INFO L225 Difference]: With dead ends: 253 [2018-02-04 15:04:49,606 INFO L226 Difference]: Without dead ends: 253 [2018-02-04 15:04:49,606 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=544, Invalid=3116, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 15:04:49,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-04 15:04:49,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 169. [2018-02-04 15:04:49,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-04 15:04:49,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 200 transitions. [2018-02-04 15:04:49,608 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 200 transitions. Word has length 149 [2018-02-04 15:04:49,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:49,608 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 200 transitions. [2018-02-04 15:04:49,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 15:04:49,608 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 200 transitions. [2018-02-04 15:04:49,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-04 15:04:49,609 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:49,609 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:04:49,609 INFO L371 AbstractCegarLoop]: === Iteration 55 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:49,609 INFO L82 PathProgramCache]: Analyzing trace with hash -923414356, now seen corresponding path program 15 times [2018-02-04 15:04:49,609 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:49,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:49,978 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 104 proven. 388 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:04:49,979 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:49,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 15:04:49,979 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:49,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:49,979 INFO L182 omatonBuilderFactory]: Interpolants [15779#true, 15780#false, 15781#(= cstrlen_~s~0.offset cstrlen_~str.offset), 15782#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 15783#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 15784#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 15785#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 15786#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 15787#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 6)) (<= (+ cstrlen_~str.offset 6) cstrlen_~s~0.offset)), 15788#(and (<= (+ cstrlen_~str.offset 7) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 7))), 15789#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 8)) (<= (+ cstrlen_~str.offset 8) cstrlen_~s~0.offset)), 15790#(and (<= 8 |cstrlen_#res|) (<= |cstrlen_#res| 8)), 15791#(and (<= |cstrstr_#t~ret13| 8) (<= 8 |cstrstr_#t~ret13|)), 15792#(and (<= 8 cstrstr_~len~0) (<= cstrstr_~len~0 8)), 15793#(and (<= |cstrncmp_#in~n| 8) (<= 8 |cstrncmp_#in~n|)), 15794#(and (<= 8 cstrncmp_~n) (<= cstrncmp_~n 8)), 15795#(and (<= 7 cstrncmp_~n) (<= cstrncmp_~n 7)), 15796#(and (<= cstrncmp_~n 6) (<= 6 cstrncmp_~n)), 15797#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 15798#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 15799#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 15800#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 15801#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 15802#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|))] [2018-02-04 15:04:49,979 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 104 proven. 388 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:04:49,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 15:04:49,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 15:04:49,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-02-04 15:04:49,980 INFO L87 Difference]: Start difference. First operand 169 states and 200 transitions. Second operand 24 states. [2018-02-04 15:04:50,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:50,371 INFO L93 Difference]: Finished difference Result 320 states and 376 transitions. [2018-02-04 15:04:50,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 15:04:50,371 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 154 [2018-02-04 15:04:50,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:50,372 INFO L225 Difference]: With dead ends: 320 [2018-02-04 15:04:50,372 INFO L226 Difference]: Without dead ends: 174 [2018-02-04 15:04:50,372 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 15:04:50,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-04 15:04:50,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-02-04 15:04:50,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-04 15:04:50,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 204 transitions. [2018-02-04 15:04:50,378 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 204 transitions. Word has length 154 [2018-02-04 15:04:50,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:50,378 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 204 transitions. [2018-02-04 15:04:50,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 15:04:50,379 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 204 transitions. [2018-02-04 15:04:50,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-02-04 15:04:50,379 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:50,379 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:04:50,379 INFO L371 AbstractCegarLoop]: === Iteration 56 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:50,379 INFO L82 PathProgramCache]: Analyzing trace with hash 133184073, now seen corresponding path program 16 times [2018-02-04 15:04:50,380 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:50,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:50,883 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 128 proven. 403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:50,884 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:50,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 15:04:50,884 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:50,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:50,885 INFO L182 omatonBuilderFactory]: Interpolants [16320#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 16321#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 16322#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 16323#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 16324#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 16325#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 16326#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 16327#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 16328#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 16329#(and (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset) (= cstrlen_~s~0.base |cstrlen_#in~str.base|)), 16330#(<= (+ |cstrlen_#in~str.offset| 10) (select |#length| |cstrlen_#in~str.base|)), 16331#(<= (+ cstrstr_~find.offset 10) (select |#length| cstrstr_~find.base)), 16332#(<= (+ |cstrncmp_#in~s2.offset| 10) (select |#length| |cstrncmp_#in~s2.base|)), 16333#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 16334#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 16335#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 16336#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 16337#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 16338#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 16339#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 16340#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 16341#(<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)), 16342#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 16343#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 16344#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 1 |cstrncmp_#t~post3.offset|)), 16316#true, 16317#false, 16318#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 16319#(= main_~length2~0 (select |#length| main_~nondetString2~0.base))] [2018-02-04 15:04:50,885 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 128 proven. 403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:50,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 15:04:50,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 15:04:50,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2018-02-04 15:04:50,885 INFO L87 Difference]: Start difference. First operand 173 states and 204 transitions. Second operand 29 states. [2018-02-04 15:04:51,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:51,649 INFO L93 Difference]: Finished difference Result 263 states and 297 transitions. [2018-02-04 15:04:51,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 15:04:51,649 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 158 [2018-02-04 15:04:51,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:51,650 INFO L225 Difference]: With dead ends: 263 [2018-02-04 15:04:51,650 INFO L226 Difference]: Without dead ends: 263 [2018-02-04 15:04:51,650 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=626, Invalid=2914, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 15:04:51,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-04 15:04:51,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 181. [2018-02-04 15:04:51,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-04 15:04:51,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 214 transitions. [2018-02-04 15:04:51,653 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 214 transitions. Word has length 158 [2018-02-04 15:04:51,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:51,653 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 214 transitions. [2018-02-04 15:04:51,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 15:04:51,653 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 214 transitions. [2018-02-04 15:04:51,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-02-04 15:04:51,654 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:51,654 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:04:51,654 INFO L371 AbstractCegarLoop]: === Iteration 57 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:51,655 INFO L82 PathProgramCache]: Analyzing trace with hash -984709749, now seen corresponding path program 9 times [2018-02-04 15:04:51,655 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:51,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:52,282 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 128 proven. 412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:52,282 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:52,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-04 15:04:52,283 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:52,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:52,283 INFO L182 omatonBuilderFactory]: Interpolants [16852#true, 16853#false, 16854#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 16855#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 16856#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 16857#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 16858#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 16859#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 16860#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 16861#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 16862#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 16863#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 16864#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 16865#(and (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset) (= cstrlen_~s~0.base |cstrlen_#in~str.base|)), 16866#(<= (+ |cstrlen_#in~str.offset| 10) (select |#length| |cstrlen_#in~str.base|)), 16867#(<= (+ cstrstr_~find.offset 10) (select |#length| cstrstr_~find.base)), 16868#(<= (+ |cstrncmp_#in~s2.offset| 10) (select |#length| |cstrncmp_#in~s2.base|)), 16869#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 16870#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 16871#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 16872#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 16873#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 16874#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 16875#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 16876#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 16877#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 16878#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 2 cstrncmp_~s2.offset)), 16879#(and (<= 3 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 16880#(and (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base)) (<= 4 cstrncmp_~s2.offset)), 16881#(and (<= 3 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|)))] [2018-02-04 15:04:52,283 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 128 proven. 412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:52,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 15:04:52,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 15:04:52,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2018-02-04 15:04:52,283 INFO L87 Difference]: Start difference. First operand 181 states and 214 transitions. Second operand 30 states. [2018-02-04 15:04:53,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:53,243 INFO L93 Difference]: Finished difference Result 273 states and 309 transitions. [2018-02-04 15:04:53,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 15:04:53,243 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 162 [2018-02-04 15:04:53,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:53,244 INFO L225 Difference]: With dead ends: 273 [2018-02-04 15:04:53,244 INFO L226 Difference]: Without dead ends: 273 [2018-02-04 15:04:53,244 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 993 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=563, Invalid=3469, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 15:04:53,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-02-04 15:04:53,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 182. [2018-02-04 15:04:53,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-04 15:04:53,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 216 transitions. [2018-02-04 15:04:53,246 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 216 transitions. Word has length 162 [2018-02-04 15:04:53,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:53,246 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 216 transitions. [2018-02-04 15:04:53,246 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 15:04:53,246 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 216 transitions. [2018-02-04 15:04:53,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-02-04 15:04:53,247 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:53,247 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:04:53,247 INFO L371 AbstractCegarLoop]: === Iteration 58 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:53,247 INFO L82 PathProgramCache]: Analyzing trace with hash -466685540, now seen corresponding path program 17 times [2018-02-04 15:04:53,247 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:53,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:53,713 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 117 proven. 495 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:04:53,713 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:53,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 15:04:53,713 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:53,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:53,714 INFO L182 omatonBuilderFactory]: Interpolants [17408#(= cstrlen_~s~0.offset cstrlen_~str.offset), 17409#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 17410#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 17411#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 17412#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 17413#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 17414#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 6)) (<= (+ cstrlen_~str.offset 6) cstrlen_~s~0.offset)), 17415#(and (<= (+ cstrlen_~str.offset 7) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 7))), 17416#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 8)) (<= (+ cstrlen_~str.offset 8) cstrlen_~s~0.offset)), 17417#(and (<= (+ cstrlen_~str.offset 9) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 9))), 17418#(and (<= |cstrlen_#res| 9) (<= 9 |cstrlen_#res|)), 17419#(and (<= |cstrstr_#t~ret13| 9) (<= 9 |cstrstr_#t~ret13|)), 17420#(and (<= cstrstr_~len~0 9) (<= 9 cstrstr_~len~0)), 17421#(and (<= 9 |cstrncmp_#in~n|) (<= |cstrncmp_#in~n| 9)), 17422#(and (<= 9 cstrncmp_~n) (<= cstrncmp_~n 9)), 17423#(and (<= 8 cstrncmp_~n) (<= cstrncmp_~n 8)), 17424#(and (<= 7 cstrncmp_~n) (<= cstrncmp_~n 7)), 17425#(and (<= cstrncmp_~n 6) (<= 6 cstrncmp_~n)), 17426#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 17427#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 17428#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 17429#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 17430#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 17431#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|)), 17406#true, 17407#false] [2018-02-04 15:04:53,714 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 117 proven. 495 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:04:53,714 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 15:04:53,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 15:04:53,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-02-04 15:04:53,714 INFO L87 Difference]: Start difference. First operand 182 states and 216 transitions. Second operand 26 states. [2018-02-04 15:04:54,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:54,132 INFO L93 Difference]: Finished difference Result 349 states and 411 transitions. [2018-02-04 15:04:54,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 15:04:54,133 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 167 [2018-02-04 15:04:54,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:54,133 INFO L225 Difference]: With dead ends: 349 [2018-02-04 15:04:54,133 INFO L226 Difference]: Without dead ends: 187 [2018-02-04 15:04:54,134 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 15:04:54,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-04 15:04:54,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2018-02-04 15:04:54,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-04 15:04:54,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 220 transitions. [2018-02-04 15:04:54,135 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 220 transitions. Word has length 167 [2018-02-04 15:04:54,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:54,135 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 220 transitions. [2018-02-04 15:04:54,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 15:04:54,136 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 220 transitions. [2018-02-04 15:04:54,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-02-04 15:04:54,136 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:54,137 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:04:54,137 INFO L371 AbstractCegarLoop]: === Iteration 59 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:54,137 INFO L82 PathProgramCache]: Analyzing trace with hash -936653025, now seen corresponding path program 18 times [2018-02-04 15:04:54,137 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:54,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:54,562 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 162 proven. 493 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:54,562 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:54,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 15:04:54,563 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:54,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:54,563 INFO L182 omatonBuilderFactory]: Interpolants [17989#true, 17990#false, 17991#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 17992#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 17993#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 17994#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 17995#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 17996#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 17997#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 17998#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 17999#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 18000#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 18001#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 18002#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 18003#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 18004#(<= (+ |cstrlen_#in~str.offset| 11) (select |#length| |cstrlen_#in~str.base|)), 18005#(<= (+ cstrstr_~find.offset 11) (select |#length| cstrstr_~find.base)), 18006#(<= (+ |cstrncmp_#in~s2.offset| 11) (select |#length| |cstrncmp_#in~s2.base|)), 18007#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 18008#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 18009#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 18010#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 18011#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 18012#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 18013#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 18014#(and (<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 18015#(and (<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 18016#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 2 cstrncmp_~s2.offset)), 18017#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 3 cstrncmp_~s2.offset)), 18018#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 4 cstrncmp_~s2.offset)), 18019#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 4 |cstrncmp_#t~post3.offset|))] [2018-02-04 15:04:54,563 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 162 proven. 493 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:54,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 15:04:54,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 15:04:54,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2018-02-04 15:04:54,563 INFO L87 Difference]: Start difference. First operand 186 states and 220 transitions. Second operand 31 states. [2018-02-04 15:04:55,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:55,454 INFO L93 Difference]: Finished difference Result 279 states and 316 transitions. [2018-02-04 15:04:55,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 15:04:55,454 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 171 [2018-02-04 15:04:55,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:55,455 INFO L225 Difference]: With dead ends: 279 [2018-02-04 15:04:55,455 INFO L226 Difference]: Without dead ends: 279 [2018-02-04 15:04:55,456 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=519, Invalid=3263, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 15:04:55,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-02-04 15:04:55,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 194. [2018-02-04 15:04:55,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-04 15:04:55,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 230 transitions. [2018-02-04 15:04:55,458 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 230 transitions. Word has length 171 [2018-02-04 15:04:55,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:55,458 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 230 transitions. [2018-02-04 15:04:55,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 15:04:55,459 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 230 transitions. [2018-02-04 15:04:55,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-02-04 15:04:55,459 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:55,460 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:04:55,460 INFO L371 AbstractCegarLoop]: === Iteration 60 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:55,460 INFO L82 PathProgramCache]: Analyzing trace with hash 560447329, now seen corresponding path program 10 times [2018-02-04 15:04:55,460 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:55,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:55,953 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 162 proven. 503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:55,953 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:55,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 15:04:55,953 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:55,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:55,954 INFO L182 omatonBuilderFactory]: Interpolants [18560#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 18561#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 18562#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 18563#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 18564#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 18565#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 18566#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 18567#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 18568#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 18569#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 18570#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 18571#(<= (+ |cstrlen_#in~str.offset| 11) (select |#length| |cstrlen_#in~str.base|)), 18572#(<= (+ cstrstr_~find.offset 11) (select |#length| cstrstr_~find.base)), 18573#(<= (+ |cstrncmp_#in~s2.offset| 11) (select |#length| |cstrncmp_#in~s2.base|)), 18574#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 18575#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 18576#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 18577#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 18578#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 18579#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 18580#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 18581#(and (<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 18582#(and (<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 18583#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 2 cstrncmp_~s2.offset)), 18584#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 3 cstrncmp_~s2.offset)), 18585#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 4 cstrncmp_~s2.offset)), 18586#(and (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base)) (<= 5 cstrncmp_~s2.offset)), 18587#(and (<= 4 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|))), 18556#true, 18557#false, 18558#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 18559#(= main_~length2~0 (select |#length| main_~nondetString2~0.base))] [2018-02-04 15:04:55,954 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 162 proven. 503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:55,954 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 15:04:55,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 15:04:55,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2018-02-04 15:04:55,954 INFO L87 Difference]: Start difference. First operand 194 states and 230 transitions. Second operand 32 states. [2018-02-04 15:04:57,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:57,030 INFO L93 Difference]: Finished difference Result 293 states and 332 transitions. [2018-02-04 15:04:57,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 15:04:57,030 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 175 [2018-02-04 15:04:57,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:57,031 INFO L225 Difference]: With dead ends: 293 [2018-02-04 15:04:57,031 INFO L226 Difference]: Without dead ends: 293 [2018-02-04 15:04:57,031 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=581, Invalid=3841, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 15:04:57,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-02-04 15:04:57,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 195. [2018-02-04 15:04:57,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-04 15:04:57,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 232 transitions. [2018-02-04 15:04:57,033 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 232 transitions. Word has length 175 [2018-02-04 15:04:57,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:57,033 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 232 transitions. [2018-02-04 15:04:57,033 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 15:04:57,033 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 232 transitions. [2018-02-04 15:04:57,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-02-04 15:04:57,034 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:57,034 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:04:57,034 INFO L371 AbstractCegarLoop]: === Iteration 61 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:57,035 INFO L82 PathProgramCache]: Analyzing trace with hash -518099578, now seen corresponding path program 19 times [2018-02-04 15:04:57,035 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:57,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:57,432 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 130 proven. 615 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:04:57,432 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:57,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 15:04:57,433 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:57,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:57,433 INFO L182 omatonBuilderFactory]: Interpolants [19147#true, 19148#false, 19149#(= cstrlen_~s~0.offset cstrlen_~str.offset), 19150#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 19151#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 19152#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 19153#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 19154#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 19155#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 6)) (<= (+ cstrlen_~str.offset 6) cstrlen_~s~0.offset)), 19156#(and (<= (+ cstrlen_~str.offset 7) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 7))), 19157#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 8)) (<= (+ cstrlen_~str.offset 8) cstrlen_~s~0.offset)), 19158#(and (<= (+ cstrlen_~str.offset 9) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 9))), 19159#(and (<= (+ cstrlen_~str.offset 10) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 10))), 19160#(and (<= |cstrlen_#res| 10) (<= 10 |cstrlen_#res|)), 19161#(and (<= 10 |cstrstr_#t~ret13|) (<= |cstrstr_#t~ret13| 10)), 19162#(and (<= cstrstr_~len~0 10) (<= 10 cstrstr_~len~0)), 19163#(and (<= |cstrncmp_#in~n| 10) (<= 10 |cstrncmp_#in~n|)), 19164#(and (<= 10 cstrncmp_~n) (<= cstrncmp_~n 10)), 19165#(and (<= 9 cstrncmp_~n) (<= cstrncmp_~n 9)), 19166#(and (<= 8 cstrncmp_~n) (<= cstrncmp_~n 8)), 19167#(and (<= 7 cstrncmp_~n) (<= cstrncmp_~n 7)), 19168#(and (<= cstrncmp_~n 6) (<= 6 cstrncmp_~n)), 19169#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 19170#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 19171#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 19172#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 19173#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 19174#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|))] [2018-02-04 15:04:57,433 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 130 proven. 615 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:04:57,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 15:04:57,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 15:04:57,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-02-04 15:04:57,434 INFO L87 Difference]: Start difference. First operand 195 states and 232 transitions. Second operand 28 states. [2018-02-04 15:04:58,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:58,070 INFO L93 Difference]: Finished difference Result 378 states and 446 transitions. [2018-02-04 15:04:58,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 15:04:58,070 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 180 [2018-02-04 15:04:58,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:58,071 INFO L225 Difference]: With dead ends: 378 [2018-02-04 15:04:58,071 INFO L226 Difference]: Without dead ends: 200 [2018-02-04 15:04:58,071 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=1459, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 15:04:58,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-02-04 15:04:58,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2018-02-04 15:04:58,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-04 15:04:58,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 236 transitions. [2018-02-04 15:04:58,073 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 236 transitions. Word has length 180 [2018-02-04 15:04:58,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:58,073 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 236 transitions. [2018-02-04 15:04:58,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 15:04:58,073 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 236 transitions. [2018-02-04 15:04:58,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-02-04 15:04:58,074 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:58,075 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:04:58,075 INFO L371 AbstractCegarLoop]: === Iteration 62 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:58,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1647238371, now seen corresponding path program 20 times [2018-02-04 15:04:58,075 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:58,093 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:58,591 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 200 proven. 592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:58,591 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:58,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 15:04:58,591 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:58,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:58,591 INFO L182 omatonBuilderFactory]: Interpolants [19776#true, 19777#false, 19778#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 19779#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 19780#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 19781#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 19782#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 19783#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 19784#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 19785#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 19786#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 19787#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 19788#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 19789#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 19790#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 19791#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 19792#(<= (+ |cstrlen_#in~str.offset| 12) (select |#length| |cstrlen_#in~str.base|)), 19793#(<= (+ cstrstr_~find.offset 12) (select |#length| cstrstr_~find.base)), 19794#(<= (+ |cstrncmp_#in~s2.offset| 12) (select |#length| |cstrncmp_#in~s2.base|)), 19795#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 19796#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 19797#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 19798#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 19799#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 19800#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 19801#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 19802#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 19803#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 19804#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 19805#(<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)), 19806#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 19807#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 19808#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 1 |cstrncmp_#t~post3.offset|))] [2018-02-04 15:04:58,592 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 200 proven. 592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:58,592 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 15:04:58,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 15:04:58,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=883, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 15:04:58,592 INFO L87 Difference]: Start difference. First operand 199 states and 236 transitions. Second operand 33 states. [2018-02-04 15:04:59,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:04:59,434 INFO L93 Difference]: Finished difference Result 307 states and 347 transitions. [2018-02-04 15:04:59,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 15:04:59,434 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 184 [2018-02-04 15:04:59,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:04:59,435 INFO L225 Difference]: With dead ends: 307 [2018-02-04 15:04:59,435 INFO L226 Difference]: Without dead ends: 307 [2018-02-04 15:04:59,436 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=879, Invalid=3951, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 15:04:59,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-02-04 15:04:59,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 207. [2018-02-04 15:04:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-04 15:04:59,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 246 transitions. [2018-02-04 15:04:59,437 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 246 transitions. Word has length 184 [2018-02-04 15:04:59,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:04:59,438 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 246 transitions. [2018-02-04 15:04:59,438 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 15:04:59,438 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 246 transitions. [2018-02-04 15:04:59,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-02-04 15:04:59,438 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:04:59,438 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:04:59,438 INFO L371 AbstractCegarLoop]: === Iteration 63 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:04:59,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1008317659, now seen corresponding path program 11 times [2018-02-04 15:04:59,439 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:04:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:04:59,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:04:59,991 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 200 proven. 603 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:59,991 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:04:59,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-04 15:04:59,992 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:04:59,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:59,992 INFO L182 omatonBuilderFactory]: Interpolants [20416#(<= (+ |cstrncmp_#in~s2.offset| 12) (select |#length| |cstrncmp_#in~s2.base|)), 20417#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 20418#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 20419#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 20420#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 20421#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 20422#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 20423#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 20424#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 20425#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 20426#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 20427#(<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)), 20428#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 20429#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 20430#(and (<= 2 cstrncmp_~s2.offset) (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base))), 20431#(and (<= 1 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|))), 20398#true, 20399#false, 20400#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 20401#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 20402#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 20403#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 20404#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 20405#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 20406#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 20407#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 20408#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 20409#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 20410#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 20411#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 20412#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 20413#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 20414#(<= (+ |cstrlen_#in~str.offset| 12) (select |#length| |cstrlen_#in~str.base|)), 20415#(<= (+ cstrstr_~find.offset 12) (select |#length| cstrstr_~find.base))] [2018-02-04 15:04:59,992 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 200 proven. 603 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:04:59,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 15:04:59,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 15:04:59,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=947, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 15:04:59,993 INFO L87 Difference]: Start difference. First operand 207 states and 246 transitions. Second operand 34 states. [2018-02-04 15:05:01,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:01,167 INFO L93 Difference]: Finished difference Result 321 states and 363 transitions. [2018-02-04 15:05:01,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-04 15:05:01,167 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 188 [2018-02-04 15:05:01,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:01,168 INFO L225 Difference]: With dead ends: 321 [2018-02-04 15:05:01,168 INFO L226 Difference]: Without dead ends: 321 [2018-02-04 15:05:01,168 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1826 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1112, Invalid=5530, Unknown=0, NotChecked=0, Total=6642 [2018-02-04 15:05:01,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-02-04 15:05:01,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 208. [2018-02-04 15:05:01,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-04 15:05:01,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 248 transitions. [2018-02-04 15:05:01,171 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 248 transitions. Word has length 188 [2018-02-04 15:05:01,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:01,171 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 248 transitions. [2018-02-04 15:05:01,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 15:05:01,171 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 248 transitions. [2018-02-04 15:05:01,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-02-04 15:05:01,171 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:01,171 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:01,172 INFO L371 AbstractCegarLoop]: === Iteration 64 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:05:01,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1653302206, now seen corresponding path program 21 times [2018-02-04 15:05:01,172 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:01,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:01,607 INFO L134 CoverageAnalysis]: Checked inductivity of 895 backedges. 143 proven. 748 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:05:01,607 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:01,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 15:05:01,608 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:01,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:01,608 INFO L182 omatonBuilderFactory]: Interpolants [21058#true, 21059#false, 21060#(= cstrlen_~s~0.offset cstrlen_~str.offset), 21061#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 21062#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 21063#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 21064#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 21065#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 21066#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 6)) (<= (+ cstrlen_~str.offset 6) cstrlen_~s~0.offset)), 21067#(and (<= (+ cstrlen_~str.offset 7) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 7))), 21068#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 8)) (<= (+ cstrlen_~str.offset 8) cstrlen_~s~0.offset)), 21069#(and (<= (+ cstrlen_~str.offset 9) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 9))), 21070#(and (<= (+ cstrlen_~str.offset 10) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 10))), 21071#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 11)) (<= (+ cstrlen_~str.offset 11) cstrlen_~s~0.offset)), 21072#(and (<= 11 |cstrlen_#res|) (<= |cstrlen_#res| 11)), 21073#(and (<= |cstrstr_#t~ret13| 11) (<= 11 |cstrstr_#t~ret13|)), 21074#(and (<= 11 cstrstr_~len~0) (<= cstrstr_~len~0 11)), 21075#(and (<= |cstrncmp_#in~n| 11) (<= 11 |cstrncmp_#in~n|)), 21076#(and (<= cstrncmp_~n 11) (<= 11 cstrncmp_~n)), 21077#(and (<= 10 cstrncmp_~n) (<= cstrncmp_~n 10)), 21078#(and (<= 9 cstrncmp_~n) (<= cstrncmp_~n 9)), 21079#(and (<= 8 cstrncmp_~n) (<= cstrncmp_~n 8)), 21080#(and (<= 7 cstrncmp_~n) (<= cstrncmp_~n 7)), 21081#(and (<= cstrncmp_~n 6) (<= 6 cstrncmp_~n)), 21082#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 21083#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 21084#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 21085#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 21086#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 21087#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|))] [2018-02-04 15:05:01,608 INFO L134 CoverageAnalysis]: Checked inductivity of 895 backedges. 143 proven. 748 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:05:01,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 15:05:01,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 15:05:01,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-02-04 15:05:01,609 INFO L87 Difference]: Start difference. First operand 208 states and 248 transitions. Second operand 30 states. [2018-02-04 15:05:02,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:02,327 INFO L93 Difference]: Finished difference Result 407 states and 481 transitions. [2018-02-04 15:05:02,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 15:05:02,328 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 193 [2018-02-04 15:05:02,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:02,328 INFO L225 Difference]: With dead ends: 407 [2018-02-04 15:05:02,328 INFO L226 Difference]: Without dead ends: 213 [2018-02-04 15:05:02,329 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=1697, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 15:05:02,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-02-04 15:05:02,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2018-02-04 15:05:02,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-04 15:05:02,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 252 transitions. [2018-02-04 15:05:02,331 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 252 transitions. Word has length 193 [2018-02-04 15:05:02,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:02,331 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 252 transitions. [2018-02-04 15:05:02,331 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 15:05:02,331 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 252 transitions. [2018-02-04 15:05:02,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-02-04 15:05:02,332 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:02,332 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:02,332 INFO L371 AbstractCegarLoop]: === Iteration 65 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:05:02,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1906127867, now seen corresponding path program 22 times [2018-02-04 15:05:02,333 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:02,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:03,263 INFO L134 CoverageAnalysis]: Checked inductivity of 942 backedges. 242 proven. 700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:03,263 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:03,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-04 15:05:03,263 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:03,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:03,264 INFO L182 omatonBuilderFactory]: Interpolants [21760#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 21761#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 21762#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 21763#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 21764#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 21765#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 21766#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 21767#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 2 |cstrncmp_#t~post3.offset|)), 21733#true, 21734#false, 21735#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 21736#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 21737#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 21738#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 21739#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 21740#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 21741#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 21742#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 21743#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 21744#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 21745#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 21746#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 21747#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 21748#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 21749#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 21750#(<= (+ |cstrlen_#in~str.offset| 13) (select |#length| |cstrlen_#in~str.base|)), 21751#(<= (+ cstrstr_~find.offset 13) (select |#length| cstrstr_~find.base)), 21752#(<= (+ |cstrncmp_#in~s2.offset| 13) (select |#length| |cstrncmp_#in~s2.base|)), 21753#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 21754#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 21755#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 21756#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 21757#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 21758#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 21759#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base))] [2018-02-04 15:05:03,264 INFO L134 CoverageAnalysis]: Checked inductivity of 942 backedges. 242 proven. 700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:03,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 15:05:03,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 15:05:03,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1002, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 15:05:03,264 INFO L87 Difference]: Start difference. First operand 212 states and 252 transitions. Second operand 35 states. [2018-02-04 15:05:04,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:04,210 INFO L93 Difference]: Finished difference Result 327 states and 370 transitions. [2018-02-04 15:05:04,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 15:05:04,210 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 197 [2018-02-04 15:05:04,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:04,211 INFO L225 Difference]: With dead ends: 327 [2018-02-04 15:05:04,211 INFO L226 Difference]: Without dead ends: 327 [2018-02-04 15:05:04,211 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=924, Invalid=4478, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 15:05:04,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-02-04 15:05:04,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 220. [2018-02-04 15:05:04,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-04 15:05:04,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 262 transitions. [2018-02-04 15:05:04,213 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 262 transitions. Word has length 197 [2018-02-04 15:05:04,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:04,213 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 262 transitions. [2018-02-04 15:05:04,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 15:05:04,213 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 262 transitions. [2018-02-04 15:05:04,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-02-04 15:05:04,214 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:04,214 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:04,214 INFO L371 AbstractCegarLoop]: === Iteration 66 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:05:04,215 INFO L82 PathProgramCache]: Analyzing trace with hash -932587193, now seen corresponding path program 12 times [2018-02-04 15:05:04,215 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:04,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:04,887 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 242 proven. 712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:04,888 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:04,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-04 15:05:04,888 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:04,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:04,888 INFO L182 omatonBuilderFactory]: Interpolants [22400#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 22401#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 22402#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 22403#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 22404#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 22405#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 22406#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 22407#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 22408#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 22409#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 22410#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 22411#(<= (+ |cstrlen_#in~str.offset| 13) (select |#length| |cstrlen_#in~str.base|)), 22412#(<= (+ cstrstr_~find.offset 13) (select |#length| cstrstr_~find.base)), 22413#(<= (+ |cstrncmp_#in~s2.offset| 13) (select |#length| |cstrncmp_#in~s2.base|)), 22414#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 22415#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 22416#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 22417#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 22418#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 22419#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 22420#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 22421#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 22422#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 22423#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 22424#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 22425#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 22426#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 22427#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 22428#(and (<= 3 cstrncmp_~s2.offset) (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base))), 22429#(and (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|)) (<= 2 |cstrncmp_#t~pre6.offset|)), 22394#true, 22395#false, 22396#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 22397#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 22398#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 22399#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset))] [2018-02-04 15:05:04,889 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 242 proven. 712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:04,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 15:05:04,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 15:05:04,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1070, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 15:05:04,889 INFO L87 Difference]: Start difference. First operand 220 states and 262 transitions. Second operand 36 states. [2018-02-04 15:05:06,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:06,211 INFO L93 Difference]: Finished difference Result 341 states and 386 transitions. [2018-02-04 15:05:06,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-02-04 15:05:06,211 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 201 [2018-02-04 15:05:06,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:06,212 INFO L225 Difference]: With dead ends: 341 [2018-02-04 15:05:06,212 INFO L226 Difference]: Without dead ends: 341 [2018-02-04 15:05:06,213 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1971 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1140, Invalid=6000, Unknown=0, NotChecked=0, Total=7140 [2018-02-04 15:05:06,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-02-04 15:05:06,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 221. [2018-02-04 15:05:06,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-04 15:05:06,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 264 transitions. [2018-02-04 15:05:06,216 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 264 transitions. Word has length 201 [2018-02-04 15:05:06,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:06,217 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 264 transitions. [2018-02-04 15:05:06,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 15:05:06,217 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 264 transitions. [2018-02-04 15:05:06,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-02-04 15:05:06,218 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:06,218 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:06,218 INFO L371 AbstractCegarLoop]: === Iteration 67 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:05:06,218 INFO L82 PathProgramCache]: Analyzing trace with hash 2097058656, now seen corresponding path program 23 times [2018-02-04 15:05:06,219 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:06,242 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:06,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 156 proven. 894 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:05:06,712 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:06,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 15:05:06,712 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:06,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:06,712 INFO L182 omatonBuilderFactory]: Interpolants [23104#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 11)) (<= (+ cstrlen_~str.offset 11) cstrlen_~s~0.offset)), 23105#(and (<= (+ cstrlen_~str.offset 12) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 12))), 23106#(and (<= 12 |cstrlen_#res|) (<= |cstrlen_#res| 12)), 23107#(and (<= |cstrstr_#t~ret13| 12) (<= 12 |cstrstr_#t~ret13|)), 23108#(and (<= 12 cstrstr_~len~0) (<= cstrstr_~len~0 12)), 23109#(and (<= 12 |cstrncmp_#in~n|) (<= |cstrncmp_#in~n| 12)), 23110#(and (<= 12 cstrncmp_~n) (<= cstrncmp_~n 12)), 23111#(and (<= cstrncmp_~n 11) (<= 11 cstrncmp_~n)), 23112#(and (<= 10 cstrncmp_~n) (<= cstrncmp_~n 10)), 23113#(and (<= 9 cstrncmp_~n) (<= cstrncmp_~n 9)), 23114#(and (<= 8 cstrncmp_~n) (<= cstrncmp_~n 8)), 23115#(and (<= 7 cstrncmp_~n) (<= cstrncmp_~n 7)), 23116#(and (<= cstrncmp_~n 6) (<= 6 cstrncmp_~n)), 23117#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 23118#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 23119#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 23120#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 23121#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 23122#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|)), 23091#true, 23092#false, 23093#(= cstrlen_~s~0.offset cstrlen_~str.offset), 23094#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 23095#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 23096#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 23097#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 23098#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 23099#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 6)) (<= (+ cstrlen_~str.offset 6) cstrlen_~s~0.offset)), 23100#(and (<= (+ cstrlen_~str.offset 7) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 7))), 23101#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 8)) (<= (+ cstrlen_~str.offset 8) cstrlen_~s~0.offset)), 23102#(and (<= (+ cstrlen_~str.offset 9) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 9))), 23103#(and (<= (+ cstrlen_~str.offset 10) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 10)))] [2018-02-04 15:05:06,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 156 proven. 894 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:05:06,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 15:05:06,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 15:05:06,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-02-04 15:05:06,713 INFO L87 Difference]: Start difference. First operand 221 states and 264 transitions. Second operand 32 states. [2018-02-04 15:05:07,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:07,388 INFO L93 Difference]: Finished difference Result 436 states and 516 transitions. [2018-02-04 15:05:07,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 15:05:07,388 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 206 [2018-02-04 15:05:07,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:07,389 INFO L225 Difference]: With dead ends: 436 [2018-02-04 15:05:07,389 INFO L226 Difference]: Without dead ends: 226 [2018-02-04 15:05:07,390 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=1953, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 15:05:07,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-04 15:05:07,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-02-04 15:05:07,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-04 15:05:07,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 268 transitions. [2018-02-04 15:05:07,392 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 268 transitions. Word has length 206 [2018-02-04 15:05:07,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:07,393 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 268 transitions. [2018-02-04 15:05:07,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 15:05:07,393 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 268 transitions. [2018-02-04 15:05:07,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-02-04 15:05:07,394 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:07,394 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:07,394 INFO L371 AbstractCegarLoop]: === Iteration 68 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:05:07,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1027254147, now seen corresponding path program 24 times [2018-02-04 15:05:07,395 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:07,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:08,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 288 proven. 817 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:08,163 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:08,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 15:05:08,163 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:08,163 INFO L182 omatonBuilderFactory]: Interpolants [23812#true, 23813#false, 23814#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 23815#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 23816#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 23817#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 23818#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 23819#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 23820#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 23821#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 23822#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 23823#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 23824#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 23825#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 23826#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 23827#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 23828#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 23829#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= cstrlen_~s~0.base |cstrlen_#in~str.base|)), 23830#(<= (+ |cstrlen_#in~str.offset| 14) (select |#length| |cstrlen_#in~str.base|)), 23831#(<= (+ cstrstr_~find.offset 14) (select |#length| cstrstr_~find.base)), 23832#(<= (+ |cstrncmp_#in~s2.offset| 14) (select |#length| |cstrncmp_#in~s2.base|)), 23833#(<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)), 23834#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 23835#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 23836#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 23837#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 23838#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 23839#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 23840#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 23841#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 23842#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 23843#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 23844#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 23845#(<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)), 23846#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 23847#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 23848#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 1 |cstrncmp_#t~post3.offset|))] [2018-02-04 15:05:08,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 288 proven. 817 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:08,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 15:05:08,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 15:05:08,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1105, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 15:05:08,165 INFO L87 Difference]: Start difference. First operand 225 states and 268 transitions. Second operand 37 states. [2018-02-04 15:05:09,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:09,210 INFO L93 Difference]: Finished difference Result 351 states and 397 transitions. [2018-02-04 15:05:09,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-04 15:05:09,211 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 210 [2018-02-04 15:05:09,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:09,211 INFO L225 Difference]: With dead ends: 351 [2018-02-04 15:05:09,212 INFO L226 Difference]: Without dead ends: 351 [2018-02-04 15:05:09,212 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1682 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=5144, Unknown=0, NotChecked=0, Total=6320 [2018-02-04 15:05:09,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-02-04 15:05:09,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 233. [2018-02-04 15:05:09,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-02-04 15:05:09,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 278 transitions. [2018-02-04 15:05:09,215 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 278 transitions. Word has length 210 [2018-02-04 15:05:09,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:09,215 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 278 transitions. [2018-02-04 15:05:09,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 15:05:09,215 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 278 transitions. [2018-02-04 15:05:09,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-02-04 15:05:09,216 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:09,216 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:09,216 INFO L371 AbstractCegarLoop]: === Iteration 69 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:05:09,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1220449857, now seen corresponding path program 13 times [2018-02-04 15:05:09,217 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:09,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:10,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1118 backedges. 288 proven. 830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:10,002 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:10,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-04 15:05:10,003 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:10,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:10,003 INFO L182 omatonBuilderFactory]: Interpolants [24520#true, 24521#false, 24522#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|))), 24523#(and (= 0 main_~nondetString2~0.offset) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 24524#(= 0 main_~nondetString2~0.offset), 24525#(= 0 |cstrstr_#in~find.offset|), 24526#(and (<= (+ |cstrstr_#t~post11.offset| 1) cstrstr_~find.offset) (= |cstrstr_#t~post11.offset| 0)), 24527#(<= 1 cstrstr_~find.offset), 24528#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 24529#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 24530#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 24531#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 24532#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 24533#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 24534#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 24535#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 24536#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 24537#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 24538#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 24539#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 24540#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 24541#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= cstrlen_~s~0.base |cstrlen_#in~str.base|)), 24542#(<= (+ |cstrlen_#in~str.offset| 14) (select |#length| |cstrlen_#in~str.base|)), 24543#(and (<= 1 cstrstr_~find.offset) (<= (+ cstrstr_~find.offset 14) (select |#length| cstrstr_~find.base))), 24544#(and (<= 1 |cstrncmp_#in~s2.offset|) (<= (+ |cstrncmp_#in~s2.offset| 14) (select |#length| |cstrncmp_#in~s2.base|))), 24545#(and (<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 24546#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base))), 24547#(and (<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)) (<= 3 cstrncmp_~s2.offset)), 24548#(and (<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)) (<= 4 cstrncmp_~s2.offset)), 24549#(and (<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)) (<= 5 cstrncmp_~s2.offset)), 24550#(and (<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)) (<= 6 cstrncmp_~s2.offset)), 24551#(and (<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)) (<= 7 cstrncmp_~s2.offset)), 24552#(and (<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)) (<= 8 cstrncmp_~s2.offset)), 24553#(and (<= 9 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base))), 24554#(and (<= 10 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base))), 24555#(and (<= 11 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base))), 24556#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 12 cstrncmp_~s2.offset)), 24557#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 13 cstrncmp_~s2.offset)), 24558#(and (<= 14 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 24559#(and (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base)) (<= 15 cstrncmp_~s2.offset)), 24560#(and (<= 14 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|)))] [2018-02-04 15:05:10,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1118 backedges. 288 proven. 830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:10,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 15:05:10,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 15:05:10,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1480, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 15:05:10,004 INFO L87 Difference]: Start difference. First operand 233 states and 278 transitions. Second operand 41 states. [2018-02-04 15:05:11,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:11,508 INFO L93 Difference]: Finished difference Result 341 states and 389 transitions. [2018-02-04 15:05:11,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 15:05:11,508 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 214 [2018-02-04 15:05:11,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:11,509 INFO L225 Difference]: With dead ends: 341 [2018-02-04 15:05:11,509 INFO L226 Difference]: Without dead ends: 341 [2018-02-04 15:05:11,509 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=263, Invalid=3519, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 15:05:11,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-02-04 15:05:11,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 234. [2018-02-04 15:05:11,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-02-04 15:05:11,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 280 transitions. [2018-02-04 15:05:11,511 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 280 transitions. Word has length 214 [2018-02-04 15:05:11,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:11,511 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 280 transitions. [2018-02-04 15:05:11,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 15:05:11,511 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 280 transitions. [2018-02-04 15:05:11,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-02-04 15:05:11,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:11,512 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:11,512 INFO L371 AbstractCegarLoop]: === Iteration 70 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:05:11,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1020883480, now seen corresponding path program 25 times [2018-02-04 15:05:11,513 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:11,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1226 backedges. 169 proven. 1053 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:05:11,995 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:11,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-04 15:05:11,995 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:11,996 INFO L182 omatonBuilderFactory]: Interpolants [25178#true, 25179#false, 25180#(= cstrlen_~s~0.offset cstrlen_~str.offset), 25181#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 25182#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 25183#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 25184#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 25185#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 25186#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 6)) (<= (+ cstrlen_~str.offset 6) cstrlen_~s~0.offset)), 25187#(and (<= (+ cstrlen_~str.offset 7) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 7))), 25188#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 8)) (<= (+ cstrlen_~str.offset 8) cstrlen_~s~0.offset)), 25189#(and (<= (+ cstrlen_~str.offset 9) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 9))), 25190#(and (<= (+ cstrlen_~str.offset 10) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 10))), 25191#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 11)) (<= (+ cstrlen_~str.offset 11) cstrlen_~s~0.offset)), 25192#(and (<= (+ cstrlen_~str.offset 12) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 12))), 25193#(and (<= (+ cstrlen_~str.offset 13) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 13))), 25194#(and (<= |cstrlen_#res| 13) (<= 13 |cstrlen_#res|)), 25195#(and (<= 13 |cstrstr_#t~ret13|) (<= |cstrstr_#t~ret13| 13)), 25196#(and (<= 13 cstrstr_~len~0) (<= cstrstr_~len~0 13)), 25197#(and (<= |cstrncmp_#in~n| 13) (<= 13 |cstrncmp_#in~n|)), 25198#(and (<= cstrncmp_~n 13) (<= 13 cstrncmp_~n)), 25199#(and (<= 12 cstrncmp_~n) (<= cstrncmp_~n 12)), 25200#(and (<= cstrncmp_~n 11) (<= 11 cstrncmp_~n)), 25201#(and (<= 10 cstrncmp_~n) (<= cstrncmp_~n 10)), 25202#(and (<= 9 cstrncmp_~n) (<= cstrncmp_~n 9)), 25203#(and (<= 8 cstrncmp_~n) (<= cstrncmp_~n 8)), 25204#(and (<= 7 cstrncmp_~n) (<= cstrncmp_~n 7)), 25205#(and (<= cstrncmp_~n 6) (<= 6 cstrncmp_~n)), 25206#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 25207#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 25208#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 25209#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 25210#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 25211#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|))] [2018-02-04 15:05:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1226 backedges. 169 proven. 1053 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:05:11,996 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 15:05:11,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 15:05:11,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 15:05:11,996 INFO L87 Difference]: Start difference. First operand 234 states and 280 transitions. Second operand 34 states. [2018-02-04 15:05:12,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:12,763 INFO L93 Difference]: Finished difference Result 465 states and 551 transitions. [2018-02-04 15:05:12,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 15:05:12,763 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 219 [2018-02-04 15:05:12,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:12,764 INFO L225 Difference]: With dead ends: 465 [2018-02-04 15:05:12,764 INFO L226 Difference]: Without dead ends: 239 [2018-02-04 15:05:12,764 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=2227, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 15:05:12,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-04 15:05:12,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 238. [2018-02-04 15:05:12,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-04 15:05:12,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 284 transitions. [2018-02-04 15:05:12,766 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 284 transitions. Word has length 219 [2018-02-04 15:05:12,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:12,767 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 284 transitions. [2018-02-04 15:05:12,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 15:05:12,767 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 284 transitions. [2018-02-04 15:05:12,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-02-04 15:05:12,767 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:12,767 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:12,768 INFO L371 AbstractCegarLoop]: === Iteration 71 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:05:12,768 INFO L82 PathProgramCache]: Analyzing trace with hash -781729813, now seen corresponding path program 26 times [2018-02-04 15:05:12,768 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:12,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:13,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 338 proven. 943 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:13,755 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:13,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-04 15:05:13,755 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:13,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:13,755 INFO L182 omatonBuilderFactory]: Interpolants [25984#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 14 cstrncmp_~s2.offset)), 25985#(and (<= 15 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 25986#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 15 |cstrncmp_#t~post3.offset|)), 25945#true, 25946#false, 25947#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|))), 25948#(and (= 0 main_~nondetString2~0.offset) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 25949#(= 0 main_~nondetString2~0.offset), 25950#(= 0 |cstrstr_#in~find.offset|), 25951#(and (<= (+ |cstrstr_#t~post11.offset| 1) cstrstr_~find.offset) (= |cstrstr_#t~post11.offset| 0)), 25952#(<= 1 cstrstr_~find.offset), 25953#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 25954#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 25955#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 25956#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 25957#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 25958#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 25959#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 25960#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 25961#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 25962#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 25963#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 25964#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 25965#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 25966#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 25967#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 25968#(<= (+ |cstrlen_#in~str.offset| 15) (select |#length| |cstrlen_#in~str.base|)), 25969#(and (<= (+ cstrstr_~find.offset 15) (select |#length| cstrstr_~find.base)) (<= 1 cstrstr_~find.offset)), 25970#(and (<= 1 |cstrncmp_#in~s2.offset|) (<= (+ |cstrncmp_#in~s2.offset| 15) (select |#length| |cstrncmp_#in~s2.base|))), 25971#(and (<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 25972#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base))), 25973#(and (<= 3 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base))), 25974#(and (<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)) (<= 4 cstrncmp_~s2.offset)), 25975#(and (<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)) (<= 5 cstrncmp_~s2.offset)), 25976#(and (<= 6 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base))), 25977#(and (<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)) (<= 7 cstrncmp_~s2.offset)), 25978#(and (<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)) (<= 8 cstrncmp_~s2.offset)), 25979#(and (<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)) (<= 9 cstrncmp_~s2.offset)), 25980#(and (<= 10 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base))), 25981#(and (<= 11 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base))), 25982#(and (<= 12 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base))), 25983#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 13 cstrncmp_~s2.offset))] [2018-02-04 15:05:13,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 338 proven. 943 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:13,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 15:05:13,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 15:05:13,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1547, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 15:05:13,756 INFO L87 Difference]: Start difference. First operand 238 states and 284 transitions. Second operand 42 states. [2018-02-04 15:05:15,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:15,318 INFO L93 Difference]: Finished difference Result 347 states and 396 transitions. [2018-02-04 15:05:15,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 15:05:15,318 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 223 [2018-02-04 15:05:15,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:15,319 INFO L225 Difference]: With dead ends: 347 [2018-02-04 15:05:15,319 INFO L226 Difference]: Without dead ends: 347 [2018-02-04 15:05:15,319 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=3629, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 15:05:15,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-02-04 15:05:15,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 246. [2018-02-04 15:05:15,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-02-04 15:05:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 294 transitions. [2018-02-04 15:05:15,321 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 294 transitions. Word has length 223 [2018-02-04 15:05:15,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:15,322 INFO L432 AbstractCegarLoop]: Abstraction has 246 states and 294 transitions. [2018-02-04 15:05:15,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 15:05:15,322 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 294 transitions. [2018-02-04 15:05:15,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-02-04 15:05:15,322 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:15,322 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:15,322 INFO L371 AbstractCegarLoop]: === Iteration 72 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:05:15,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1449552429, now seen corresponding path program 14 times [2018-02-04 15:05:15,323 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:15,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:16,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 338 proven. 957 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:16,227 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:16,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-04 15:05:16,227 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:16,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:16,227 INFO L182 omatonBuilderFactory]: Interpolants [26624#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|))), 26625#(and (= 0 main_~nondetString2~0.offset) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 26626#(= 0 main_~nondetString2~0.offset), 26627#(= 0 |cstrstr_#in~find.offset|), 26628#(and (<= (+ |cstrstr_#t~post11.offset| 1) cstrstr_~find.offset) (= |cstrstr_#t~post11.offset| 0)), 26629#(<= 1 cstrstr_~find.offset), 26630#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 26631#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 26632#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 26633#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 26634#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 26635#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 26636#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 26637#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 26638#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 26639#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 26640#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 26641#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 26642#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 26643#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 26644#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 26645#(<= (+ |cstrlen_#in~str.offset| 15) (select |#length| |cstrlen_#in~str.base|)), 26646#(and (<= (+ cstrstr_~find.offset 15) (select |#length| cstrstr_~find.base)) (<= 1 cstrstr_~find.offset)), 26647#(and (<= 1 |cstrncmp_#in~s2.offset|) (<= (+ |cstrncmp_#in~s2.offset| 15) (select |#length| |cstrncmp_#in~s2.base|))), 26648#(and (<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 26649#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base))), 26650#(and (<= 3 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base))), 26651#(and (<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)) (<= 4 cstrncmp_~s2.offset)), 26652#(and (<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)) (<= 5 cstrncmp_~s2.offset)), 26653#(and (<= 6 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base))), 26654#(and (<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)) (<= 7 cstrncmp_~s2.offset)), 26655#(and (<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)) (<= 8 cstrncmp_~s2.offset)), 26656#(and (<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)) (<= 9 cstrncmp_~s2.offset)), 26657#(and (<= 10 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base))), 26658#(and (<= 11 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base))), 26659#(and (<= 12 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base))), 26660#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 13 cstrncmp_~s2.offset)), 26661#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 14 cstrncmp_~s2.offset)), 26662#(and (<= 15 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 26663#(and (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base)) (<= 16 cstrncmp_~s2.offset)), 26664#(and (<= 15 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|))), 26622#true, 26623#false] [2018-02-04 15:05:16,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 338 proven. 957 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:16,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 15:05:16,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 15:05:16,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1629, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 15:05:16,228 INFO L87 Difference]: Start difference. First operand 246 states and 294 transitions. Second operand 43 states. [2018-02-04 15:05:17,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:17,991 INFO L93 Difference]: Finished difference Result 361 states and 412 transitions. [2018-02-04 15:05:17,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 15:05:17,991 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 227 [2018-02-04 15:05:17,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:17,992 INFO L225 Difference]: With dead ends: 361 [2018-02-04 15:05:17,992 INFO L226 Difference]: Without dead ends: 361 [2018-02-04 15:05:17,993 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=285, Invalid=3875, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 15:05:17,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-02-04 15:05:17,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 247. [2018-02-04 15:05:17,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-02-04 15:05:17,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 296 transitions. [2018-02-04 15:05:17,995 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 296 transitions. Word has length 227 [2018-02-04 15:05:17,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:17,995 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 296 transitions. [2018-02-04 15:05:17,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 15:05:17,996 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 296 transitions. [2018-02-04 15:05:17,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-02-04 15:05:17,996 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:17,997 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:17,997 INFO L371 AbstractCegarLoop]: === Iteration 73 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:05:17,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1898536390, now seen corresponding path program 27 times [2018-02-04 15:05:17,997 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:18,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:18,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1411 backedges. 182 proven. 1225 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:05:18,598 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:18,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 15:05:18,599 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:18,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:18,599 INFO L182 omatonBuilderFactory]: Interpolants [27328#(and (<= (+ cstrlen_~str.offset 9) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 9))), 27329#(and (<= (+ cstrlen_~str.offset 10) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 10))), 27330#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 11)) (<= (+ cstrlen_~str.offset 11) cstrlen_~s~0.offset)), 27331#(and (<= (+ cstrlen_~str.offset 12) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 12))), 27332#(and (<= (+ cstrlen_~str.offset 13) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 13))), 27333#(and (<= (+ cstrlen_~str.offset 14) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 14))), 27334#(and (<= 14 |cstrlen_#res|) (<= |cstrlen_#res| 14)), 27335#(and (<= |cstrstr_#t~ret13| 14) (<= 14 |cstrstr_#t~ret13|)), 27336#(and (<= 14 cstrstr_~len~0) (<= cstrstr_~len~0 14)), 27337#(and (<= 14 |cstrncmp_#in~n|) (<= |cstrncmp_#in~n| 14)), 27338#(and (<= 14 cstrncmp_~n) (<= cstrncmp_~n 14)), 27339#(and (<= cstrncmp_~n 13) (<= 13 cstrncmp_~n)), 27340#(and (<= 12 cstrncmp_~n) (<= cstrncmp_~n 12)), 27341#(and (<= cstrncmp_~n 11) (<= 11 cstrncmp_~n)), 27342#(and (<= 10 cstrncmp_~n) (<= cstrncmp_~n 10)), 27343#(and (<= 9 cstrncmp_~n) (<= cstrncmp_~n 9)), 27344#(and (<= 8 cstrncmp_~n) (<= cstrncmp_~n 8)), 27345#(and (<= 7 cstrncmp_~n) (<= cstrncmp_~n 7)), 27346#(and (<= cstrncmp_~n 6) (<= 6 cstrncmp_~n)), 27347#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 27348#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 27349#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 27350#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 27351#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 27352#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|)), 27317#true, 27318#false, 27319#(= cstrlen_~s~0.offset cstrlen_~str.offset), 27320#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 27321#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 27322#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 27323#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 27324#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 27325#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 6)) (<= (+ cstrlen_~str.offset 6) cstrlen_~s~0.offset)), 27326#(and (<= (+ cstrlen_~str.offset 7) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 7))), 27327#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 8)) (<= (+ cstrlen_~str.offset 8) cstrlen_~s~0.offset))] [2018-02-04 15:05:18,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1411 backedges. 182 proven. 1225 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:05:18,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 15:05:18,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 15:05:18,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 15:05:18,599 INFO L87 Difference]: Start difference. First operand 247 states and 296 transitions. Second operand 36 states. [2018-02-04 15:05:19,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:19,473 INFO L93 Difference]: Finished difference Result 494 states and 586 transitions. [2018-02-04 15:05:19,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 15:05:19,473 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 232 [2018-02-04 15:05:19,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:19,474 INFO L225 Difference]: With dead ends: 494 [2018-02-04 15:05:19,474 INFO L226 Difference]: Without dead ends: 252 [2018-02-04 15:05:19,474 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=2519, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 15:05:19,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-02-04 15:05:19,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 251. [2018-02-04 15:05:19,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-02-04 15:05:19,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 300 transitions. [2018-02-04 15:05:19,476 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 300 transitions. Word has length 232 [2018-02-04 15:05:19,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:19,476 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 300 transitions. [2018-02-04 15:05:19,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 15:05:19,476 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 300 transitions. [2018-02-04 15:05:19,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-02-04 15:05:19,477 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:19,477 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:19,477 INFO L371 AbstractCegarLoop]: === Iteration 74 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:05:19,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1764756759, now seen corresponding path program 28 times [2018-02-04 15:05:19,478 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:19,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:20,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 392 proven. 1078 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:20,283 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:20,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-04 15:05:20,283 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:20,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:20,284 INFO L182 omatonBuilderFactory]: Interpolants [28160#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 28161#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 28162#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 28163#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 28164#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 28165#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 28166#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 28167#(<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)), 28168#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 28169#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 28170#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 1 |cstrncmp_#t~post3.offset|)), 28130#true, 28131#false, 28132#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 28133#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 28134#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 28135#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 28136#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 28137#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 28138#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 28139#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 28140#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 28141#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 28142#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 28143#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 28144#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 28145#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 28146#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 28147#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 28148#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 28149#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 15) cstrlen_~s~0.offset)), 28150#(<= (+ |cstrlen_#in~str.offset| 16) (select |#length| |cstrlen_#in~str.base|)), 28151#(<= (+ cstrstr_~find.offset 16) (select |#length| cstrstr_~find.base)), 28152#(<= (+ |cstrncmp_#in~s2.offset| 16) (select |#length| |cstrncmp_#in~s2.base|)), 28153#(<= (+ cstrncmp_~s2.offset 16) (select |#length| cstrncmp_~s2.base)), 28154#(<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)), 28155#(<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)), 28156#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 28157#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 28158#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 28159#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base))] [2018-02-04 15:05:20,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 392 proven. 1078 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:20,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 15:05:20,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 15:05:20,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1351, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 15:05:20,284 INFO L87 Difference]: Start difference. First operand 251 states and 300 transitions. Second operand 41 states. [2018-02-04 15:05:21,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:21,451 INFO L93 Difference]: Finished difference Result 395 states and 447 transitions. [2018-02-04 15:05:21,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-02-04 15:05:21,452 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 236 [2018-02-04 15:05:21,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:21,453 INFO L225 Difference]: With dead ends: 395 [2018-02-04 15:05:21,453 INFO L226 Difference]: Without dead ends: 395 [2018-02-04 15:05:21,453 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2197 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1517, Invalid=6493, Unknown=0, NotChecked=0, Total=8010 [2018-02-04 15:05:21,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-02-04 15:05:21,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 259. [2018-02-04 15:05:21,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-02-04 15:05:21,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 310 transitions. [2018-02-04 15:05:21,455 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 310 transitions. Word has length 236 [2018-02-04 15:05:21,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:21,455 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 310 transitions. [2018-02-04 15:05:21,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 15:05:21,456 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 310 transitions. [2018-02-04 15:05:21,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-02-04 15:05:21,456 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:21,456 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:21,456 INFO L371 AbstractCegarLoop]: === Iteration 75 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:05:21,456 INFO L82 PathProgramCache]: Analyzing trace with hash 162283865, now seen corresponding path program 15 times [2018-02-04 15:05:21,457 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:21,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:22,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 392 proven. 1093 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:22,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:22,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-04 15:05:22,344 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:22,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:22,344 INFO L182 omatonBuilderFactory]: Interpolants [28928#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 28929#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 28930#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 28931#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 28932#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 28933#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 28934#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 28935#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 28936#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 28937#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 28938#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 28939#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 28940#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 28941#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 28942#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 28943#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 15) cstrlen_~s~0.offset)), 28944#(<= (+ |cstrlen_#in~str.offset| 16) (select |#length| |cstrlen_#in~str.base|)), 28945#(<= (+ cstrstr_~find.offset 16) (select |#length| cstrstr_~find.base)), 28946#(<= (+ |cstrncmp_#in~s2.offset| 16) (select |#length| |cstrncmp_#in~s2.base|)), 28947#(<= (+ cstrncmp_~s2.offset 16) (select |#length| cstrncmp_~s2.base)), 28948#(<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)), 28949#(<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)), 28950#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 28951#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 28952#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 28953#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 28954#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 28955#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 28956#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 28957#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 28958#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 28959#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 28960#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 28961#(<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)), 28962#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 28963#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 28964#(and (<= 2 cstrncmp_~s2.offset) (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base))), 28965#(and (<= 1 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|))), 28924#true, 28925#false, 28926#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 28927#(= main_~length2~0 (select |#length| main_~nondetString2~0.base))] [2018-02-04 15:05:22,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 392 proven. 1093 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:22,344 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 15:05:22,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 15:05:22,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1431, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 15:05:22,345 INFO L87 Difference]: Start difference. First operand 259 states and 310 transitions. Second operand 42 states. [2018-02-04 15:05:24,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:24,135 INFO L93 Difference]: Finished difference Result 409 states and 463 transitions. [2018-02-04 15:05:24,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-02-04 15:05:24,135 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 240 [2018-02-04 15:05:24,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:24,136 INFO L225 Difference]: With dead ends: 409 [2018-02-04 15:05:24,136 INFO L226 Difference]: Without dead ends: 409 [2018-02-04 15:05:24,137 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3274 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1924, Invalid=9206, Unknown=0, NotChecked=0, Total=11130 [2018-02-04 15:05:24,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-02-04 15:05:24,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 260. [2018-02-04 15:05:24,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-02-04 15:05:24,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 312 transitions. [2018-02-04 15:05:24,139 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 312 transitions. Word has length 240 [2018-02-04 15:05:24,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:24,139 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 312 transitions. [2018-02-04 15:05:24,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 15:05:24,139 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 312 transitions. [2018-02-04 15:05:24,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-02-04 15:05:24,140 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:24,140 INFO L351 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:24,140 INFO L371 AbstractCegarLoop]: === Iteration 76 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:05:24,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1270113934, now seen corresponding path program 29 times [2018-02-04 15:05:24,140 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:24,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:24,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1609 backedges. 195 proven. 1410 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:05:24,795 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:24,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-04 15:05:24,795 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:24,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:24,795 INFO L182 omatonBuilderFactory]: Interpolants [29764#true, 29765#false, 29766#(= cstrlen_~s~0.offset cstrlen_~str.offset), 29767#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 29768#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 29769#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 29770#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 29771#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 29772#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 6)) (<= (+ cstrlen_~str.offset 6) cstrlen_~s~0.offset)), 29773#(and (<= (+ cstrlen_~str.offset 7) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 7))), 29774#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 8)) (<= (+ cstrlen_~str.offset 8) cstrlen_~s~0.offset)), 29775#(and (<= (+ cstrlen_~str.offset 9) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 9))), 29776#(and (<= (+ cstrlen_~str.offset 10) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 10))), 29777#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 11)) (<= (+ cstrlen_~str.offset 11) cstrlen_~s~0.offset)), 29778#(and (<= (+ cstrlen_~str.offset 12) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 12))), 29779#(and (<= (+ cstrlen_~str.offset 13) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 13))), 29780#(and (<= (+ cstrlen_~str.offset 14) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 14))), 29781#(and (<= (+ cstrlen_~str.offset 15) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 15))), 29782#(and (<= 15 |cstrlen_#res|) (<= |cstrlen_#res| 15)), 29783#(and (<= |cstrstr_#t~ret13| 15) (<= 15 |cstrstr_#t~ret13|)), 29784#(and (<= 15 cstrstr_~len~0) (<= cstrstr_~len~0 15)), 29785#(and (<= 15 |cstrncmp_#in~n|) (<= |cstrncmp_#in~n| 15)), 29786#(and (<= cstrncmp_~n 15) (<= 15 cstrncmp_~n)), 29787#(and (<= 14 cstrncmp_~n) (<= cstrncmp_~n 14)), 29788#(and (<= cstrncmp_~n 13) (<= 13 cstrncmp_~n)), 29789#(and (<= 12 cstrncmp_~n) (<= cstrncmp_~n 12)), 29790#(and (<= cstrncmp_~n 11) (<= 11 cstrncmp_~n)), 29791#(and (<= 10 cstrncmp_~n) (<= cstrncmp_~n 10)), 29792#(and (<= 9 cstrncmp_~n) (<= cstrncmp_~n 9)), 29793#(and (<= 8 cstrncmp_~n) (<= cstrncmp_~n 8)), 29794#(and (<= 7 cstrncmp_~n) (<= cstrncmp_~n 7)), 29795#(and (<= cstrncmp_~n 6) (<= 6 cstrncmp_~n)), 29796#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 29797#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 29798#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 29799#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 29800#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 29801#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|))] [2018-02-04 15:05:24,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1609 backedges. 195 proven. 1410 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:05:24,796 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 15:05:24,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 15:05:24,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 15:05:24,796 INFO L87 Difference]: Start difference. First operand 260 states and 312 transitions. Second operand 38 states. [2018-02-04 15:05:25,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:25,744 INFO L93 Difference]: Finished difference Result 523 states and 621 transitions. [2018-02-04 15:05:25,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 15:05:25,744 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 245 [2018-02-04 15:05:25,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:25,745 INFO L225 Difference]: With dead ends: 523 [2018-02-04 15:05:25,745 INFO L226 Difference]: Without dead ends: 265 [2018-02-04 15:05:25,745 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=2829, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 15:05:25,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-02-04 15:05:25,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 264. [2018-02-04 15:05:25,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-02-04 15:05:25,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 316 transitions. [2018-02-04 15:05:25,747 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 316 transitions. Word has length 245 [2018-02-04 15:05:25,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:25,747 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 316 transitions. [2018-02-04 15:05:25,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 15:05:25,747 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 316 transitions. [2018-02-04 15:05:25,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-02-04 15:05:25,748 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:25,748 INFO L351 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:25,748 INFO L371 AbstractCegarLoop]: === Iteration 77 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:05:25,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1678882095, now seen corresponding path program 30 times [2018-02-04 15:05:25,748 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:25,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:26,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1672 backedges. 450 proven. 1222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:26,611 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:26,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-04 15:05:26,611 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:26,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:26,611 INFO L182 omatonBuilderFactory]: Interpolants [30656#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 30657#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 30658#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 30659#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 30660#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 30661#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 30662#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 30663#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 30664#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 30665#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 2 |cstrncmp_#t~post3.offset|)), 30623#true, 30624#false, 30625#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 30626#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 30627#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 30628#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 30629#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 30630#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 30631#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 30632#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 30633#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 30634#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 30635#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 30636#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 30637#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 30638#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 30639#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 30640#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 30641#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 30642#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 15) cstrlen_~s~0.offset)), 30643#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 16) cstrlen_~s~0.offset)), 30644#(<= (+ |cstrlen_#in~str.offset| 17) (select |#length| |cstrlen_#in~str.base|)), 30645#(<= (+ cstrstr_~find.offset 17) (select |#length| cstrstr_~find.base)), 30646#(<= (+ |cstrncmp_#in~s2.offset| 17) (select |#length| |cstrncmp_#in~s2.base|)), 30647#(<= (+ cstrncmp_~s2.offset 17) (select |#length| cstrncmp_~s2.base)), 30648#(<= (+ cstrncmp_~s2.offset 16) (select |#length| cstrncmp_~s2.base)), 30649#(<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)), 30650#(<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)), 30651#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 30652#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 30653#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 30654#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 30655#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base))] [2018-02-04 15:05:26,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1672 backedges. 450 proven. 1222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:26,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 15:05:26,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 15:05:26,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1498, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 15:05:26,612 INFO L87 Difference]: Start difference. First operand 264 states and 316 transitions. Second operand 43 states. [2018-02-04 15:05:28,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:28,026 INFO L93 Difference]: Finished difference Result 415 states and 470 transitions. [2018-02-04 15:05:28,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-02-04 15:05:28,027 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 249 [2018-02-04 15:05:28,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:28,028 INFO L225 Difference]: With dead ends: 415 [2018-02-04 15:05:28,028 INFO L226 Difference]: Without dead ends: 415 [2018-02-04 15:05:28,028 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2410 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1574, Invalid=7168, Unknown=0, NotChecked=0, Total=8742 [2018-02-04 15:05:28,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-02-04 15:05:28,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 272. [2018-02-04 15:05:28,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-02-04 15:05:28,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 326 transitions. [2018-02-04 15:05:28,031 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 326 transitions. Word has length 249 [2018-02-04 15:05:28,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:28,031 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 326 transitions. [2018-02-04 15:05:28,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 15:05:28,031 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 326 transitions. [2018-02-04 15:05:28,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-02-04 15:05:28,032 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:28,032 INFO L351 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:28,032 INFO L371 AbstractCegarLoop]: === Iteration 78 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:05:28,032 INFO L82 PathProgramCache]: Analyzing trace with hash 323031571, now seen corresponding path program 16 times [2018-02-04 15:05:28,033 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:28,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:28,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1688 backedges. 450 proven. 1238 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:28,908 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:28,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-04 15:05:28,909 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:28,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:28,909 INFO L182 omatonBuilderFactory]: Interpolants [31488#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 31489#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 31490#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 31491#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 31492#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 31493#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 31494#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 31495#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 31496#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 31497#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 31498#(and (<= 3 cstrncmp_~s2.offset) (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base))), 31499#(and (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|)) (<= 2 |cstrncmp_#t~pre6.offset|)), 31456#true, 31457#false, 31458#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 31459#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 31460#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 31461#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 31462#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 31463#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 31464#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 31465#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 31466#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 31467#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 31468#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 31469#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 31470#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 31471#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 31472#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 31473#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 31474#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 31475#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 15) cstrlen_~s~0.offset)), 31476#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 16) cstrlen_~s~0.offset)), 31477#(<= (+ |cstrlen_#in~str.offset| 17) (select |#length| |cstrlen_#in~str.base|)), 31478#(<= (+ cstrstr_~find.offset 17) (select |#length| cstrstr_~find.base)), 31479#(<= (+ |cstrncmp_#in~s2.offset| 17) (select |#length| |cstrncmp_#in~s2.base|)), 31480#(<= (+ cstrncmp_~s2.offset 17) (select |#length| cstrncmp_~s2.base)), 31481#(<= (+ cstrncmp_~s2.offset 16) (select |#length| cstrncmp_~s2.base)), 31482#(<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)), 31483#(<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)), 31484#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 31485#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 31486#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 31487#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base))] [2018-02-04 15:05:28,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1688 backedges. 450 proven. 1238 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:28,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 15:05:28,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 15:05:28,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1582, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 15:05:28,909 INFO L87 Difference]: Start difference. First operand 272 states and 326 transitions. Second operand 44 states. [2018-02-04 15:05:30,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:30,650 INFO L93 Difference]: Finished difference Result 429 states and 486 transitions. [2018-02-04 15:05:30,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-02-04 15:05:30,651 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 253 [2018-02-04 15:05:30,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:30,652 INFO L225 Difference]: With dead ends: 429 [2018-02-04 15:05:30,652 INFO L226 Difference]: Without dead ends: 429 [2018-02-04 15:05:30,652 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3467 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1960, Invalid=9812, Unknown=0, NotChecked=0, Total=11772 [2018-02-04 15:05:30,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-02-04 15:05:30,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 273. [2018-02-04 15:05:30,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-02-04 15:05:30,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 328 transitions. [2018-02-04 15:05:30,655 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 328 transitions. Word has length 253 [2018-02-04 15:05:30,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:30,655 INFO L432 AbstractCegarLoop]: Abstraction has 273 states and 328 transitions. [2018-02-04 15:05:30,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 15:05:30,655 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 328 transitions. [2018-02-04 15:05:30,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-02-04 15:05:30,655 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:30,655 INFO L351 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:30,655 INFO L371 AbstractCegarLoop]: === Iteration 79 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:05:30,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1275525652, now seen corresponding path program 31 times [2018-02-04 15:05:30,656 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:30,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:31,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 208 proven. 1608 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:05:31,348 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:31,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-04 15:05:31,348 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:31,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:31,349 INFO L182 omatonBuilderFactory]: Interpolants [32333#true, 32334#false, 32335#(= cstrlen_~s~0.offset cstrlen_~str.offset), 32336#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 32337#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 32338#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 32339#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 32340#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 32341#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 6)) (<= (+ cstrlen_~str.offset 6) cstrlen_~s~0.offset)), 32342#(and (<= (+ cstrlen_~str.offset 7) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 7))), 32343#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 8)) (<= (+ cstrlen_~str.offset 8) cstrlen_~s~0.offset)), 32344#(and (<= (+ cstrlen_~str.offset 9) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 9))), 32345#(and (<= (+ cstrlen_~str.offset 10) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 10))), 32346#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 11)) (<= (+ cstrlen_~str.offset 11) cstrlen_~s~0.offset)), 32347#(and (<= (+ cstrlen_~str.offset 12) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 12))), 32348#(and (<= (+ cstrlen_~str.offset 13) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 13))), 32349#(and (<= (+ cstrlen_~str.offset 14) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 14))), 32350#(and (<= (+ cstrlen_~str.offset 15) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 15))), 32351#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 16)) (<= (+ cstrlen_~str.offset 16) cstrlen_~s~0.offset)), 32352#(and (<= 16 |cstrlen_#res|) (<= |cstrlen_#res| 16)), 32353#(and (<= |cstrstr_#t~ret13| 16) (<= 16 |cstrstr_#t~ret13|)), 32354#(and (<= cstrstr_~len~0 16) (<= 16 cstrstr_~len~0)), 32355#(and (<= |cstrncmp_#in~n| 16) (<= 16 |cstrncmp_#in~n|)), 32356#(and (<= cstrncmp_~n 16) (<= 16 cstrncmp_~n)), 32357#(and (<= cstrncmp_~n 15) (<= 15 cstrncmp_~n)), 32358#(and (<= 14 cstrncmp_~n) (<= cstrncmp_~n 14)), 32359#(and (<= cstrncmp_~n 13) (<= 13 cstrncmp_~n)), 32360#(and (<= 12 cstrncmp_~n) (<= cstrncmp_~n 12)), 32361#(and (<= cstrncmp_~n 11) (<= 11 cstrncmp_~n)), 32362#(and (<= 10 cstrncmp_~n) (<= cstrncmp_~n 10)), 32363#(and (<= 9 cstrncmp_~n) (<= cstrncmp_~n 9)), 32364#(and (<= 8 cstrncmp_~n) (<= cstrncmp_~n 8)), 32365#(and (<= 7 cstrncmp_~n) (<= cstrncmp_~n 7)), 32366#(and (<= cstrncmp_~n 6) (<= 6 cstrncmp_~n)), 32367#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 32368#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 32369#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 32370#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 32371#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 32372#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|))] [2018-02-04 15:05:31,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 208 proven. 1608 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:05:31,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 15:05:31,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 15:05:31,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 15:05:31,349 INFO L87 Difference]: Start difference. First operand 273 states and 328 transitions. Second operand 40 states. [2018-02-04 15:05:32,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:32,453 INFO L93 Difference]: Finished difference Result 552 states and 656 transitions. [2018-02-04 15:05:32,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 15:05:32,453 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 258 [2018-02-04 15:05:32,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:32,454 INFO L225 Difference]: With dead ends: 552 [2018-02-04 15:05:32,454 INFO L226 Difference]: Without dead ends: 278 [2018-02-04 15:05:32,454 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=149, Invalid=3157, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 15:05:32,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-02-04 15:05:32,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2018-02-04 15:05:32,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-02-04 15:05:32,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 332 transitions. [2018-02-04 15:05:32,456 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 332 transitions. Word has length 258 [2018-02-04 15:05:32,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:32,456 INFO L432 AbstractCegarLoop]: Abstraction has 277 states and 332 transitions. [2018-02-04 15:05:32,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 15:05:32,456 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 332 transitions. [2018-02-04 15:05:32,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-02-04 15:05:32,457 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:32,457 INFO L351 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:32,457 INFO L371 AbstractCegarLoop]: === Iteration 80 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:05:32,457 INFO L82 PathProgramCache]: Analyzing trace with hash -2062853455, now seen corresponding path program 32 times [2018-02-04 15:05:32,457 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:32,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:33,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1887 backedges. 512 proven. 1375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:33,396 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:33,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-04 15:05:33,396 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:33,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:33,396 INFO L182 omatonBuilderFactory]: Interpolants [33280#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 33281#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 33282#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 1 |cstrncmp_#t~post3.offset|)), 33238#true, 33239#false, 33240#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 33241#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 33242#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 33243#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 33244#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 33245#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 33246#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 33247#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 33248#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 33249#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 33250#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 33251#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 33252#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 33253#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 33254#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 33255#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 33256#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 33257#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 15) cstrlen_~s~0.offset)), 33258#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 16) cstrlen_~s~0.offset)), 33259#(and (<= (+ |cstrlen_#in~str.offset| 17) cstrlen_~s~0.offset) (= cstrlen_~s~0.base |cstrlen_#in~str.base|)), 33260#(<= (+ |cstrlen_#in~str.offset| 18) (select |#length| |cstrlen_#in~str.base|)), 33261#(<= (+ cstrstr_~find.offset 18) (select |#length| cstrstr_~find.base)), 33262#(<= (+ |cstrncmp_#in~s2.offset| 18) (select |#length| |cstrncmp_#in~s2.base|)), 33263#(<= (+ cstrncmp_~s2.offset 18) (select |#length| cstrncmp_~s2.base)), 33264#(<= (+ cstrncmp_~s2.offset 17) (select |#length| cstrncmp_~s2.base)), 33265#(<= (+ cstrncmp_~s2.offset 16) (select |#length| cstrncmp_~s2.base)), 33266#(<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)), 33267#(<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)), 33268#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 33269#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 33270#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 33271#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 33272#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 33273#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 33274#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 33275#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 33276#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 33277#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 33278#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 33279#(<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base))] [2018-02-04 15:05:33,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1887 backedges. 512 proven. 1375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:33,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 15:05:33,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 15:05:33,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=1621, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 15:05:33,397 INFO L87 Difference]: Start difference. First operand 277 states and 332 transitions. Second operand 45 states. [2018-02-04 15:05:34,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:34,892 INFO L93 Difference]: Finished difference Result 439 states and 497 transitions. [2018-02-04 15:05:34,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-02-04 15:05:34,893 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 262 [2018-02-04 15:05:34,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:34,894 INFO L225 Difference]: With dead ends: 439 [2018-02-04 15:05:34,894 INFO L226 Difference]: Without dead ends: 439 [2018-02-04 15:05:34,894 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2780 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1902, Invalid=7998, Unknown=0, NotChecked=0, Total=9900 [2018-02-04 15:05:34,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-02-04 15:05:34,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 285. [2018-02-04 15:05:34,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-02-04 15:05:34,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 342 transitions. [2018-02-04 15:05:34,897 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 342 transitions. Word has length 262 [2018-02-04 15:05:34,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:34,897 INFO L432 AbstractCegarLoop]: Abstraction has 285 states and 342 transitions. [2018-02-04 15:05:34,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 15:05:34,897 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 342 transitions. [2018-02-04 15:05:34,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-02-04 15:05:34,898 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:34,898 INFO L351 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:34,898 INFO L371 AbstractCegarLoop]: === Iteration 81 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:05:34,898 INFO L82 PathProgramCache]: Analyzing trace with hash 93532659, now seen corresponding path program 17 times [2018-02-04 15:05:34,899 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:34,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:36,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1904 backedges. 512 proven. 1392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:36,009 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:36,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-04 15:05:36,009 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:36,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-04 15:05:36,010 INFO L182 omatonBuilderFactory]: Interpolants [34118#true, 34119#false, 34120#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 34121#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 34122#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 34123#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 34124#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 34125#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 34126#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 34127#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 34128#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 34129#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 34130#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 34131#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 34132#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 34133#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 34134#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 34135#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 34136#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 34137#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 15) cstrlen_~s~0.offset)), 34138#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 16) cstrlen_~s~0.offset)), 34139#(and (<= (+ |cstrlen_#in~str.offset| 17) cstrlen_~s~0.offset) (= cstrlen_~s~0.base |cstrlen_#in~str.base|)), 34140#(<= (+ |cstrlen_#in~str.offset| 18) (select |#length| |cstrlen_#in~str.base|)), 34141#(<= (+ cstrstr_~find.offset 18) (select |#length| cstrstr_~find.base)), 34142#(<= (+ |cstrncmp_#in~s2.offset| 18) (select |#length| |cstrncmp_#in~s2.base|)), 34143#(<= (+ cstrncmp_~s2.offset 18) (select |#length| cstrncmp_~s2.base)), 34144#(<= (+ cstrncmp_~s2.offset 17) (select |#length| cstrncmp_~s2.base)), 34145#(<= (+ cstrncmp_~s2.offset 16) (select |#length| cstrncmp_~s2.base)), 34146#(<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)), 34147#(<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)), 34148#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 34149#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 34150#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 34151#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 34152#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 34153#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 34154#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 34155#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 34156#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 34157#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 34158#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 34159#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 34160#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 2 cstrncmp_~s2.offset)), 34161#(and (<= 3 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 34162#(and (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base)) (<= 4 cstrncmp_~s2.offset)), 34163#(and (<= 3 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|)))] [2018-02-04 15:05:36,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1904 backedges. 512 proven. 1392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:36,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 15:05:36,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 15:05:36,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=1740, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 15:05:36,011 INFO L87 Difference]: Start difference. First operand 285 states and 342 transitions. Second operand 46 states. [2018-02-04 15:05:38,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:38,100 INFO L93 Difference]: Finished difference Result 449 states and 509 transitions. [2018-02-04 15:05:38,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-02-04 15:05:38,100 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 266 [2018-02-04 15:05:38,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:38,101 INFO L225 Difference]: With dead ends: 449 [2018-02-04 15:05:38,101 INFO L226 Difference]: Without dead ends: 449 [2018-02-04 15:05:38,102 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3665 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1995, Invalid=10437, Unknown=0, NotChecked=0, Total=12432 [2018-02-04 15:05:38,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-02-04 15:05:38,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 286. [2018-02-04 15:05:38,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-02-04 15:05:38,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 344 transitions. [2018-02-04 15:05:38,104 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 344 transitions. Word has length 266 [2018-02-04 15:05:38,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:38,104 INFO L432 AbstractCegarLoop]: Abstraction has 286 states and 344 transitions. [2018-02-04 15:05:38,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 15:05:38,104 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 344 transitions. [2018-02-04 15:05:38,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-02-04 15:05:38,105 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:38,105 INFO L351 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:38,105 INFO L371 AbstractCegarLoop]: === Iteration 82 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:05:38,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1634584116, now seen corresponding path program 33 times [2018-02-04 15:05:38,106 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:38,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:38,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2044 backedges. 221 proven. 1819 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:05:38,868 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:38,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-04 15:05:38,868 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:38,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:38,869 INFO L182 omatonBuilderFactory]: Interpolants [35072#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 35073#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|)), 35032#true, 35033#false, 35034#(= cstrlen_~s~0.offset cstrlen_~str.offset), 35035#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 35036#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 35037#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 35038#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 35039#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 35040#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 6)) (<= (+ cstrlen_~str.offset 6) cstrlen_~s~0.offset)), 35041#(and (<= (+ cstrlen_~str.offset 7) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 7))), 35042#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 8)) (<= (+ cstrlen_~str.offset 8) cstrlen_~s~0.offset)), 35043#(and (<= (+ cstrlen_~str.offset 9) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 9))), 35044#(and (<= (+ cstrlen_~str.offset 10) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 10))), 35045#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 11)) (<= (+ cstrlen_~str.offset 11) cstrlen_~s~0.offset)), 35046#(and (<= (+ cstrlen_~str.offset 12) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 12))), 35047#(and (<= (+ cstrlen_~str.offset 13) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 13))), 35048#(and (<= (+ cstrlen_~str.offset 14) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 14))), 35049#(and (<= (+ cstrlen_~str.offset 15) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 15))), 35050#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 16)) (<= (+ cstrlen_~str.offset 16) cstrlen_~s~0.offset)), 35051#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 17)) (<= (+ cstrlen_~str.offset 17) cstrlen_~s~0.offset)), 35052#(and (<= |cstrlen_#res| 17) (<= 17 |cstrlen_#res|)), 35053#(and (<= 17 |cstrstr_#t~ret13|) (<= |cstrstr_#t~ret13| 17)), 35054#(and (<= 17 cstrstr_~len~0) (<= cstrstr_~len~0 17)), 35055#(and (<= |cstrncmp_#in~n| 17) (<= 17 |cstrncmp_#in~n|)), 35056#(and (<= cstrncmp_~n 17) (<= 17 cstrncmp_~n)), 35057#(and (<= cstrncmp_~n 16) (<= 16 cstrncmp_~n)), 35058#(and (<= cstrncmp_~n 15) (<= 15 cstrncmp_~n)), 35059#(and (<= 14 cstrncmp_~n) (<= cstrncmp_~n 14)), 35060#(and (<= cstrncmp_~n 13) (<= 13 cstrncmp_~n)), 35061#(and (<= 12 cstrncmp_~n) (<= cstrncmp_~n 12)), 35062#(and (<= cstrncmp_~n 11) (<= 11 cstrncmp_~n)), 35063#(and (<= 10 cstrncmp_~n) (<= cstrncmp_~n 10)), 35064#(and (<= 9 cstrncmp_~n) (<= cstrncmp_~n 9)), 35065#(and (<= 8 cstrncmp_~n) (<= cstrncmp_~n 8)), 35066#(and (<= 7 cstrncmp_~n) (<= cstrncmp_~n 7)), 35067#(and (<= cstrncmp_~n 6) (<= 6 cstrncmp_~n)), 35068#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 35069#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 35070#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 35071#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2))] [2018-02-04 15:05:38,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2044 backedges. 221 proven. 1819 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:05:38,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 15:05:38,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 15:05:38,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 15:05:38,869 INFO L87 Difference]: Start difference. First operand 286 states and 344 transitions. Second operand 42 states. [2018-02-04 15:05:40,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:40,036 INFO L93 Difference]: Finished difference Result 581 states and 691 transitions. [2018-02-04 15:05:40,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 15:05:40,036 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 271 [2018-02-04 15:05:40,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:40,037 INFO L225 Difference]: With dead ends: 581 [2018-02-04 15:05:40,037 INFO L226 Difference]: Without dead ends: 291 [2018-02-04 15:05:40,038 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=157, Invalid=3503, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 15:05:40,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-02-04 15:05:40,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 290. [2018-02-04 15:05:40,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-02-04 15:05:40,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 348 transitions. [2018-02-04 15:05:40,039 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 348 transitions. Word has length 271 [2018-02-04 15:05:40,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:40,039 INFO L432 AbstractCegarLoop]: Abstraction has 290 states and 348 transitions. [2018-02-04 15:05:40,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 15:05:40,040 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 348 transitions. [2018-02-04 15:05:40,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-02-04 15:05:40,040 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:40,040 INFO L351 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:40,040 INFO L371 AbstractCegarLoop]: === Iteration 83 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:05:40,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1618342729, now seen corresponding path program 34 times [2018-02-04 15:05:40,041 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:40,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:41,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2115 backedges. 578 proven. 1537 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:41,054 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:41,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-04 15:05:41,054 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:41,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:41,054 INFO L182 omatonBuilderFactory]: Interpolants [35983#true, 35984#false, 35985#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 35986#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 35987#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 35988#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 35989#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 35990#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 35991#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 35992#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 35993#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 35994#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 35995#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 35996#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 35997#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 35998#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 35999#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 36000#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 36001#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 36002#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 15) cstrlen_~s~0.offset)), 36003#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 16) cstrlen_~s~0.offset)), 36004#(and (<= (+ |cstrlen_#in~str.offset| 17) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 36005#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 18) cstrlen_~s~0.offset)), 36006#(<= (+ |cstrlen_#in~str.offset| 19) (select |#length| |cstrlen_#in~str.base|)), 36007#(<= (+ cstrstr_~find.offset 19) (select |#length| cstrstr_~find.base)), 36008#(<= (+ |cstrncmp_#in~s2.offset| 19) (select |#length| |cstrncmp_#in~s2.base|)), 36009#(<= (+ cstrncmp_~s2.offset 19) (select |#length| cstrncmp_~s2.base)), 36010#(<= (+ cstrncmp_~s2.offset 18) (select |#length| cstrncmp_~s2.base)), 36011#(<= (+ cstrncmp_~s2.offset 17) (select |#length| cstrncmp_~s2.base)), 36012#(<= (+ cstrncmp_~s2.offset 16) (select |#length| cstrncmp_~s2.base)), 36013#(<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)), 36014#(<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)), 36015#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 36016#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 36017#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 36018#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 36019#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 36020#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 36021#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 36022#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 36023#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 36024#(and (<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 36025#(and (<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 36026#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 2 cstrncmp_~s2.offset)), 36027#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 3 cstrncmp_~s2.offset)), 36028#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 4 cstrncmp_~s2.offset)), 36029#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 4 |cstrncmp_#t~post3.offset|))] [2018-02-04 15:05:41,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2115 backedges. 578 proven. 1537 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:41,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 15:05:41,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 15:05:41,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1813, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 15:05:41,055 INFO L87 Difference]: Start difference. First operand 290 states and 348 transitions. Second operand 47 states. [2018-02-04 15:05:42,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:42,920 INFO L93 Difference]: Finished difference Result 455 states and 516 transitions. [2018-02-04 15:05:42,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-02-04 15:05:42,920 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 275 [2018-02-04 15:05:42,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:42,922 INFO L225 Difference]: With dead ends: 455 [2018-02-04 15:05:42,922 INFO L226 Difference]: Without dead ends: 455 [2018-02-04 15:05:42,923 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2894 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1691, Invalid=8611, Unknown=0, NotChecked=0, Total=10302 [2018-02-04 15:05:42,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-02-04 15:05:42,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 298. [2018-02-04 15:05:42,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-02-04 15:05:42,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 358 transitions. [2018-02-04 15:05:42,925 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 358 transitions. Word has length 275 [2018-02-04 15:05:42,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:42,925 INFO L432 AbstractCegarLoop]: Abstraction has 298 states and 358 transitions. [2018-02-04 15:05:42,925 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 15:05:42,925 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 358 transitions. [2018-02-04 15:05:42,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-02-04 15:05:42,926 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:42,926 INFO L351 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:42,926 INFO L371 AbstractCegarLoop]: === Iteration 84 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:05:42,926 INFO L82 PathProgramCache]: Analyzing trace with hash 2109567225, now seen corresponding path program 18 times [2018-02-04 15:05:42,926 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:42,945 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:44,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2133 backedges. 578 proven. 1555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:44,004 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:44,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-02-04 15:05:44,004 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:44,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:44,004 INFO L182 omatonBuilderFactory]: Interpolants [36928#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 36929#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 36930#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 36931#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 36932#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 36933#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 36934#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 36935#(and (<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 36936#(and (<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 36937#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 2 cstrncmp_~s2.offset)), 36938#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 3 cstrncmp_~s2.offset)), 36939#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 4 cstrncmp_~s2.offset)), 36940#(and (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base)) (<= 5 cstrncmp_~s2.offset)), 36941#(and (<= 4 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|))), 36894#true, 36895#false, 36896#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 36897#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 36898#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 36899#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 36900#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 36901#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 36902#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 36903#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 36904#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 36905#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 36906#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 36907#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 36908#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 36909#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 36910#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 36911#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 36912#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 36913#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 15) cstrlen_~s~0.offset)), 36914#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 16) cstrlen_~s~0.offset)), 36915#(and (<= (+ |cstrlen_#in~str.offset| 17) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 36916#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 18) cstrlen_~s~0.offset)), 36917#(<= (+ |cstrlen_#in~str.offset| 19) (select |#length| |cstrlen_#in~str.base|)), 36918#(<= (+ cstrstr_~find.offset 19) (select |#length| cstrstr_~find.base)), 36919#(<= (+ |cstrncmp_#in~s2.offset| 19) (select |#length| |cstrncmp_#in~s2.base|)), 36920#(<= (+ cstrncmp_~s2.offset 19) (select |#length| cstrncmp_~s2.base)), 36921#(<= (+ cstrncmp_~s2.offset 18) (select |#length| cstrncmp_~s2.base)), 36922#(<= (+ cstrncmp_~s2.offset 17) (select |#length| cstrncmp_~s2.base)), 36923#(<= (+ cstrncmp_~s2.offset 16) (select |#length| cstrncmp_~s2.base)), 36924#(<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)), 36925#(<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)), 36926#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 36927#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base))] [2018-02-04 15:05:44,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2133 backedges. 578 proven. 1555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:44,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 15:05:44,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 15:05:44,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=1905, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 15:05:44,005 INFO L87 Difference]: Start difference. First operand 298 states and 358 transitions. Second operand 48 states. [2018-02-04 15:05:46,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:46,097 INFO L93 Difference]: Finished difference Result 469 states and 532 transitions. [2018-02-04 15:05:46,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-02-04 15:05:46,097 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 279 [2018-02-04 15:05:46,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:46,098 INFO L225 Difference]: With dead ends: 469 [2018-02-04 15:05:46,098 INFO L226 Difference]: Without dead ends: 469 [2018-02-04 15:05:46,099 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3868 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2029, Invalid=11081, Unknown=0, NotChecked=0, Total=13110 [2018-02-04 15:05:46,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-02-04 15:05:46,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 299. [2018-02-04 15:05:46,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-02-04 15:05:46,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 360 transitions. [2018-02-04 15:05:46,101 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 360 transitions. Word has length 279 [2018-02-04 15:05:46,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:46,101 INFO L432 AbstractCegarLoop]: Abstraction has 299 states and 360 transitions. [2018-02-04 15:05:46,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 15:05:46,101 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 360 transitions. [2018-02-04 15:05:46,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-02-04 15:05:46,102 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:46,102 INFO L351 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:46,102 INFO L371 AbstractCegarLoop]: === Iteration 85 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:05:46,102 INFO L82 PathProgramCache]: Analyzing trace with hash -15729938, now seen corresponding path program 35 times [2018-02-04 15:05:46,102 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:46,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:46,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2281 backedges. 234 proven. 2043 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:05:46,950 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:46,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-04 15:05:46,951 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:46,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:46,951 INFO L182 omatonBuilderFactory]: Interpolants [37888#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|)), 37845#true, 37846#false, 37847#(= cstrlen_~s~0.offset cstrlen_~str.offset), 37848#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 37849#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 37850#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 37851#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 37852#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 37853#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 6)) (<= (+ cstrlen_~str.offset 6) cstrlen_~s~0.offset)), 37854#(and (<= (+ cstrlen_~str.offset 7) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 7))), 37855#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 8)) (<= (+ cstrlen_~str.offset 8) cstrlen_~s~0.offset)), 37856#(and (<= (+ cstrlen_~str.offset 9) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 9))), 37857#(and (<= (+ cstrlen_~str.offset 10) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 10))), 37858#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 11)) (<= (+ cstrlen_~str.offset 11) cstrlen_~s~0.offset)), 37859#(and (<= (+ cstrlen_~str.offset 12) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 12))), 37860#(and (<= (+ cstrlen_~str.offset 13) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 13))), 37861#(and (<= (+ cstrlen_~str.offset 14) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 14))), 37862#(and (<= (+ cstrlen_~str.offset 15) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 15))), 37863#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 16)) (<= (+ cstrlen_~str.offset 16) cstrlen_~s~0.offset)), 37864#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 17)) (<= (+ cstrlen_~str.offset 17) cstrlen_~s~0.offset)), 37865#(and (<= (+ cstrlen_~str.offset 18) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 18))), 37866#(and (<= |cstrlen_#res| 18) (<= 18 |cstrlen_#res|)), 37867#(and (<= 18 |cstrstr_#t~ret13|) (<= |cstrstr_#t~ret13| 18)), 37868#(and (<= 18 cstrstr_~len~0) (<= cstrstr_~len~0 18)), 37869#(and (<= |cstrncmp_#in~n| 18) (<= 18 |cstrncmp_#in~n|)), 37870#(and (<= 18 cstrncmp_~n) (<= cstrncmp_~n 18)), 37871#(and (<= cstrncmp_~n 17) (<= 17 cstrncmp_~n)), 37872#(and (<= cstrncmp_~n 16) (<= 16 cstrncmp_~n)), 37873#(and (<= cstrncmp_~n 15) (<= 15 cstrncmp_~n)), 37874#(and (<= 14 cstrncmp_~n) (<= cstrncmp_~n 14)), 37875#(and (<= cstrncmp_~n 13) (<= 13 cstrncmp_~n)), 37876#(and (<= 12 cstrncmp_~n) (<= cstrncmp_~n 12)), 37877#(and (<= cstrncmp_~n 11) (<= 11 cstrncmp_~n)), 37878#(and (<= 10 cstrncmp_~n) (<= cstrncmp_~n 10)), 37879#(and (<= 9 cstrncmp_~n) (<= cstrncmp_~n 9)), 37880#(and (<= 8 cstrncmp_~n) (<= cstrncmp_~n 8)), 37881#(and (<= 7 cstrncmp_~n) (<= cstrncmp_~n 7)), 37882#(and (<= cstrncmp_~n 6) (<= 6 cstrncmp_~n)), 37883#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 37884#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 37885#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 37886#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 37887#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n))] [2018-02-04 15:05:46,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2281 backedges. 234 proven. 2043 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:05:46,951 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 15:05:46,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 15:05:46,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 15:05:46,952 INFO L87 Difference]: Start difference. First operand 299 states and 360 transitions. Second operand 44 states. [2018-02-04 15:05:48,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:48,222 INFO L93 Difference]: Finished difference Result 610 states and 726 transitions. [2018-02-04 15:05:48,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 15:05:48,223 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 284 [2018-02-04 15:05:48,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:48,223 INFO L225 Difference]: With dead ends: 610 [2018-02-04 15:05:48,223 INFO L226 Difference]: Without dead ends: 304 [2018-02-04 15:05:48,224 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=165, Invalid=3867, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 15:05:48,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-02-04 15:05:48,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 303. [2018-02-04 15:05:48,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-02-04 15:05:48,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 364 transitions. [2018-02-04 15:05:48,225 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 364 transitions. Word has length 284 [2018-02-04 15:05:48,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:48,226 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 364 transitions. [2018-02-04 15:05:48,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 15:05:48,226 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 364 transitions. [2018-02-04 15:05:48,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-02-04 15:05:48,226 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:48,226 INFO L351 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:48,226 INFO L371 AbstractCegarLoop]: === Iteration 86 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:05:48,227 INFO L82 PathProgramCache]: Analyzing trace with hash -938237621, now seen corresponding path program 36 times [2018-02-04 15:05:48,227 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:48,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:49,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 648 proven. 1708 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:49,349 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:49,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-04 15:05:49,349 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:49,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:49,349 INFO L182 omatonBuilderFactory]: Interpolants [38842#true, 38843#false, 38844#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 38845#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 38846#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 38847#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 38848#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 38849#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 38850#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 38851#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 38852#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 38853#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 38854#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 38855#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 38856#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 38857#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 38858#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 38859#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 38860#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 38861#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 15) cstrlen_~s~0.offset)), 38862#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 16) cstrlen_~s~0.offset)), 38863#(and (<= (+ |cstrlen_#in~str.offset| 17) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 38864#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 18) cstrlen_~s~0.offset)), 38865#(and (<= (+ |cstrlen_#in~str.offset| 19) cstrlen_~s~0.offset) (= cstrlen_~s~0.base |cstrlen_#in~str.base|)), 38866#(<= (+ |cstrlen_#in~str.offset| 20) (select |#length| |cstrlen_#in~str.base|)), 38867#(<= (+ cstrstr_~find.offset 20) (select |#length| cstrstr_~find.base)), 38868#(<= (+ |cstrncmp_#in~s2.offset| 20) (select |#length| |cstrncmp_#in~s2.base|)), 38869#(<= (+ cstrncmp_~s2.offset 20) (select |#length| cstrncmp_~s2.base)), 38870#(<= (+ cstrncmp_~s2.offset 19) (select |#length| cstrncmp_~s2.base)), 38871#(<= (+ cstrncmp_~s2.offset 18) (select |#length| cstrncmp_~s2.base)), 38872#(<= (+ cstrncmp_~s2.offset 17) (select |#length| cstrncmp_~s2.base)), 38873#(<= (+ cstrncmp_~s2.offset 16) (select |#length| cstrncmp_~s2.base)), 38874#(<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)), 38875#(<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)), 38876#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 38877#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 38878#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 38879#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 38880#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 38881#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 38882#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 38883#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 38884#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 38885#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 38886#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 38887#(<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)), 38888#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 38889#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 38890#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 1 |cstrncmp_#t~post3.offset|))] [2018-02-04 15:05:49,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 648 proven. 1708 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:49,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 15:05:49,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 15:05:49,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=1915, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 15:05:49,350 INFO L87 Difference]: Start difference. First operand 303 states and 364 transitions. Second operand 49 states. [2018-02-04 15:05:51,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:51,039 INFO L93 Difference]: Finished difference Result 483 states and 547 transitions. [2018-02-04 15:05:51,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-02-04 15:05:51,040 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 288 [2018-02-04 15:05:51,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:51,041 INFO L225 Difference]: With dead ends: 483 [2018-02-04 15:05:51,041 INFO L226 Difference]: Without dead ends: 483 [2018-02-04 15:05:51,041 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3431 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2331, Invalid=9659, Unknown=0, NotChecked=0, Total=11990 [2018-02-04 15:05:51,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-02-04 15:05:51,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 311. [2018-02-04 15:05:51,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-02-04 15:05:51,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 374 transitions. [2018-02-04 15:05:51,044 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 374 transitions. Word has length 288 [2018-02-04 15:05:51,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:51,044 INFO L432 AbstractCegarLoop]: Abstraction has 311 states and 374 transitions. [2018-02-04 15:05:51,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 15:05:51,045 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 374 transitions. [2018-02-04 15:05:51,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-02-04 15:05:51,045 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:51,045 INFO L351 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:51,046 INFO L371 AbstractCegarLoop]: === Iteration 87 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:05:51,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1736612749, now seen corresponding path program 19 times [2018-02-04 15:05:51,046 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:51,069 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:52,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2375 backedges. 648 proven. 1727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:52,306 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:52,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-04 15:05:52,306 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:52,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:52,306 INFO L182 omatonBuilderFactory]: Interpolants [39808#true, 39809#false, 39810#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 39811#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 39812#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 39813#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 39814#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 39815#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 39816#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 39817#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 39818#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 39819#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 39820#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 39821#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 39822#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 39823#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 39824#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 39825#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 39826#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 39827#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 15) cstrlen_~s~0.offset)), 39828#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 16) cstrlen_~s~0.offset)), 39829#(and (<= (+ |cstrlen_#in~str.offset| 17) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 39830#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 18) cstrlen_~s~0.offset)), 39831#(and (<= (+ |cstrlen_#in~str.offset| 19) cstrlen_~s~0.offset) (= cstrlen_~s~0.base |cstrlen_#in~str.base|)), 39832#(<= (+ |cstrlen_#in~str.offset| 20) (select |#length| |cstrlen_#in~str.base|)), 39833#(<= (+ cstrstr_~find.offset 20) (select |#length| cstrstr_~find.base)), 39834#(<= (+ |cstrncmp_#in~s2.offset| 20) (select |#length| |cstrncmp_#in~s2.base|)), 39835#(<= (+ cstrncmp_~s2.offset 20) (select |#length| cstrncmp_~s2.base)), 39836#(<= (+ cstrncmp_~s2.offset 19) (select |#length| cstrncmp_~s2.base)), 39837#(<= (+ cstrncmp_~s2.offset 18) (select |#length| cstrncmp_~s2.base)), 39838#(<= (+ cstrncmp_~s2.offset 17) (select |#length| cstrncmp_~s2.base)), 39839#(<= (+ cstrncmp_~s2.offset 16) (select |#length| cstrncmp_~s2.base)), 39840#(<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)), 39841#(<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)), 39842#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 39843#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 39844#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 39845#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 39846#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 39847#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 39848#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 39849#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 39850#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 39851#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 39852#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 39853#(<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)), 39854#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 39855#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 39856#(and (<= 2 cstrncmp_~s2.offset) (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base))), 39857#(and (<= 1 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|)))] [2018-02-04 15:05:52,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2375 backedges. 648 proven. 1727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:52,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 15:05:52,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 15:05:52,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=2011, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 15:05:52,307 INFO L87 Difference]: Start difference. First operand 311 states and 374 transitions. Second operand 50 states. [2018-02-04 15:05:54,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:54,761 INFO L93 Difference]: Finished difference Result 497 states and 563 transitions. [2018-02-04 15:05:54,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-02-04 15:05:54,761 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 292 [2018-02-04 15:05:54,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:54,762 INFO L225 Difference]: With dead ends: 497 [2018-02-04 15:05:54,763 INFO L226 Difference]: Without dead ends: 497 [2018-02-04 15:05:54,764 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5138 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2960, Invalid=13810, Unknown=0, NotChecked=0, Total=16770 [2018-02-04 15:05:54,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2018-02-04 15:05:54,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 312. [2018-02-04 15:05:54,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-02-04 15:05:54,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 376 transitions. [2018-02-04 15:05:54,766 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 376 transitions. Word has length 292 [2018-02-04 15:05:54,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:54,767 INFO L432 AbstractCegarLoop]: Abstraction has 312 states and 376 transitions. [2018-02-04 15:05:54,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 15:05:54,767 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 376 transitions. [2018-02-04 15:05:54,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-02-04 15:05:54,767 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:54,768 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:54,768 INFO L371 AbstractCegarLoop]: === Iteration 88 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:05:54,768 INFO L82 PathProgramCache]: Analyzing trace with hash 276974810, now seen corresponding path program 37 times [2018-02-04 15:05:54,768 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:54,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:55,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2531 backedges. 247 proven. 2280 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:05:55,719 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:55,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-04 15:05:55,719 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:55,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:55,719 INFO L182 omatonBuilderFactory]: Interpolants [40832#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 40833#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 40834#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 40835#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 40836#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 6)) (<= (+ cstrlen_~str.offset 6) cstrlen_~s~0.offset)), 40837#(and (<= (+ cstrlen_~str.offset 7) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 7))), 40838#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 8)) (<= (+ cstrlen_~str.offset 8) cstrlen_~s~0.offset)), 40839#(and (<= (+ cstrlen_~str.offset 9) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 9))), 40840#(and (<= (+ cstrlen_~str.offset 10) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 10))), 40841#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 11)) (<= (+ cstrlen_~str.offset 11) cstrlen_~s~0.offset)), 40842#(and (<= (+ cstrlen_~str.offset 12) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 12))), 40843#(and (<= (+ cstrlen_~str.offset 13) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 13))), 40844#(and (<= (+ cstrlen_~str.offset 14) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 14))), 40845#(and (<= (+ cstrlen_~str.offset 15) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 15))), 40846#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 16)) (<= (+ cstrlen_~str.offset 16) cstrlen_~s~0.offset)), 40847#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 17)) (<= (+ cstrlen_~str.offset 17) cstrlen_~s~0.offset)), 40848#(and (<= (+ cstrlen_~str.offset 18) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 18))), 40849#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 19)) (<= (+ cstrlen_~str.offset 19) cstrlen_~s~0.offset)), 40850#(and (<= |cstrlen_#res| 19) (<= 19 |cstrlen_#res|)), 40851#(and (<= 19 |cstrstr_#t~ret13|) (<= |cstrstr_#t~ret13| 19)), 40852#(and (<= cstrstr_~len~0 19) (<= 19 cstrstr_~len~0)), 40853#(and (<= |cstrncmp_#in~n| 19) (<= 19 |cstrncmp_#in~n|)), 40854#(and (<= cstrncmp_~n 19) (<= 19 cstrncmp_~n)), 40855#(and (<= 18 cstrncmp_~n) (<= cstrncmp_~n 18)), 40856#(and (<= cstrncmp_~n 17) (<= 17 cstrncmp_~n)), 40857#(and (<= cstrncmp_~n 16) (<= 16 cstrncmp_~n)), 40858#(and (<= cstrncmp_~n 15) (<= 15 cstrncmp_~n)), 40859#(and (<= 14 cstrncmp_~n) (<= cstrncmp_~n 14)), 40860#(and (<= cstrncmp_~n 13) (<= 13 cstrncmp_~n)), 40861#(and (<= 12 cstrncmp_~n) (<= cstrncmp_~n 12)), 40862#(and (<= cstrncmp_~n 11) (<= 11 cstrncmp_~n)), 40863#(and (<= 10 cstrncmp_~n) (<= cstrncmp_~n 10)), 40864#(and (<= 9 cstrncmp_~n) (<= cstrncmp_~n 9)), 40865#(and (<= 8 cstrncmp_~n) (<= cstrncmp_~n 8)), 40866#(and (<= 7 cstrncmp_~n) (<= cstrncmp_~n 7)), 40867#(and (<= cstrncmp_~n 6) (<= 6 cstrncmp_~n)), 40868#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 40869#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 40870#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 40871#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 40872#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 40873#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|)), 40828#true, 40829#false, 40830#(= cstrlen_~s~0.offset cstrlen_~str.offset), 40831#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset))] [2018-02-04 15:05:55,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2531 backedges. 247 proven. 2280 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:05:55,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 15:05:55,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 15:05:55,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 15:05:55,720 INFO L87 Difference]: Start difference. First operand 312 states and 376 transitions. Second operand 46 states. [2018-02-04 15:05:57,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:05:57,211 INFO L93 Difference]: Finished difference Result 639 states and 761 transitions. [2018-02-04 15:05:57,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 15:05:57,211 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 297 [2018-02-04 15:05:57,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:05:57,212 INFO L225 Difference]: With dead ends: 639 [2018-02-04 15:05:57,212 INFO L226 Difference]: Without dead ends: 317 [2018-02-04 15:05:57,213 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=173, Invalid=4249, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 15:05:57,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-02-04 15:05:57,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 316. [2018-02-04 15:05:57,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-02-04 15:05:57,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 380 transitions. [2018-02-04 15:05:57,216 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 380 transitions. Word has length 297 [2018-02-04 15:05:57,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:05:57,216 INFO L432 AbstractCegarLoop]: Abstraction has 316 states and 380 transitions. [2018-02-04 15:05:57,216 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 15:05:57,216 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 380 transitions. [2018-02-04 15:05:57,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-02-04 15:05:57,217 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:05:57,218 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:05:57,218 INFO L371 AbstractCegarLoop]: === Iteration 89 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:05:57,218 INFO L82 PathProgramCache]: Analyzing trace with hash 581871005, now seen corresponding path program 38 times [2018-02-04 15:05:57,218 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:05:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:05:57,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:05:58,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2610 backedges. 722 proven. 1888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:58,491 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:05:58,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-02-04 15:05:58,491 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:05:58,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:58,492 INFO L182 omatonBuilderFactory]: Interpolants [41871#true, 41872#false, 41873#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 41874#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 41875#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 41876#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 41877#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 41878#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 41879#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 41880#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 41881#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 41882#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 41883#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 41884#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 41885#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 41886#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 41887#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 41888#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 41889#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 41890#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 15) cstrlen_~s~0.offset)), 41891#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 16) cstrlen_~s~0.offset)), 41892#(and (<= (+ |cstrlen_#in~str.offset| 17) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 41893#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 18) cstrlen_~s~0.offset)), 41894#(and (<= (+ |cstrlen_#in~str.offset| 19) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 41895#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 20) cstrlen_~s~0.offset)), 41896#(<= (+ |cstrlen_#in~str.offset| 21) (select |#length| |cstrlen_#in~str.base|)), 41897#(<= (+ cstrstr_~find.offset 21) (select |#length| cstrstr_~find.base)), 41898#(<= (+ |cstrncmp_#in~s2.offset| 21) (select |#length| |cstrncmp_#in~s2.base|)), 41899#(<= (+ cstrncmp_~s2.offset 21) (select |#length| cstrncmp_~s2.base)), 41900#(<= (+ cstrncmp_~s2.offset 20) (select |#length| cstrncmp_~s2.base)), 41901#(<= (+ cstrncmp_~s2.offset 19) (select |#length| cstrncmp_~s2.base)), 41902#(<= (+ cstrncmp_~s2.offset 18) (select |#length| cstrncmp_~s2.base)), 41903#(<= (+ cstrncmp_~s2.offset 17) (select |#length| cstrncmp_~s2.base)), 41904#(<= (+ cstrncmp_~s2.offset 16) (select |#length| cstrncmp_~s2.base)), 41905#(<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)), 41906#(<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)), 41907#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 41908#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 41909#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 41910#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 41911#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 41912#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 41913#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 41914#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 41915#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 41916#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 41917#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 41918#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 41919#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 41920#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 41921#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 2 |cstrncmp_#t~post3.offset|))] [2018-02-04 15:05:58,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2610 backedges. 722 proven. 1888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:05:58,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 15:05:58,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 15:05:58,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=2090, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 15:05:58,492 INFO L87 Difference]: Start difference. First operand 316 states and 380 transitions. Second operand 51 states. [2018-02-04 15:06:00,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:00,671 INFO L93 Difference]: Finished difference Result 503 states and 570 transitions. [2018-02-04 15:06:00,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-02-04 15:06:00,671 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 301 [2018-02-04 15:06:00,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:00,673 INFO L225 Difference]: With dead ends: 503 [2018-02-04 15:06:00,673 INFO L226 Difference]: Without dead ends: 503 [2018-02-04 15:06:00,674 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3696 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2400, Invalid=10482, Unknown=0, NotChecked=0, Total=12882 [2018-02-04 15:06:00,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-02-04 15:06:00,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 324. [2018-02-04 15:06:00,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-02-04 15:06:00,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 390 transitions. [2018-02-04 15:06:00,676 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 390 transitions. Word has length 301 [2018-02-04 15:06:00,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:00,677 INFO L432 AbstractCegarLoop]: Abstraction has 324 states and 390 transitions. [2018-02-04 15:06:00,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 15:06:00,677 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 390 transitions. [2018-02-04 15:06:00,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-02-04 15:06:00,677 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:00,678 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:06:00,678 INFO L371 AbstractCegarLoop]: === Iteration 90 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:06:00,678 INFO L82 PathProgramCache]: Analyzing trace with hash 964634335, now seen corresponding path program 20 times [2018-02-04 15:06:00,678 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:00,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:02,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2630 backedges. 722 proven. 1908 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:02,187 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:02,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-04 15:06:02,187 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:02,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:02,187 INFO L182 omatonBuilderFactory]: Interpolants [42880#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 42881#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 42882#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 42883#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 42884#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 42885#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 42886#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 42887#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 42888#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 42889#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 42890#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 42891#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 42892#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 42893#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 42894#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 42895#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 15) cstrlen_~s~0.offset)), 42896#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 16) cstrlen_~s~0.offset)), 42897#(and (<= (+ |cstrlen_#in~str.offset| 17) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 42898#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 18) cstrlen_~s~0.offset)), 42899#(and (<= (+ |cstrlen_#in~str.offset| 19) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 42900#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 20) cstrlen_~s~0.offset)), 42901#(<= (+ |cstrlen_#in~str.offset| 21) (select |#length| |cstrlen_#in~str.base|)), 42902#(<= (+ cstrstr_~find.offset 21) (select |#length| cstrstr_~find.base)), 42903#(<= (+ |cstrncmp_#in~s2.offset| 21) (select |#length| |cstrncmp_#in~s2.base|)), 42904#(<= (+ cstrncmp_~s2.offset 21) (select |#length| cstrncmp_~s2.base)), 42905#(<= (+ cstrncmp_~s2.offset 20) (select |#length| cstrncmp_~s2.base)), 42906#(<= (+ cstrncmp_~s2.offset 19) (select |#length| cstrncmp_~s2.base)), 42907#(<= (+ cstrncmp_~s2.offset 18) (select |#length| cstrncmp_~s2.base)), 42908#(<= (+ cstrncmp_~s2.offset 17) (select |#length| cstrncmp_~s2.base)), 42909#(<= (+ cstrncmp_~s2.offset 16) (select |#length| cstrncmp_~s2.base)), 42910#(<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)), 42911#(<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)), 42912#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 42913#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 42914#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 42915#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 42916#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 42917#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 42918#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 42919#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 42920#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 42921#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 42922#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 42923#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 42924#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 42925#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 42926#(and (<= 3 cstrncmp_~s2.offset) (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base))), 42927#(and (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|)) (<= 2 |cstrncmp_#t~pre6.offset|)), 42876#true, 42877#false, 42878#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 42879#(= main_~length2~0 (select |#length| main_~nondetString2~0.base))] [2018-02-04 15:06:02,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2630 backedges. 722 proven. 1908 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:02,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-04 15:06:02,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-04 15:06:02,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=462, Invalid=2190, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 15:06:02,188 INFO L87 Difference]: Start difference. First operand 324 states and 390 transitions. Second operand 52 states. [2018-02-04 15:06:04,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:04,961 INFO L93 Difference]: Finished difference Result 517 states and 586 transitions. [2018-02-04 15:06:04,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-02-04 15:06:04,962 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 305 [2018-02-04 15:06:04,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:04,963 INFO L225 Difference]: With dead ends: 517 [2018-02-04 15:06:04,963 INFO L226 Difference]: Without dead ends: 517 [2018-02-04 15:06:04,964 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5379 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3004, Invalid=14552, Unknown=0, NotChecked=0, Total=17556 [2018-02-04 15:06:04,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-02-04 15:06:04,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 325. [2018-02-04 15:06:04,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-02-04 15:06:04,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 392 transitions. [2018-02-04 15:06:04,967 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 392 transitions. Word has length 305 [2018-02-04 15:06:04,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:04,967 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 392 transitions. [2018-02-04 15:06:04,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-04 15:06:04,968 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 392 transitions. [2018-02-04 15:06:04,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-02-04 15:06:04,968 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:04,968 INFO L351 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:06:04,969 INFO L371 AbstractCegarLoop]: === Iteration 91 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:06:04,969 INFO L82 PathProgramCache]: Analyzing trace with hash -644741944, now seen corresponding path program 39 times [2018-02-04 15:06:04,969 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:04,995 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:06,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2794 backedges. 260 proven. 2530 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:06:06,037 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:06,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-04 15:06:06,037 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:06,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:06,037 INFO L182 omatonBuilderFactory]: Interpolants [43968#(and (<= 12 cstrncmp_~n) (<= cstrncmp_~n 12)), 43969#(and (<= cstrncmp_~n 11) (<= 11 cstrncmp_~n)), 43970#(and (<= 10 cstrncmp_~n) (<= cstrncmp_~n 10)), 43971#(and (<= 9 cstrncmp_~n) (<= cstrncmp_~n 9)), 43972#(and (<= 8 cstrncmp_~n) (<= cstrncmp_~n 8)), 43973#(and (<= 7 cstrncmp_~n) (<= cstrncmp_~n 7)), 43974#(and (<= cstrncmp_~n 6) (<= 6 cstrncmp_~n)), 43975#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 43976#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 43977#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 43978#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 43979#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 43980#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|)), 43933#true, 43934#false, 43935#(= cstrlen_~s~0.offset cstrlen_~str.offset), 43936#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 43937#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 43938#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 43939#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 43940#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 43941#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 6)) (<= (+ cstrlen_~str.offset 6) cstrlen_~s~0.offset)), 43942#(and (<= (+ cstrlen_~str.offset 7) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 7))), 43943#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 8)) (<= (+ cstrlen_~str.offset 8) cstrlen_~s~0.offset)), 43944#(and (<= (+ cstrlen_~str.offset 9) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 9))), 43945#(and (<= (+ cstrlen_~str.offset 10) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 10))), 43946#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 11)) (<= (+ cstrlen_~str.offset 11) cstrlen_~s~0.offset)), 43947#(and (<= (+ cstrlen_~str.offset 12) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 12))), 43948#(and (<= (+ cstrlen_~str.offset 13) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 13))), 43949#(and (<= (+ cstrlen_~str.offset 14) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 14))), 43950#(and (<= (+ cstrlen_~str.offset 15) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 15))), 43951#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 16)) (<= (+ cstrlen_~str.offset 16) cstrlen_~s~0.offset)), 43952#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 17)) (<= (+ cstrlen_~str.offset 17) cstrlen_~s~0.offset)), 43953#(and (<= (+ cstrlen_~str.offset 18) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 18))), 43954#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 19)) (<= (+ cstrlen_~str.offset 19) cstrlen_~s~0.offset)), 43955#(and (<= (+ cstrlen_~str.offset 20) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 20))), 43956#(and (<= |cstrlen_#res| 20) (<= 20 |cstrlen_#res|)), 43957#(and (<= |cstrstr_#t~ret13| 20) (<= 20 |cstrstr_#t~ret13|)), 43958#(and (<= cstrstr_~len~0 20) (<= 20 cstrstr_~len~0)), 43959#(and (<= |cstrncmp_#in~n| 20) (<= 20 |cstrncmp_#in~n|)), 43960#(and (<= 20 cstrncmp_~n) (<= cstrncmp_~n 20)), 43961#(and (<= cstrncmp_~n 19) (<= 19 cstrncmp_~n)), 43962#(and (<= 18 cstrncmp_~n) (<= cstrncmp_~n 18)), 43963#(and (<= cstrncmp_~n 17) (<= 17 cstrncmp_~n)), 43964#(and (<= cstrncmp_~n 16) (<= 16 cstrncmp_~n)), 43965#(and (<= cstrncmp_~n 15) (<= 15 cstrncmp_~n)), 43966#(and (<= 14 cstrncmp_~n) (<= cstrncmp_~n 14)), 43967#(and (<= cstrncmp_~n 13) (<= 13 cstrncmp_~n))] [2018-02-04 15:06:06,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2794 backedges. 260 proven. 2530 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:06:06,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 15:06:06,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 15:06:06,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 15:06:06,038 INFO L87 Difference]: Start difference. First operand 325 states and 392 transitions. Second operand 48 states. [2018-02-04 15:06:07,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:07,680 INFO L93 Difference]: Finished difference Result 668 states and 796 transitions. [2018-02-04 15:06:07,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 15:06:07,680 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 310 [2018-02-04 15:06:07,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:07,681 INFO L225 Difference]: With dead ends: 668 [2018-02-04 15:06:07,681 INFO L226 Difference]: Without dead ends: 330 [2018-02-04 15:06:07,681 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=181, Invalid=4649, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 15:06:07,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-02-04 15:06:07,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 329. [2018-02-04 15:06:07,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-02-04 15:06:07,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 396 transitions. [2018-02-04 15:06:07,683 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 396 transitions. Word has length 310 [2018-02-04 15:06:07,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:07,684 INFO L432 AbstractCegarLoop]: Abstraction has 329 states and 396 transitions. [2018-02-04 15:06:07,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 15:06:07,684 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 396 transitions. [2018-02-04 15:06:07,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-02-04 15:06:07,684 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:07,685 INFO L351 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:06:07,685 INFO L371 AbstractCegarLoop]: === Iteration 92 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:06:07,685 INFO L82 PathProgramCache]: Analyzing trace with hash -131776283, now seen corresponding path program 40 times [2018-02-04 15:06:07,685 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:07,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:09,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2877 backedges. 800 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:09,022 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:09,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-02-04 15:06:09,022 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:09,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:09,022 INFO L182 omatonBuilderFactory]: Interpolants [45056#(<= (+ cstrncmp_~s2.offset 17) (select |#length| cstrncmp_~s2.base)), 45057#(<= (+ cstrncmp_~s2.offset 16) (select |#length| cstrncmp_~s2.base)), 45058#(<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)), 45059#(<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)), 45060#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 45061#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 45062#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 45063#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 45064#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 45065#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 45066#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 45067#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 45068#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 45069#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 45070#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 45071#(<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)), 45072#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 45073#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 45074#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 1 |cstrncmp_#t~post3.offset|)), 45022#true, 45023#false, 45024#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 45025#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 45026#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 45027#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 45028#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 45029#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 45030#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 45031#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 45032#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 45033#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 45034#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 45035#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 45036#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 45037#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 45038#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 45039#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 45040#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 45041#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 15) cstrlen_~s~0.offset)), 45042#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 16) cstrlen_~s~0.offset)), 45043#(and (<= (+ |cstrlen_#in~str.offset| 17) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 45044#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 18) cstrlen_~s~0.offset)), 45045#(and (<= (+ |cstrlen_#in~str.offset| 19) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 45046#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 20) cstrlen_~s~0.offset)), 45047#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 21) cstrlen_~s~0.offset)), 45048#(<= (+ |cstrlen_#in~str.offset| 22) (select |#length| |cstrlen_#in~str.base|)), 45049#(<= (+ cstrstr_~find.offset 22) (select |#length| cstrstr_~find.base)), 45050#(<= (+ |cstrncmp_#in~s2.offset| 22) (select |#length| |cstrncmp_#in~s2.base|)), 45051#(<= (+ cstrncmp_~s2.offset 22) (select |#length| cstrncmp_~s2.base)), 45052#(<= (+ cstrncmp_~s2.offset 21) (select |#length| cstrncmp_~s2.base)), 45053#(<= (+ cstrncmp_~s2.offset 20) (select |#length| cstrncmp_~s2.base)), 45054#(<= (+ cstrncmp_~s2.offset 19) (select |#length| cstrncmp_~s2.base)), 45055#(<= (+ cstrncmp_~s2.offset 18) (select |#length| cstrncmp_~s2.base))] [2018-02-04 15:06:09,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2877 backedges. 800 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:09,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 15:06:09,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 15:06:09,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=2233, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 15:06:09,023 INFO L87 Difference]: Start difference. First operand 329 states and 396 transitions. Second operand 53 states. [2018-02-04 15:06:10,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:10,946 INFO L93 Difference]: Finished difference Result 527 states and 597 transitions. [2018-02-04 15:06:10,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-02-04 15:06:10,946 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 314 [2018-02-04 15:06:10,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:10,948 INFO L225 Difference]: With dead ends: 527 [2018-02-04 15:06:10,948 INFO L226 Difference]: Without dead ends: 527 [2018-02-04 15:06:10,948 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4150 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2804, Invalid=11476, Unknown=0, NotChecked=0, Total=14280 [2018-02-04 15:06:10,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-02-04 15:06:10,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 337. [2018-02-04 15:06:10,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-02-04 15:06:10,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 406 transitions. [2018-02-04 15:06:10,951 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 406 transitions. Word has length 314 [2018-02-04 15:06:10,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:10,951 INFO L432 AbstractCegarLoop]: Abstraction has 337 states and 406 transitions. [2018-02-04 15:06:10,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 15:06:10,951 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 406 transitions. [2018-02-04 15:06:10,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-02-04 15:06:10,952 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:10,952 INFO L351 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:06:10,952 INFO L371 AbstractCegarLoop]: === Iteration 93 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:06:10,952 INFO L82 PathProgramCache]: Analyzing trace with hash -265888217, now seen corresponding path program 21 times [2018-02-04 15:06:10,952 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:10,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:12,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 800 proven. 2098 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:12,399 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:12,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-02-04 15:06:12,400 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:12,400 INFO L182 omatonBuilderFactory]: Interpolants [46080#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 46081#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 46082#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 46083#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 46084#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 46085#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 46086#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 46087#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 46088#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 46089#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 46090#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 46091#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 46092#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 46093#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 15) cstrlen_~s~0.offset)), 46094#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 16) cstrlen_~s~0.offset)), 46095#(and (<= (+ |cstrlen_#in~str.offset| 17) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 46096#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 18) cstrlen_~s~0.offset)), 46097#(and (<= (+ |cstrlen_#in~str.offset| 19) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 46098#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 20) cstrlen_~s~0.offset)), 46099#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 21) cstrlen_~s~0.offset)), 46100#(<= (+ |cstrlen_#in~str.offset| 22) (select |#length| |cstrlen_#in~str.base|)), 46101#(<= (+ cstrstr_~find.offset 22) (select |#length| cstrstr_~find.base)), 46102#(<= (+ |cstrncmp_#in~s2.offset| 22) (select |#length| |cstrncmp_#in~s2.base|)), 46103#(<= (+ cstrncmp_~s2.offset 22) (select |#length| cstrncmp_~s2.base)), 46104#(<= (+ cstrncmp_~s2.offset 21) (select |#length| cstrncmp_~s2.base)), 46105#(<= (+ cstrncmp_~s2.offset 20) (select |#length| cstrncmp_~s2.base)), 46106#(<= (+ cstrncmp_~s2.offset 19) (select |#length| cstrncmp_~s2.base)), 46107#(<= (+ cstrncmp_~s2.offset 18) (select |#length| cstrncmp_~s2.base)), 46108#(<= (+ cstrncmp_~s2.offset 17) (select |#length| cstrncmp_~s2.base)), 46109#(<= (+ cstrncmp_~s2.offset 16) (select |#length| cstrncmp_~s2.base)), 46110#(<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)), 46111#(<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)), 46112#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 46113#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 46114#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 46115#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 46116#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 46117#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 46118#(and (<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 46119#(and (<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 46120#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base))), 46121#(and (<= 3 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base))), 46122#(and (<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)) (<= 4 cstrncmp_~s2.offset)), 46123#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 5 cstrncmp_~s2.offset)), 46124#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 6 cstrncmp_~s2.offset)), 46125#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 7 cstrncmp_~s2.offset)), 46126#(and (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base)) (<= 8 cstrncmp_~s2.offset)), 46127#(and (<= 7 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|))), 46074#true, 46075#false, 46076#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 46077#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 46078#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 46079#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset))] [2018-02-04 15:06:12,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 800 proven. 2098 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:12,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-04 15:06:12,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-04 15:06:12,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=2442, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 15:06:12,401 INFO L87 Difference]: Start difference. First operand 337 states and 406 transitions. Second operand 54 states. [2018-02-04 15:06:15,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:15,309 INFO L93 Difference]: Finished difference Result 529 states and 601 transitions. [2018-02-04 15:06:15,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-02-04 15:06:15,309 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 318 [2018-02-04 15:06:15,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:15,311 INFO L225 Difference]: With dead ends: 529 [2018-02-04 15:06:15,311 INFO L226 Difference]: Without dead ends: 529 [2018-02-04 15:06:15,312 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4507 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2125, Invalid=13127, Unknown=0, NotChecked=0, Total=15252 [2018-02-04 15:06:15,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-02-04 15:06:15,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 338. [2018-02-04 15:06:15,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-02-04 15:06:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 408 transitions. [2018-02-04 15:06:15,314 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 408 transitions. Word has length 318 [2018-02-04 15:06:15,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:15,315 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 408 transitions. [2018-02-04 15:06:15,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-04 15:06:15,315 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 408 transitions. [2018-02-04 15:06:15,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-02-04 15:06:15,315 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:15,316 INFO L351 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:06:15,316 INFO L371 AbstractCegarLoop]: === Iteration 94 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:06:15,316 INFO L82 PathProgramCache]: Analyzing trace with hash -184444288, now seen corresponding path program 41 times [2018-02-04 15:06:15,316 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:15,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:16,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3070 backedges. 273 proven. 2793 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:06:16,394 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:16,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-02-04 15:06:16,394 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:16,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:16,395 INFO L182 omatonBuilderFactory]: Interpolants [47136#true, 47137#false, 47138#(= cstrlen_~s~0.offset cstrlen_~str.offset), 47139#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 47140#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 47141#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 47142#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 47143#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 47144#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 6)) (<= (+ cstrlen_~str.offset 6) cstrlen_~s~0.offset)), 47145#(and (<= (+ cstrlen_~str.offset 7) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 7))), 47146#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 8)) (<= (+ cstrlen_~str.offset 8) cstrlen_~s~0.offset)), 47147#(and (<= (+ cstrlen_~str.offset 9) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 9))), 47148#(and (<= (+ cstrlen_~str.offset 10) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 10))), 47149#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 11)) (<= (+ cstrlen_~str.offset 11) cstrlen_~s~0.offset)), 47150#(and (<= (+ cstrlen_~str.offset 12) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 12))), 47151#(and (<= (+ cstrlen_~str.offset 13) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 13))), 47152#(and (<= (+ cstrlen_~str.offset 14) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 14))), 47153#(and (<= (+ cstrlen_~str.offset 15) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 15))), 47154#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 16)) (<= (+ cstrlen_~str.offset 16) cstrlen_~s~0.offset)), 47155#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 17)) (<= (+ cstrlen_~str.offset 17) cstrlen_~s~0.offset)), 47156#(and (<= (+ cstrlen_~str.offset 18) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 18))), 47157#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 19)) (<= (+ cstrlen_~str.offset 19) cstrlen_~s~0.offset)), 47158#(and (<= (+ cstrlen_~str.offset 20) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 20))), 47159#(and (<= (+ cstrlen_~str.offset 21) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 21))), 47160#(and (<= 21 |cstrlen_#res|) (<= |cstrlen_#res| 21)), 47161#(and (<= 21 |cstrstr_#t~ret13|) (<= |cstrstr_#t~ret13| 21)), 47162#(and (<= cstrstr_~len~0 21) (<= 21 cstrstr_~len~0)), 47163#(and (<= 21 |cstrncmp_#in~n|) (<= |cstrncmp_#in~n| 21)), 47164#(and (<= cstrncmp_~n 21) (<= 21 cstrncmp_~n)), 47165#(and (<= 20 cstrncmp_~n) (<= cstrncmp_~n 20)), 47166#(and (<= cstrncmp_~n 19) (<= 19 cstrncmp_~n)), 47167#(and (<= 18 cstrncmp_~n) (<= cstrncmp_~n 18)), 47168#(and (<= cstrncmp_~n 17) (<= 17 cstrncmp_~n)), 47169#(and (<= cstrncmp_~n 16) (<= 16 cstrncmp_~n)), 47170#(and (<= cstrncmp_~n 15) (<= 15 cstrncmp_~n)), 47171#(and (<= 14 cstrncmp_~n) (<= cstrncmp_~n 14)), 47172#(and (<= cstrncmp_~n 13) (<= 13 cstrncmp_~n)), 47173#(and (<= 12 cstrncmp_~n) (<= cstrncmp_~n 12)), 47174#(and (<= cstrncmp_~n 11) (<= 11 cstrncmp_~n)), 47175#(and (<= 10 cstrncmp_~n) (<= cstrncmp_~n 10)), 47176#(and (<= 9 cstrncmp_~n) (<= cstrncmp_~n 9)), 47177#(and (<= 8 cstrncmp_~n) (<= cstrncmp_~n 8)), 47178#(and (<= 7 cstrncmp_~n) (<= cstrncmp_~n 7)), 47179#(and (<= cstrncmp_~n 6) (<= 6 cstrncmp_~n)), 47180#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 47181#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 47182#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 47183#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 47184#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 47185#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|))] [2018-02-04 15:06:16,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3070 backedges. 273 proven. 2793 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:06:16,395 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 15:06:16,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 15:06:16,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 15:06:16,396 INFO L87 Difference]: Start difference. First operand 338 states and 408 transitions. Second operand 50 states. [2018-02-04 15:06:18,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:18,122 INFO L93 Difference]: Finished difference Result 697 states and 831 transitions. [2018-02-04 15:06:18,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 15:06:18,122 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 323 [2018-02-04 15:06:18,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:18,123 INFO L225 Difference]: With dead ends: 697 [2018-02-04 15:06:18,123 INFO L226 Difference]: Without dead ends: 343 [2018-02-04 15:06:18,124 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=189, Invalid=5067, Unknown=0, NotChecked=0, Total=5256 [2018-02-04 15:06:18,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-02-04 15:06:18,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 342. [2018-02-04 15:06:18,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-02-04 15:06:18,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 412 transitions. [2018-02-04 15:06:18,126 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 412 transitions. Word has length 323 [2018-02-04 15:06:18,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:18,126 INFO L432 AbstractCegarLoop]: Abstraction has 342 states and 412 transitions. [2018-02-04 15:06:18,126 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 15:06:18,126 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 412 transitions. [2018-02-04 15:06:18,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-02-04 15:06:18,127 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:18,127 INFO L351 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:06:18,127 INFO L371 AbstractCegarLoop]: === Iteration 95 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:06:18,127 INFO L82 PathProgramCache]: Analyzing trace with hash -290474621, now seen corresponding path program 42 times [2018-02-04 15:06:18,127 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:18,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:19,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3157 backedges. 882 proven. 2275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:19,613 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:19,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-02-04 15:06:19,613 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:19,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:19,614 INFO L182 omatonBuilderFactory]: Interpolants [48271#true, 48272#false, 48273#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 48274#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 48275#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 48276#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 48277#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 48278#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 48279#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 48280#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 48281#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 48282#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 48283#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 48284#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 48285#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 48286#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 48287#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 48288#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 48289#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 48290#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 15) cstrlen_~s~0.offset)), 48291#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 16) cstrlen_~s~0.offset)), 48292#(and (<= (+ |cstrlen_#in~str.offset| 17) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 48293#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 18) cstrlen_~s~0.offset)), 48294#(and (<= (+ |cstrlen_#in~str.offset| 19) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 48295#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 20) cstrlen_~s~0.offset)), 48296#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 21) cstrlen_~s~0.offset)), 48297#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 22) cstrlen_~s~0.offset)), 48298#(<= (+ |cstrlen_#in~str.offset| 23) (select |#length| |cstrlen_#in~str.base|)), 48299#(<= (+ cstrstr_~find.offset 23) (select |#length| cstrstr_~find.base)), 48300#(<= (+ |cstrncmp_#in~s2.offset| 23) (select |#length| |cstrncmp_#in~s2.base|)), 48301#(<= (+ cstrncmp_~s2.offset 23) (select |#length| cstrncmp_~s2.base)), 48302#(<= (+ cstrncmp_~s2.offset 22) (select |#length| cstrncmp_~s2.base)), 48303#(<= (+ cstrncmp_~s2.offset 21) (select |#length| cstrncmp_~s2.base)), 48304#(<= (+ cstrncmp_~s2.offset 20) (select |#length| cstrncmp_~s2.base)), 48305#(<= (+ cstrncmp_~s2.offset 19) (select |#length| cstrncmp_~s2.base)), 48306#(<= (+ cstrncmp_~s2.offset 18) (select |#length| cstrncmp_~s2.base)), 48307#(<= (+ cstrncmp_~s2.offset 17) (select |#length| cstrncmp_~s2.base)), 48308#(<= (+ cstrncmp_~s2.offset 16) (select |#length| cstrncmp_~s2.base)), 48309#(<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)), 48310#(<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)), 48311#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 48312#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 48313#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 48314#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 48315#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 48316#(and (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base))), 48317#(and (<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 48318#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base))), 48319#(and (<= 3 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base))), 48320#(and (<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)) (<= 4 cstrncmp_~s2.offset)), 48321#(and (<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)) (<= 5 cstrncmp_~s2.offset)), 48322#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 6 cstrncmp_~s2.offset)), 48323#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 7 cstrncmp_~s2.offset)), 48324#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 8 cstrncmp_~s2.offset)), 48325#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 8 |cstrncmp_#t~post3.offset|))] [2018-02-04 15:06:19,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3157 backedges. 882 proven. 2275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:19,614 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-04 15:06:19,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-04 15:06:19,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=2527, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 15:06:19,615 INFO L87 Difference]: Start difference. First operand 342 states and 412 transitions. Second operand 55 states. [2018-02-04 15:06:22,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:22,369 INFO L93 Difference]: Finished difference Result 535 states and 608 transitions. [2018-02-04 15:06:22,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-02-04 15:06:22,369 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 327 [2018-02-04 15:06:22,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:22,370 INFO L225 Difference]: With dead ends: 535 [2018-02-04 15:06:22,370 INFO L226 Difference]: Without dead ends: 535 [2018-02-04 15:06:22,371 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3982 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1937, Invalid=11869, Unknown=0, NotChecked=0, Total=13806 [2018-02-04 15:06:22,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-02-04 15:06:22,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 350. [2018-02-04 15:06:22,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-02-04 15:06:22,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 422 transitions. [2018-02-04 15:06:22,373 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 422 transitions. Word has length 327 [2018-02-04 15:06:22,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:22,374 INFO L432 AbstractCegarLoop]: Abstraction has 350 states and 422 transitions. [2018-02-04 15:06:22,374 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-04 15:06:22,374 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 422 transitions. [2018-02-04 15:06:22,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-02-04 15:06:22,374 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:22,375 INFO L351 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:06:22,375 INFO L371 AbstractCegarLoop]: === Iteration 96 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:06:22,375 INFO L82 PathProgramCache]: Analyzing trace with hash -49687611, now seen corresponding path program 22 times [2018-02-04 15:06:22,375 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:22,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:23,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3179 backedges. 882 proven. 2297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:23,918 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:23,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-02-04 15:06:23,918 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:23,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:23,919 INFO L182 omatonBuilderFactory]: Interpolants [49338#true, 49339#false, 49340#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 49341#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 49342#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 49343#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 49344#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 49345#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 49346#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 49347#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 49348#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 49349#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 49350#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 49351#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 49352#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 49353#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 49354#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 49355#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 49356#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 49357#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 15) cstrlen_~s~0.offset)), 49358#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 16) cstrlen_~s~0.offset)), 49359#(and (<= (+ |cstrlen_#in~str.offset| 17) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 49360#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 18) cstrlen_~s~0.offset)), 49361#(and (<= (+ |cstrlen_#in~str.offset| 19) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 49362#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 20) cstrlen_~s~0.offset)), 49363#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 21) cstrlen_~s~0.offset)), 49364#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 22) cstrlen_~s~0.offset)), 49365#(<= (+ |cstrlen_#in~str.offset| 23) (select |#length| |cstrlen_#in~str.base|)), 49366#(<= (+ cstrstr_~find.offset 23) (select |#length| cstrstr_~find.base)), 49367#(<= (+ |cstrncmp_#in~s2.offset| 23) (select |#length| |cstrncmp_#in~s2.base|)), 49368#(<= (+ cstrncmp_~s2.offset 23) (select |#length| cstrncmp_~s2.base)), 49369#(<= (+ cstrncmp_~s2.offset 22) (select |#length| cstrncmp_~s2.base)), 49370#(<= (+ cstrncmp_~s2.offset 21) (select |#length| cstrncmp_~s2.base)), 49371#(<= (+ cstrncmp_~s2.offset 20) (select |#length| cstrncmp_~s2.base)), 49372#(<= (+ cstrncmp_~s2.offset 19) (select |#length| cstrncmp_~s2.base)), 49373#(<= (+ cstrncmp_~s2.offset 18) (select |#length| cstrncmp_~s2.base)), 49374#(<= (+ cstrncmp_~s2.offset 17) (select |#length| cstrncmp_~s2.base)), 49375#(<= (+ cstrncmp_~s2.offset 16) (select |#length| cstrncmp_~s2.base)), 49376#(<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)), 49377#(<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)), 49378#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 49379#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 49380#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 49381#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 49382#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 49383#(and (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base))), 49384#(and (<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 49385#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base))), 49386#(and (<= 3 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base))), 49387#(and (<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)) (<= 4 cstrncmp_~s2.offset)), 49388#(and (<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)) (<= 5 cstrncmp_~s2.offset)), 49389#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 6 cstrncmp_~s2.offset)), 49390#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 7 cstrncmp_~s2.offset)), 49391#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 8 cstrncmp_~s2.offset)), 49392#(and (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base)) (<= 9 cstrncmp_~s2.offset)), 49393#(and (<= 8 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|)))] [2018-02-04 15:06:23,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3179 backedges. 882 proven. 2297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:23,919 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 15:06:23,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 15:06:23,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=2635, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 15:06:23,919 INFO L87 Difference]: Start difference. First operand 350 states and 422 transitions. Second operand 56 states. [2018-02-04 15:06:27,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:27,000 INFO L93 Difference]: Finished difference Result 549 states and 624 transitions. [2018-02-04 15:06:27,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-02-04 15:06:27,000 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 331 [2018-02-04 15:06:27,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:27,001 INFO L225 Difference]: With dead ends: 549 [2018-02-04 15:06:27,001 INFO L226 Difference]: Without dead ends: 549 [2018-02-04 15:06:27,002 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4730 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2155, Invalid=13847, Unknown=0, NotChecked=0, Total=16002 [2018-02-04 15:06:27,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-02-04 15:06:27,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 351. [2018-02-04 15:06:27,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-02-04 15:06:27,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 424 transitions. [2018-02-04 15:06:27,005 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 424 transitions. Word has length 331 [2018-02-04 15:06:27,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:27,005 INFO L432 AbstractCegarLoop]: Abstraction has 351 states and 424 transitions. [2018-02-04 15:06:27,005 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 15:06:27,005 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 424 transitions. [2018-02-04 15:06:27,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-02-04 15:06:27,007 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:27,007 INFO L351 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:06:27,007 INFO L371 AbstractCegarLoop]: === Iteration 97 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:06:27,007 INFO L82 PathProgramCache]: Analyzing trace with hash -968001630, now seen corresponding path program 43 times [2018-02-04 15:06:27,008 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:27,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:28,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3359 backedges. 286 proven. 3069 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:06:28,249 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:28,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-02-04 15:06:28,249 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:28,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:28,249 INFO L182 omatonBuilderFactory]: Interpolants [50437#true, 50438#false, 50439#(= cstrlen_~s~0.offset cstrlen_~str.offset), 50440#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 50441#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 50442#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 50443#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 50444#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 50445#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 6)) (<= (+ cstrlen_~str.offset 6) cstrlen_~s~0.offset)), 50446#(and (<= (+ cstrlen_~str.offset 7) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 7))), 50447#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 8)) (<= (+ cstrlen_~str.offset 8) cstrlen_~s~0.offset)), 50448#(and (<= (+ cstrlen_~str.offset 9) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 9))), 50449#(and (<= (+ cstrlen_~str.offset 10) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 10))), 50450#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 11)) (<= (+ cstrlen_~str.offset 11) cstrlen_~s~0.offset)), 50451#(and (<= (+ cstrlen_~str.offset 12) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 12))), 50452#(and (<= (+ cstrlen_~str.offset 13) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 13))), 50453#(and (<= (+ cstrlen_~str.offset 14) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 14))), 50454#(and (<= (+ cstrlen_~str.offset 15) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 15))), 50455#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 16)) (<= (+ cstrlen_~str.offset 16) cstrlen_~s~0.offset)), 50456#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 17)) (<= (+ cstrlen_~str.offset 17) cstrlen_~s~0.offset)), 50457#(and (<= (+ cstrlen_~str.offset 18) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 18))), 50458#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 19)) (<= (+ cstrlen_~str.offset 19) cstrlen_~s~0.offset)), 50459#(and (<= (+ cstrlen_~str.offset 20) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 20))), 50460#(and (<= (+ cstrlen_~str.offset 21) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 21))), 50461#(and (<= (+ cstrlen_~str.offset 22) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 22))), 50462#(and (<= |cstrlen_#res| 22) (<= 22 |cstrlen_#res|)), 50463#(and (<= |cstrstr_#t~ret13| 22) (<= 22 |cstrstr_#t~ret13|)), 50464#(and (<= cstrstr_~len~0 22) (<= 22 cstrstr_~len~0)), 50465#(and (<= |cstrncmp_#in~n| 22) (<= 22 |cstrncmp_#in~n|)), 50466#(and (<= cstrncmp_~n 22) (<= 22 cstrncmp_~n)), 50467#(and (<= cstrncmp_~n 21) (<= 21 cstrncmp_~n)), 50468#(and (<= 20 cstrncmp_~n) (<= cstrncmp_~n 20)), 50469#(and (<= cstrncmp_~n 19) (<= 19 cstrncmp_~n)), 50470#(and (<= 18 cstrncmp_~n) (<= cstrncmp_~n 18)), 50471#(and (<= cstrncmp_~n 17) (<= 17 cstrncmp_~n)), 50472#(and (<= cstrncmp_~n 16) (<= 16 cstrncmp_~n)), 50473#(and (<= cstrncmp_~n 15) (<= 15 cstrncmp_~n)), 50474#(and (<= 14 cstrncmp_~n) (<= cstrncmp_~n 14)), 50475#(and (<= cstrncmp_~n 13) (<= 13 cstrncmp_~n)), 50476#(and (<= 12 cstrncmp_~n) (<= cstrncmp_~n 12)), 50477#(and (<= cstrncmp_~n 11) (<= 11 cstrncmp_~n)), 50478#(and (<= 10 cstrncmp_~n) (<= cstrncmp_~n 10)), 50479#(and (<= 9 cstrncmp_~n) (<= cstrncmp_~n 9)), 50480#(and (<= 8 cstrncmp_~n) (<= cstrncmp_~n 8)), 50481#(and (<= 7 cstrncmp_~n) (<= cstrncmp_~n 7)), 50482#(and (<= cstrncmp_~n 6) (<= 6 cstrncmp_~n)), 50483#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 50484#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 50485#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 50486#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 50487#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 50488#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|))] [2018-02-04 15:06:28,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3359 backedges. 286 proven. 3069 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:06:28,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-04 15:06:28,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-04 15:06:28,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 15:06:28,250 INFO L87 Difference]: Start difference. First operand 351 states and 424 transitions. Second operand 52 states. [2018-02-04 15:06:30,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:30,040 INFO L93 Difference]: Finished difference Result 726 states and 866 transitions. [2018-02-04 15:06:30,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 15:06:30,040 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 336 [2018-02-04 15:06:30,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:30,041 INFO L225 Difference]: With dead ends: 726 [2018-02-04 15:06:30,041 INFO L226 Difference]: Without dead ends: 356 [2018-02-04 15:06:30,042 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=197, Invalid=5503, Unknown=0, NotChecked=0, Total=5700 [2018-02-04 15:06:30,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-02-04 15:06:30,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 355. [2018-02-04 15:06:30,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-02-04 15:06:30,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 428 transitions. [2018-02-04 15:06:30,044 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 428 transitions. Word has length 336 [2018-02-04 15:06:30,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:30,044 INFO L432 AbstractCegarLoop]: Abstraction has 355 states and 428 transitions. [2018-02-04 15:06:30,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-04 15:06:30,044 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 428 transitions. [2018-02-04 15:06:30,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-02-04 15:06:30,045 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:30,045 INFO L351 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:06:30,045 INFO L371 AbstractCegarLoop]: === Iteration 98 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:06:30,045 INFO L82 PathProgramCache]: Analyzing trace with hash -2126734977, now seen corresponding path program 44 times [2018-02-04 15:06:30,045 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:30,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:31,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3450 backedges. 968 proven. 2482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:31,629 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:31,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-02-04 15:06:31,629 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:31,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:31,629 INFO L182 omatonBuilderFactory]: Interpolants [51618#true, 51619#false, 51620#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 51621#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 51622#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 51623#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 51624#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 51625#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 51626#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 51627#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 51628#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 51629#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 51630#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 51631#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 51632#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 51633#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 51634#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 51635#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 51636#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 51637#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 15) cstrlen_~s~0.offset)), 51638#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 16) cstrlen_~s~0.offset)), 51639#(and (<= (+ |cstrlen_#in~str.offset| 17) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 51640#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 18) cstrlen_~s~0.offset)), 51641#(and (<= (+ |cstrlen_#in~str.offset| 19) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 51642#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 20) cstrlen_~s~0.offset)), 51643#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 21) cstrlen_~s~0.offset)), 51644#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 22) cstrlen_~s~0.offset)), 51645#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 23) cstrlen_~s~0.offset)), 51646#(<= (+ |cstrlen_#in~str.offset| 24) (select |#length| |cstrlen_#in~str.base|)), 51647#(<= (+ cstrstr_~find.offset 24) (select |#length| cstrstr_~find.base)), 51648#(<= (+ |cstrncmp_#in~s2.offset| 24) (select |#length| |cstrncmp_#in~s2.base|)), 51649#(<= (+ cstrncmp_~s2.offset 24) (select |#length| cstrncmp_~s2.base)), 51650#(<= (+ cstrncmp_~s2.offset 23) (select |#length| cstrncmp_~s2.base)), 51651#(<= (+ cstrncmp_~s2.offset 22) (select |#length| cstrncmp_~s2.base)), 51652#(<= (+ cstrncmp_~s2.offset 21) (select |#length| cstrncmp_~s2.base)), 51653#(<= (+ cstrncmp_~s2.offset 20) (select |#length| cstrncmp_~s2.base)), 51654#(<= (+ cstrncmp_~s2.offset 19) (select |#length| cstrncmp_~s2.base)), 51655#(<= (+ cstrncmp_~s2.offset 18) (select |#length| cstrncmp_~s2.base)), 51656#(<= (+ cstrncmp_~s2.offset 17) (select |#length| cstrncmp_~s2.base)), 51657#(<= (+ cstrncmp_~s2.offset 16) (select |#length| cstrncmp_~s2.base)), 51658#(<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)), 51659#(<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)), 51660#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 51661#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 51662#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 51663#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 51664#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 51665#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 51666#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 51667#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 51668#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 51669#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 51670#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 51671#(<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)), 51672#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 51673#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 51674#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 1 |cstrncmp_#t~post3.offset|))] [2018-02-04 15:06:31,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3450 backedges. 968 proven. 2482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:31,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-04 15:06:31,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-04 15:06:31,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=617, Invalid=2575, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 15:06:31,630 INFO L87 Difference]: Start difference. First operand 355 states and 428 transitions. Second operand 57 states. [2018-02-04 15:06:33,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:33,879 INFO L93 Difference]: Finished difference Result 571 states and 647 transitions. [2018-02-04 15:06:33,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-02-04 15:06:33,879 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 340 [2018-02-04 15:06:33,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:33,881 INFO L225 Difference]: With dead ends: 571 [2018-02-04 15:06:33,881 INFO L226 Difference]: Without dead ends: 571 [2018-02-04 15:06:33,882 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4937 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3321, Invalid=13449, Unknown=0, NotChecked=0, Total=16770 [2018-02-04 15:06:33,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-02-04 15:06:33,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 363. [2018-02-04 15:06:33,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-02-04 15:06:33,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 438 transitions. [2018-02-04 15:06:33,885 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 438 transitions. Word has length 340 [2018-02-04 15:06:33,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:33,885 INFO L432 AbstractCegarLoop]: Abstraction has 363 states and 438 transitions. [2018-02-04 15:06:33,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-04 15:06:33,885 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 438 transitions. [2018-02-04 15:06:33,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-02-04 15:06:33,886 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:33,886 INFO L351 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:06:33,886 INFO L371 AbstractCegarLoop]: === Iteration 99 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:06:33,886 INFO L82 PathProgramCache]: Analyzing trace with hash -162768447, now seen corresponding path program 23 times [2018-02-04 15:06:33,886 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:33,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:35,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 968 proven. 2505 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:35,574 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:35,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-02-04 15:06:35,575 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:35,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:35,575 INFO L182 omatonBuilderFactory]: Interpolants [52756#true, 52757#false, 52758#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 52759#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 52760#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 52761#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 52762#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 52763#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 52764#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 52765#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 52766#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 52767#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 52768#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 52769#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 52770#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 52771#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 52772#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 52773#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 52774#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 52775#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 15) cstrlen_~s~0.offset)), 52776#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 16) cstrlen_~s~0.offset)), 52777#(and (<= (+ |cstrlen_#in~str.offset| 17) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 52778#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 18) cstrlen_~s~0.offset)), 52779#(and (<= (+ |cstrlen_#in~str.offset| 19) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 52780#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 20) cstrlen_~s~0.offset)), 52781#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 21) cstrlen_~s~0.offset)), 52782#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 22) cstrlen_~s~0.offset)), 52783#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 23) cstrlen_~s~0.offset)), 52784#(<= (+ |cstrlen_#in~str.offset| 24) (select |#length| |cstrlen_#in~str.base|)), 52785#(<= (+ cstrstr_~find.offset 24) (select |#length| cstrstr_~find.base)), 52786#(<= (+ |cstrncmp_#in~s2.offset| 24) (select |#length| |cstrncmp_#in~s2.base|)), 52787#(<= (+ cstrncmp_~s2.offset 24) (select |#length| cstrncmp_~s2.base)), 52788#(<= (+ cstrncmp_~s2.offset 23) (select |#length| cstrncmp_~s2.base)), 52789#(<= (+ cstrncmp_~s2.offset 22) (select |#length| cstrncmp_~s2.base)), 52790#(<= (+ cstrncmp_~s2.offset 21) (select |#length| cstrncmp_~s2.base)), 52791#(<= (+ cstrncmp_~s2.offset 20) (select |#length| cstrncmp_~s2.base)), 52792#(<= (+ cstrncmp_~s2.offset 19) (select |#length| cstrncmp_~s2.base)), 52793#(<= (+ cstrncmp_~s2.offset 18) (select |#length| cstrncmp_~s2.base)), 52794#(<= (+ cstrncmp_~s2.offset 17) (select |#length| cstrncmp_~s2.base)), 52795#(<= (+ cstrncmp_~s2.offset 16) (select |#length| cstrncmp_~s2.base)), 52796#(<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)), 52797#(<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)), 52798#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 52799#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 52800#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 52801#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 52802#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 52803#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 52804#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 52805#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 52806#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 52807#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 52808#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 52809#(<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)), 52810#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 52811#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 52812#(and (<= 2 cstrncmp_~s2.offset) (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base))), 52813#(and (<= 1 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|)))] [2018-02-04 15:06:35,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 968 proven. 2505 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:35,575 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 15:06:35,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 15:06:35,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=2687, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 15:06:35,576 INFO L87 Difference]: Start difference. First operand 363 states and 438 transitions. Second operand 58 states. [2018-02-04 15:06:38,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:38,515 INFO L93 Difference]: Finished difference Result 585 states and 663 transitions. [2018-02-04 15:06:38,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-02-04 15:06:38,516 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 344 [2018-02-04 15:06:38,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:38,517 INFO L225 Difference]: With dead ends: 585 [2018-02-04 15:06:38,517 INFO L226 Difference]: Without dead ends: 585 [2018-02-04 15:06:38,519 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7418 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4220, Invalid=19342, Unknown=0, NotChecked=0, Total=23562 [2018-02-04 15:06:38,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-02-04 15:06:38,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 364. [2018-02-04 15:06:38,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-02-04 15:06:38,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 440 transitions. [2018-02-04 15:06:38,523 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 440 transitions. Word has length 344 [2018-02-04 15:06:38,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:38,523 INFO L432 AbstractCegarLoop]: Abstraction has 364 states and 440 transitions. [2018-02-04 15:06:38,523 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 15:06:38,523 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 440 transitions. [2018-02-04 15:06:38,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-02-04 15:06:38,525 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:38,525 INFO L351 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:06:38,525 INFO L371 AbstractCegarLoop]: === Iteration 100 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:06:38,525 INFO L82 PathProgramCache]: Analyzing trace with hash -388280538, now seen corresponding path program 45 times [2018-02-04 15:06:38,526 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:38,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:39,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3661 backedges. 299 proven. 3358 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:06:39,796 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:39,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-02-04 15:06:39,797 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:39,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:39,797 INFO L182 omatonBuilderFactory]: Interpolants [53956#true, 53957#false, 53958#(= cstrlen_~s~0.offset cstrlen_~str.offset), 53959#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 53960#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 53961#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 53962#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 53963#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 53964#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 6)) (<= (+ cstrlen_~str.offset 6) cstrlen_~s~0.offset)), 53965#(and (<= (+ cstrlen_~str.offset 7) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 7))), 53966#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 8)) (<= (+ cstrlen_~str.offset 8) cstrlen_~s~0.offset)), 53967#(and (<= (+ cstrlen_~str.offset 9) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 9))), 53968#(and (<= (+ cstrlen_~str.offset 10) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 10))), 53969#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 11)) (<= (+ cstrlen_~str.offset 11) cstrlen_~s~0.offset)), 53970#(and (<= (+ cstrlen_~str.offset 12) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 12))), 53971#(and (<= (+ cstrlen_~str.offset 13) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 13))), 53972#(and (<= (+ cstrlen_~str.offset 14) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 14))), 53973#(and (<= (+ cstrlen_~str.offset 15) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 15))), 53974#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 16)) (<= (+ cstrlen_~str.offset 16) cstrlen_~s~0.offset)), 53975#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 17)) (<= (+ cstrlen_~str.offset 17) cstrlen_~s~0.offset)), 53976#(and (<= (+ cstrlen_~str.offset 18) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 18))), 53977#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 19)) (<= (+ cstrlen_~str.offset 19) cstrlen_~s~0.offset)), 53978#(and (<= (+ cstrlen_~str.offset 20) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 20))), 53979#(and (<= (+ cstrlen_~str.offset 21) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 21))), 53980#(and (<= (+ cstrlen_~str.offset 22) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 22))), 53981#(and (<= (+ cstrlen_~str.offset 23) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 23))), 53982#(and (<= 23 |cstrlen_#res|) (<= |cstrlen_#res| 23)), 53983#(and (<= 23 |cstrstr_#t~ret13|) (<= |cstrstr_#t~ret13| 23)), 53984#(and (<= 23 cstrstr_~len~0) (<= cstrstr_~len~0 23)), 53985#(and (<= |cstrncmp_#in~n| 23) (<= 23 |cstrncmp_#in~n|)), 53986#(and (<= 23 cstrncmp_~n) (<= cstrncmp_~n 23)), 53987#(and (<= cstrncmp_~n 22) (<= 22 cstrncmp_~n)), 53988#(and (<= cstrncmp_~n 21) (<= 21 cstrncmp_~n)), 53989#(and (<= 20 cstrncmp_~n) (<= cstrncmp_~n 20)), 53990#(and (<= cstrncmp_~n 19) (<= 19 cstrncmp_~n)), 53991#(and (<= 18 cstrncmp_~n) (<= cstrncmp_~n 18)), 53992#(and (<= cstrncmp_~n 17) (<= 17 cstrncmp_~n)), 53993#(and (<= cstrncmp_~n 16) (<= 16 cstrncmp_~n)), 53994#(and (<= cstrncmp_~n 15) (<= 15 cstrncmp_~n)), 53995#(and (<= 14 cstrncmp_~n) (<= cstrncmp_~n 14)), 53996#(and (<= cstrncmp_~n 13) (<= 13 cstrncmp_~n)), 53997#(and (<= 12 cstrncmp_~n) (<= cstrncmp_~n 12)), 53998#(and (<= cstrncmp_~n 11) (<= 11 cstrncmp_~n)), 53999#(and (<= 10 cstrncmp_~n) (<= cstrncmp_~n 10)), 54000#(and (<= 9 cstrncmp_~n) (<= cstrncmp_~n 9)), 54001#(and (<= 8 cstrncmp_~n) (<= cstrncmp_~n 8)), 54002#(and (<= 7 cstrncmp_~n) (<= cstrncmp_~n 7)), 54003#(and (<= cstrncmp_~n 6) (<= 6 cstrncmp_~n)), 54004#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 54005#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 54006#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 54007#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 54008#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 54009#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|))] [2018-02-04 15:06:39,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3661 backedges. 299 proven. 3358 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:06:39,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-04 15:06:39,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-04 15:06:39,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 15:06:39,798 INFO L87 Difference]: Start difference. First operand 364 states and 440 transitions. Second operand 54 states. [2018-02-04 15:06:41,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:41,753 INFO L93 Difference]: Finished difference Result 755 states and 901 transitions. [2018-02-04 15:06:41,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 15:06:41,753 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 349 [2018-02-04 15:06:41,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:41,754 INFO L225 Difference]: With dead ends: 755 [2018-02-04 15:06:41,754 INFO L226 Difference]: Without dead ends: 369 [2018-02-04 15:06:41,755 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=205, Invalid=5957, Unknown=0, NotChecked=0, Total=6162 [2018-02-04 15:06:41,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-02-04 15:06:41,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 368. [2018-02-04 15:06:41,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-02-04 15:06:41,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 444 transitions. [2018-02-04 15:06:41,757 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 444 transitions. Word has length 349 [2018-02-04 15:06:41,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:41,757 INFO L432 AbstractCegarLoop]: Abstraction has 368 states and 444 transitions. [2018-02-04 15:06:41,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-04 15:06:41,757 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 444 transitions. [2018-02-04 15:06:41,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-02-04 15:06:41,758 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:41,758 INFO L351 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:06:41,758 INFO L371 AbstractCegarLoop]: === Iteration 101 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:06:41,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1036049513, now seen corresponding path program 46 times [2018-02-04 15:06:41,759 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:41,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3756 backedges. 1058 proven. 2698 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:43,558 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:43,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-02-04 15:06:43,558 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:43,559 INFO L182 omatonBuilderFactory]: Interpolants [55183#true, 55184#false, 55185#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 55186#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 55187#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 55188#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 55189#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 55190#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 55191#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 55192#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 55193#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 55194#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 55195#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 55196#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 55197#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 55198#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 55199#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 55200#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 55201#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 55202#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 15) cstrlen_~s~0.offset)), 55203#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 16) cstrlen_~s~0.offset)), 55204#(and (<= (+ |cstrlen_#in~str.offset| 17) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 55205#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 18) cstrlen_~s~0.offset)), 55206#(and (<= (+ |cstrlen_#in~str.offset| 19) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 55207#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 20) cstrlen_~s~0.offset)), 55208#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 21) cstrlen_~s~0.offset)), 55209#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 22) cstrlen_~s~0.offset)), 55210#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 23) cstrlen_~s~0.offset)), 55211#(and (<= (+ |cstrlen_#in~str.offset| 24) cstrlen_~s~0.offset) (= cstrlen_~s~0.base |cstrlen_#in~str.base|)), 55212#(<= (+ |cstrlen_#in~str.offset| 25) (select |#length| |cstrlen_#in~str.base|)), 55213#(<= (+ cstrstr_~find.offset 25) (select |#length| cstrstr_~find.base)), 55214#(<= (+ |cstrncmp_#in~s2.offset| 25) (select |#length| |cstrncmp_#in~s2.base|)), 55215#(<= (+ cstrncmp_~s2.offset 25) (select |#length| cstrncmp_~s2.base)), 55216#(<= (+ cstrncmp_~s2.offset 24) (select |#length| cstrncmp_~s2.base)), 55217#(<= (+ cstrncmp_~s2.offset 23) (select |#length| cstrncmp_~s2.base)), 55218#(<= (+ cstrncmp_~s2.offset 22) (select |#length| cstrncmp_~s2.base)), 55219#(<= (+ cstrncmp_~s2.offset 21) (select |#length| cstrncmp_~s2.base)), 55220#(<= (+ cstrncmp_~s2.offset 20) (select |#length| cstrncmp_~s2.base)), 55221#(<= (+ cstrncmp_~s2.offset 19) (select |#length| cstrncmp_~s2.base)), 55222#(<= (+ cstrncmp_~s2.offset 18) (select |#length| cstrncmp_~s2.base)), 55223#(<= (+ cstrncmp_~s2.offset 17) (select |#length| cstrncmp_~s2.base)), 55224#(<= (+ cstrncmp_~s2.offset 16) (select |#length| cstrncmp_~s2.base)), 55225#(<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)), 55226#(<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)), 55227#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 55228#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 55229#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 55230#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 55231#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 55232#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 55233#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 55234#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 55235#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 55236#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 55237#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 55238#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 55239#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 55240#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 55241#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 2 |cstrncmp_#t~post3.offset|))] [2018-02-04 15:06:43,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3756 backedges. 1058 proven. 2698 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:43,559 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 15:06:43,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 15:06:43,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=644, Invalid=2778, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 15:06:43,559 INFO L87 Difference]: Start difference. First operand 368 states and 444 transitions. Second operand 59 states. [2018-02-04 15:06:46,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:46,171 INFO L93 Difference]: Finished difference Result 591 states and 670 transitions. [2018-02-04 15:06:46,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-02-04 15:06:46,171 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 353 [2018-02-04 15:06:46,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:46,173 INFO L225 Difference]: With dead ends: 591 [2018-02-04 15:06:46,173 INFO L226 Difference]: Without dead ends: 591 [2018-02-04 15:06:46,174 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5254 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3402, Invalid=14420, Unknown=0, NotChecked=0, Total=17822 [2018-02-04 15:06:46,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2018-02-04 15:06:46,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 376. [2018-02-04 15:06:46,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-02-04 15:06:46,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 454 transitions. [2018-02-04 15:06:46,179 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 454 transitions. Word has length 353 [2018-02-04 15:06:46,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:46,179 INFO L432 AbstractCegarLoop]: Abstraction has 376 states and 454 transitions. [2018-02-04 15:06:46,179 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 15:06:46,179 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 454 transitions. [2018-02-04 15:06:46,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-02-04 15:06:46,181 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:46,181 INFO L351 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:06:46,181 INFO L371 AbstractCegarLoop]: === Iteration 102 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:06:46,181 INFO L82 PathProgramCache]: Analyzing trace with hash 2143360939, now seen corresponding path program 24 times [2018-02-04 15:06:46,182 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:46,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:48,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3780 backedges. 1058 proven. 2722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:48,030 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:48,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-02-04 15:06:48,031 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:48,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:48,031 INFO L182 omatonBuilderFactory]: Interpolants [56360#true, 56361#false, 56362#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 56363#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 56364#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 56365#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 56366#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 56367#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 56368#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 56369#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 56370#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 56371#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 56372#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 56373#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 56374#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 56375#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 56376#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 56377#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 56378#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 56379#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 15) cstrlen_~s~0.offset)), 56380#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 16) cstrlen_~s~0.offset)), 56381#(and (<= (+ |cstrlen_#in~str.offset| 17) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 56382#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 18) cstrlen_~s~0.offset)), 56383#(and (<= (+ |cstrlen_#in~str.offset| 19) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 56384#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 20) cstrlen_~s~0.offset)), 56385#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 21) cstrlen_~s~0.offset)), 56386#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 22) cstrlen_~s~0.offset)), 56387#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 23) cstrlen_~s~0.offset)), 56388#(and (<= (+ |cstrlen_#in~str.offset| 24) cstrlen_~s~0.offset) (= cstrlen_~s~0.base |cstrlen_#in~str.base|)), 56389#(<= (+ |cstrlen_#in~str.offset| 25) (select |#length| |cstrlen_#in~str.base|)), 56390#(<= (+ cstrstr_~find.offset 25) (select |#length| cstrstr_~find.base)), 56391#(<= (+ |cstrncmp_#in~s2.offset| 25) (select |#length| |cstrncmp_#in~s2.base|)), 56392#(<= (+ cstrncmp_~s2.offset 25) (select |#length| cstrncmp_~s2.base)), 56393#(<= (+ cstrncmp_~s2.offset 24) (select |#length| cstrncmp_~s2.base)), 56394#(<= (+ cstrncmp_~s2.offset 23) (select |#length| cstrncmp_~s2.base)), 56395#(<= (+ cstrncmp_~s2.offset 22) (select |#length| cstrncmp_~s2.base)), 56396#(<= (+ cstrncmp_~s2.offset 21) (select |#length| cstrncmp_~s2.base)), 56397#(<= (+ cstrncmp_~s2.offset 20) (select |#length| cstrncmp_~s2.base)), 56398#(<= (+ cstrncmp_~s2.offset 19) (select |#length| cstrncmp_~s2.base)), 56399#(<= (+ cstrncmp_~s2.offset 18) (select |#length| cstrncmp_~s2.base)), 56400#(<= (+ cstrncmp_~s2.offset 17) (select |#length| cstrncmp_~s2.base)), 56401#(<= (+ cstrncmp_~s2.offset 16) (select |#length| cstrncmp_~s2.base)), 56402#(<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)), 56403#(<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)), 56404#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 56405#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 56406#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 56407#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 56408#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 56409#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 56410#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 56411#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 56412#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 56413#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 56414#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 56415#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 56416#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 56417#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 56418#(and (<= 3 cstrncmp_~s2.offset) (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base))), 56419#(and (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|)) (<= 2 |cstrncmp_#t~pre6.offset|))] [2018-02-04 15:06:48,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3780 backedges. 1058 proven. 2722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:48,032 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-04 15:06:48,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-04 15:06:48,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=646, Invalid=2894, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 15:06:48,032 INFO L87 Difference]: Start difference. First operand 376 states and 454 transitions. Second operand 60 states. [2018-02-04 15:06:51,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:51,321 INFO L93 Difference]: Finished difference Result 605 states and 686 transitions. [2018-02-04 15:06:51,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-02-04 15:06:51,321 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 357 [2018-02-04 15:06:51,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:51,322 INFO L225 Difference]: With dead ends: 605 [2018-02-04 15:06:51,323 INFO L226 Difference]: Without dead ends: 605 [2018-02-04 15:06:51,324 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7707 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4272, Invalid=20220, Unknown=0, NotChecked=0, Total=24492 [2018-02-04 15:06:51,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-02-04 15:06:51,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 377. [2018-02-04 15:06:51,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-02-04 15:06:51,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 456 transitions. [2018-02-04 15:06:51,327 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 456 transitions. Word has length 357 [2018-02-04 15:06:51,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:51,327 INFO L432 AbstractCegarLoop]: Abstraction has 377 states and 456 transitions. [2018-02-04 15:06:51,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-04 15:06:51,327 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 456 transitions. [2018-02-04 15:06:51,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-02-04 15:06:51,329 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:51,329 INFO L351 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:06:51,329 INFO L371 AbstractCegarLoop]: === Iteration 103 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:06:51,329 INFO L82 PathProgramCache]: Analyzing trace with hash 992129916, now seen corresponding path program 47 times [2018-02-04 15:06:51,330 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:51,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:52,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 312 proven. 3660 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:06:52,830 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:52,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-02-04 15:06:52,830 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:52,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:52,831 INFO L182 omatonBuilderFactory]: Interpolants [57600#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 57601#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 57602#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 57603#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 57604#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 57605#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 6)) (<= (+ cstrlen_~str.offset 6) cstrlen_~s~0.offset)), 57606#(and (<= (+ cstrlen_~str.offset 7) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 7))), 57607#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 8)) (<= (+ cstrlen_~str.offset 8) cstrlen_~s~0.offset)), 57608#(and (<= (+ cstrlen_~str.offset 9) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 9))), 57609#(and (<= (+ cstrlen_~str.offset 10) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 10))), 57610#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 11)) (<= (+ cstrlen_~str.offset 11) cstrlen_~s~0.offset)), 57611#(and (<= (+ cstrlen_~str.offset 12) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 12))), 57612#(and (<= (+ cstrlen_~str.offset 13) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 13))), 57613#(and (<= (+ cstrlen_~str.offset 14) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 14))), 57614#(and (<= (+ cstrlen_~str.offset 15) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 15))), 57615#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 16)) (<= (+ cstrlen_~str.offset 16) cstrlen_~s~0.offset)), 57616#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 17)) (<= (+ cstrlen_~str.offset 17) cstrlen_~s~0.offset)), 57617#(and (<= (+ cstrlen_~str.offset 18) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 18))), 57618#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 19)) (<= (+ cstrlen_~str.offset 19) cstrlen_~s~0.offset)), 57619#(and (<= (+ cstrlen_~str.offset 20) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 20))), 57620#(and (<= (+ cstrlen_~str.offset 21) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 21))), 57621#(and (<= (+ cstrlen_~str.offset 22) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 22))), 57622#(and (<= (+ cstrlen_~str.offset 23) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 23))), 57623#(and (<= (+ cstrlen_~str.offset 24) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 24))), 57624#(and (<= 24 |cstrlen_#res|) (<= |cstrlen_#res| 24)), 57625#(and (<= |cstrstr_#t~ret13| 24) (<= 24 |cstrstr_#t~ret13|)), 57626#(and (<= cstrstr_~len~0 24) (<= 24 cstrstr_~len~0)), 57627#(and (<= |cstrncmp_#in~n| 24) (<= 24 |cstrncmp_#in~n|)), 57628#(and (<= cstrncmp_~n 24) (<= 24 cstrncmp_~n)), 57629#(and (<= 23 cstrncmp_~n) (<= cstrncmp_~n 23)), 57630#(and (<= cstrncmp_~n 22) (<= 22 cstrncmp_~n)), 57631#(and (<= cstrncmp_~n 21) (<= 21 cstrncmp_~n)), 57632#(and (<= 20 cstrncmp_~n) (<= cstrncmp_~n 20)), 57633#(and (<= cstrncmp_~n 19) (<= 19 cstrncmp_~n)), 57634#(and (<= 18 cstrncmp_~n) (<= cstrncmp_~n 18)), 57635#(and (<= cstrncmp_~n 17) (<= 17 cstrncmp_~n)), 57636#(and (<= cstrncmp_~n 16) (<= 16 cstrncmp_~n)), 57637#(and (<= cstrncmp_~n 15) (<= 15 cstrncmp_~n)), 57638#(and (<= 14 cstrncmp_~n) (<= cstrncmp_~n 14)), 57639#(and (<= cstrncmp_~n 13) (<= 13 cstrncmp_~n)), 57640#(and (<= 12 cstrncmp_~n) (<= cstrncmp_~n 12)), 57641#(and (<= cstrncmp_~n 11) (<= 11 cstrncmp_~n)), 57642#(and (<= 10 cstrncmp_~n) (<= cstrncmp_~n 10)), 57643#(and (<= 9 cstrncmp_~n) (<= cstrncmp_~n 9)), 57644#(and (<= 8 cstrncmp_~n) (<= cstrncmp_~n 8)), 57645#(and (<= 7 cstrncmp_~n) (<= cstrncmp_~n 7)), 57646#(and (<= cstrncmp_~n 6) (<= 6 cstrncmp_~n)), 57647#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 57648#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 57649#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 57650#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 57651#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 57652#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|)), 57597#true, 57598#false, 57599#(= cstrlen_~s~0.offset cstrlen_~str.offset)] [2018-02-04 15:06:52,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 312 proven. 3660 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:06:52,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 15:06:52,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 15:06:52,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 15:06:52,831 INFO L87 Difference]: Start difference. First operand 377 states and 456 transitions. Second operand 56 states. [2018-02-04 15:06:54,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:54,982 INFO L93 Difference]: Finished difference Result 784 states and 936 transitions. [2018-02-04 15:06:54,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 15:06:54,982 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 362 [2018-02-04 15:06:54,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:54,983 INFO L225 Difference]: With dead ends: 784 [2018-02-04 15:06:54,983 INFO L226 Difference]: Without dead ends: 382 [2018-02-04 15:06:54,983 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=213, Invalid=6429, Unknown=0, NotChecked=0, Total=6642 [2018-02-04 15:06:54,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-02-04 15:06:54,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2018-02-04 15:06:54,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-02-04 15:06:54,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 460 transitions. [2018-02-04 15:06:54,985 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 460 transitions. Word has length 362 [2018-02-04 15:06:54,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:54,985 INFO L432 AbstractCegarLoop]: Abstraction has 381 states and 460 transitions. [2018-02-04 15:06:54,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 15:06:54,985 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 460 transitions. [2018-02-04 15:06:54,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-02-04 15:06:54,986 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:54,987 INFO L351 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:06:54,987 INFO L371 AbstractCegarLoop]: === Iteration 104 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:06:54,988 INFO L82 PathProgramCache]: Analyzing trace with hash 125176601, now seen corresponding path program 48 times [2018-02-04 15:06:54,988 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:55,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:06:56,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4075 backedges. 1152 proven. 2923 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:56,852 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:06:56,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-02-04 15:06:56,852 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:06:56,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:56,853 INFO L182 omatonBuilderFactory]: Interpolants [58880#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 58881#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 58882#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 58883#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 58884#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 58885#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 58886#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 58887#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 58888#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 58889#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 15) cstrlen_~s~0.offset)), 58890#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 16) cstrlen_~s~0.offset)), 58891#(and (<= (+ |cstrlen_#in~str.offset| 17) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 58892#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 18) cstrlen_~s~0.offset)), 58893#(and (<= (+ |cstrlen_#in~str.offset| 19) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 58894#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 20) cstrlen_~s~0.offset)), 58895#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 21) cstrlen_~s~0.offset)), 58896#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 22) cstrlen_~s~0.offset)), 58897#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 23) cstrlen_~s~0.offset)), 58898#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 24) cstrlen_~s~0.offset)), 58899#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 25) cstrlen_~s~0.offset)), 58900#(<= (+ |cstrlen_#in~str.offset| 26) (select |#length| |cstrlen_#in~str.base|)), 58901#(<= (+ cstrstr_~find.offset 26) (select |#length| cstrstr_~find.base)), 58902#(<= (+ |cstrncmp_#in~s2.offset| 26) (select |#length| |cstrncmp_#in~s2.base|)), 58903#(<= (+ cstrncmp_~s2.offset 26) (select |#length| cstrncmp_~s2.base)), 58904#(<= (+ cstrncmp_~s2.offset 25) (select |#length| cstrncmp_~s2.base)), 58905#(<= (+ cstrncmp_~s2.offset 24) (select |#length| cstrncmp_~s2.base)), 58906#(<= (+ cstrncmp_~s2.offset 23) (select |#length| cstrncmp_~s2.base)), 58907#(<= (+ cstrncmp_~s2.offset 22) (select |#length| cstrncmp_~s2.base)), 58908#(<= (+ cstrncmp_~s2.offset 21) (select |#length| cstrncmp_~s2.base)), 58909#(<= (+ cstrncmp_~s2.offset 20) (select |#length| cstrncmp_~s2.base)), 58910#(<= (+ cstrncmp_~s2.offset 19) (select |#length| cstrncmp_~s2.base)), 58911#(<= (+ cstrncmp_~s2.offset 18) (select |#length| cstrncmp_~s2.base)), 58912#(<= (+ cstrncmp_~s2.offset 17) (select |#length| cstrncmp_~s2.base)), 58913#(<= (+ cstrncmp_~s2.offset 16) (select |#length| cstrncmp_~s2.base)), 58914#(<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)), 58915#(<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)), 58916#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 58917#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 58918#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 58919#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 58920#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 58921#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 58922#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 58923#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 58924#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 58925#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 58926#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 58927#(<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)), 58928#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 58929#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 58930#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 1 |cstrncmp_#t~post3.offset|)), 58870#true, 58871#false, 58872#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 58873#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 58874#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 58875#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 58876#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 58877#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 58878#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 58879#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset))] [2018-02-04 15:06:56,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4075 backedges. 1152 proven. 2923 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:06:56,853 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-04 15:06:56,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-04 15:06:56,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=719, Invalid=2941, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 15:06:56,853 INFO L87 Difference]: Start difference. First operand 381 states and 460 transitions. Second operand 61 states. [2018-02-04 15:06:59,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:06:59,404 INFO L93 Difference]: Finished difference Result 615 states and 697 transitions. [2018-02-04 15:06:59,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-02-04 15:06:59,404 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 366 [2018-02-04 15:06:59,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:06:59,406 INFO L225 Difference]: With dead ends: 615 [2018-02-04 15:06:59,406 INFO L226 Difference]: Without dead ends: 615 [2018-02-04 15:06:59,407 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5792 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3882, Invalid=15578, Unknown=0, NotChecked=0, Total=19460 [2018-02-04 15:06:59,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-02-04 15:06:59,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 389. [2018-02-04 15:06:59,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-02-04 15:06:59,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 470 transitions. [2018-02-04 15:06:59,410 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 470 transitions. Word has length 366 [2018-02-04 15:06:59,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:06:59,410 INFO L432 AbstractCegarLoop]: Abstraction has 389 states and 470 transitions. [2018-02-04 15:06:59,410 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-04 15:06:59,410 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 470 transitions. [2018-02-04 15:06:59,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-02-04 15:06:59,411 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:06:59,411 INFO L351 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:06:59,412 INFO L371 AbstractCegarLoop]: === Iteration 105 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:06:59,412 INFO L82 PathProgramCache]: Analyzing trace with hash -119574949, now seen corresponding path program 25 times [2018-02-04 15:06:59,412 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:06:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:06:59,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:01,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4100 backedges. 1152 proven. 2948 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:01,525 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:01,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-02-04 15:07:01,525 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:01,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:01,526 INFO L182 omatonBuilderFactory]: Interpolants [60094#true, 60095#false, 60096#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 60097#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 60098#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 60099#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 60100#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 60101#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 60102#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 60103#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 60104#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 60105#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 60106#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 60107#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 60108#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 60109#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 60110#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 60111#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 60112#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 60113#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 15) cstrlen_~s~0.offset)), 60114#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 16) cstrlen_~s~0.offset)), 60115#(and (<= (+ |cstrlen_#in~str.offset| 17) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 60116#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 18) cstrlen_~s~0.offset)), 60117#(and (<= (+ |cstrlen_#in~str.offset| 19) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 60118#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 20) cstrlen_~s~0.offset)), 60119#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 21) cstrlen_~s~0.offset)), 60120#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 22) cstrlen_~s~0.offset)), 60121#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 23) cstrlen_~s~0.offset)), 60122#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 24) cstrlen_~s~0.offset)), 60123#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 25) cstrlen_~s~0.offset)), 60124#(<= (+ |cstrlen_#in~str.offset| 26) (select |#length| |cstrlen_#in~str.base|)), 60125#(<= (+ cstrstr_~find.offset 26) (select |#length| cstrstr_~find.base)), 60126#(<= (+ |cstrncmp_#in~s2.offset| 26) (select |#length| |cstrncmp_#in~s2.base|)), 60127#(<= (+ cstrncmp_~s2.offset 26) (select |#length| cstrncmp_~s2.base)), 60128#(<= (+ cstrncmp_~s2.offset 25) (select |#length| cstrncmp_~s2.base)), 60129#(<= (+ cstrncmp_~s2.offset 24) (select |#length| cstrncmp_~s2.base)), 60130#(<= (+ cstrncmp_~s2.offset 23) (select |#length| cstrncmp_~s2.base)), 60131#(<= (+ cstrncmp_~s2.offset 22) (select |#length| cstrncmp_~s2.base)), 60132#(<= (+ cstrncmp_~s2.offset 21) (select |#length| cstrncmp_~s2.base)), 60133#(<= (+ cstrncmp_~s2.offset 20) (select |#length| cstrncmp_~s2.base)), 60134#(<= (+ cstrncmp_~s2.offset 19) (select |#length| cstrncmp_~s2.base)), 60135#(<= (+ cstrncmp_~s2.offset 18) (select |#length| cstrncmp_~s2.base)), 60136#(<= (+ cstrncmp_~s2.offset 17) (select |#length| cstrncmp_~s2.base)), 60137#(<= (+ cstrncmp_~s2.offset 16) (select |#length| cstrncmp_~s2.base)), 60138#(<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)), 60139#(<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)), 60140#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 60141#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 60142#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 60143#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 60144#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 60145#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 60146#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 60147#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 60148#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 60149#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 60150#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 60151#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 60152#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 2 cstrncmp_~s2.offset)), 60153#(and (<= 3 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 60154#(and (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base)) (<= 4 cstrncmp_~s2.offset)), 60155#(and (<= 3 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|)))] [2018-02-04 15:07:01,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4100 backedges. 1152 proven. 2948 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:01,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-04 15:07:01,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-04 15:07:01,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=674, Invalid=3108, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 15:07:01,527 INFO L87 Difference]: Start difference. First operand 389 states and 470 transitions. Second operand 62 states. [2018-02-04 15:07:05,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:05,390 INFO L93 Difference]: Finished difference Result 625 states and 709 transitions. [2018-02-04 15:07:05,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-02-04 15:07:05,390 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 370 [2018-02-04 15:07:05,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:05,391 INFO L225 Difference]: With dead ends: 625 [2018-02-04 15:07:05,391 INFO L226 Difference]: Without dead ends: 625 [2018-02-04 15:07:05,392 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8001 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4323, Invalid=21117, Unknown=0, NotChecked=0, Total=25440 [2018-02-04 15:07:05,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-02-04 15:07:05,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 390. [2018-02-04 15:07:05,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-02-04 15:07:05,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 472 transitions. [2018-02-04 15:07:05,395 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 472 transitions. Word has length 370 [2018-02-04 15:07:05,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:05,395 INFO L432 AbstractCegarLoop]: Abstraction has 390 states and 472 transitions. [2018-02-04 15:07:05,395 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-04 15:07:05,395 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 472 transitions. [2018-02-04 15:07:05,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-02-04 15:07:05,396 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:05,396 INFO L351 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:07:05,396 INFO L371 AbstractCegarLoop]: === Iteration 106 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:07:05,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1310782772, now seen corresponding path program 49 times [2018-02-04 15:07:05,397 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:05,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:06,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4304 backedges. 325 proven. 3975 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:07:06,895 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:06,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-02-04 15:07:06,895 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:06,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:06,896 INFO L182 omatonBuilderFactory]: Interpolants [61368#true, 61369#false, 61370#(= cstrlen_~s~0.offset cstrlen_~str.offset), 61371#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 61372#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 61373#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 61374#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 61375#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 61376#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 6)) (<= (+ cstrlen_~str.offset 6) cstrlen_~s~0.offset)), 61377#(and (<= (+ cstrlen_~str.offset 7) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 7))), 61378#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 8)) (<= (+ cstrlen_~str.offset 8) cstrlen_~s~0.offset)), 61379#(and (<= (+ cstrlen_~str.offset 9) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 9))), 61380#(and (<= (+ cstrlen_~str.offset 10) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 10))), 61381#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 11)) (<= (+ cstrlen_~str.offset 11) cstrlen_~s~0.offset)), 61382#(and (<= (+ cstrlen_~str.offset 12) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 12))), 61383#(and (<= (+ cstrlen_~str.offset 13) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 13))), 61384#(and (<= (+ cstrlen_~str.offset 14) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 14))), 61385#(and (<= (+ cstrlen_~str.offset 15) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 15))), 61386#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 16)) (<= (+ cstrlen_~str.offset 16) cstrlen_~s~0.offset)), 61387#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 17)) (<= (+ cstrlen_~str.offset 17) cstrlen_~s~0.offset)), 61388#(and (<= (+ cstrlen_~str.offset 18) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 18))), 61389#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 19)) (<= (+ cstrlen_~str.offset 19) cstrlen_~s~0.offset)), 61390#(and (<= (+ cstrlen_~str.offset 20) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 20))), 61391#(and (<= (+ cstrlen_~str.offset 21) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 21))), 61392#(and (<= (+ cstrlen_~str.offset 22) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 22))), 61393#(and (<= (+ cstrlen_~str.offset 23) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 23))), 61394#(and (<= (+ cstrlen_~str.offset 24) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 24))), 61395#(and (<= (+ cstrlen_~str.offset 25) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 25))), 61396#(and (<= |cstrlen_#res| 25) (<= 25 |cstrlen_#res|)), 61397#(and (<= |cstrstr_#t~ret13| 25) (<= 25 |cstrstr_#t~ret13|)), 61398#(and (<= 25 cstrstr_~len~0) (<= cstrstr_~len~0 25)), 61399#(and (<= |cstrncmp_#in~n| 25) (<= 25 |cstrncmp_#in~n|)), 61400#(and (<= cstrncmp_~n 25) (<= 25 cstrncmp_~n)), 61401#(and (<= cstrncmp_~n 24) (<= 24 cstrncmp_~n)), 61402#(and (<= 23 cstrncmp_~n) (<= cstrncmp_~n 23)), 61403#(and (<= cstrncmp_~n 22) (<= 22 cstrncmp_~n)), 61404#(and (<= cstrncmp_~n 21) (<= 21 cstrncmp_~n)), 61405#(and (<= 20 cstrncmp_~n) (<= cstrncmp_~n 20)), 61406#(and (<= cstrncmp_~n 19) (<= 19 cstrncmp_~n)), 61407#(and (<= 18 cstrncmp_~n) (<= cstrncmp_~n 18)), 61408#(and (<= cstrncmp_~n 17) (<= 17 cstrncmp_~n)), 61409#(and (<= cstrncmp_~n 16) (<= 16 cstrncmp_~n)), 61410#(and (<= cstrncmp_~n 15) (<= 15 cstrncmp_~n)), 61411#(and (<= 14 cstrncmp_~n) (<= cstrncmp_~n 14)), 61412#(and (<= cstrncmp_~n 13) (<= 13 cstrncmp_~n)), 61413#(and (<= 12 cstrncmp_~n) (<= cstrncmp_~n 12)), 61414#(and (<= cstrncmp_~n 11) (<= 11 cstrncmp_~n)), 61415#(and (<= 10 cstrncmp_~n) (<= cstrncmp_~n 10)), 61416#(and (<= 9 cstrncmp_~n) (<= cstrncmp_~n 9)), 61417#(and (<= 8 cstrncmp_~n) (<= cstrncmp_~n 8)), 61418#(and (<= 7 cstrncmp_~n) (<= cstrncmp_~n 7)), 61419#(and (<= cstrncmp_~n 6) (<= 6 cstrncmp_~n)), 61420#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 61421#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 61422#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 61423#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 61424#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 61425#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|))] [2018-02-04 15:07:06,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4304 backedges. 325 proven. 3975 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:07:06,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 15:07:06,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 15:07:06,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 15:07:06,896 INFO L87 Difference]: Start difference. First operand 390 states and 472 transitions. Second operand 58 states. [2018-02-04 15:07:09,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:09,209 INFO L93 Difference]: Finished difference Result 813 states and 971 transitions. [2018-02-04 15:07:09,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 15:07:09,209 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 375 [2018-02-04 15:07:09,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:09,210 INFO L225 Difference]: With dead ends: 813 [2018-02-04 15:07:09,210 INFO L226 Difference]: Without dead ends: 395 [2018-02-04 15:07:09,210 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=221, Invalid=6919, Unknown=0, NotChecked=0, Total=7140 [2018-02-04 15:07:09,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-02-04 15:07:09,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 394. [2018-02-04 15:07:09,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-02-04 15:07:09,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 476 transitions. [2018-02-04 15:07:09,213 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 476 transitions. Word has length 375 [2018-02-04 15:07:09,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:09,213 INFO L432 AbstractCegarLoop]: Abstraction has 394 states and 476 transitions. [2018-02-04 15:07:09,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 15:07:09,213 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 476 transitions. [2018-02-04 15:07:09,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-02-04 15:07:09,214 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:09,214 INFO L351 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:07:09,214 INFO L371 AbstractCegarLoop]: === Iteration 107 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:07:09,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1460290993, now seen corresponding path program 50 times [2018-02-04 15:07:09,215 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:09,249 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:11,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4407 backedges. 1250 proven. 3157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:11,237 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:11,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-02-04 15:07:11,237 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:11,238 INFO L182 omatonBuilderFactory]: Interpolants [62720#(<= (+ |cstrncmp_#in~s2.offset| 27) (select |#length| |cstrncmp_#in~s2.base|)), 62721#(<= (+ cstrncmp_~s2.offset 27) (select |#length| cstrncmp_~s2.base)), 62722#(<= (+ cstrncmp_~s2.offset 26) (select |#length| cstrncmp_~s2.base)), 62723#(<= (+ cstrncmp_~s2.offset 25) (select |#length| cstrncmp_~s2.base)), 62724#(<= (+ cstrncmp_~s2.offset 24) (select |#length| cstrncmp_~s2.base)), 62725#(<= (+ cstrncmp_~s2.offset 23) (select |#length| cstrncmp_~s2.base)), 62726#(<= (+ cstrncmp_~s2.offset 22) (select |#length| cstrncmp_~s2.base)), 62727#(<= (+ cstrncmp_~s2.offset 21) (select |#length| cstrncmp_~s2.base)), 62728#(<= (+ cstrncmp_~s2.offset 20) (select |#length| cstrncmp_~s2.base)), 62729#(<= (+ cstrncmp_~s2.offset 19) (select |#length| cstrncmp_~s2.base)), 62730#(<= (+ cstrncmp_~s2.offset 18) (select |#length| cstrncmp_~s2.base)), 62731#(<= (+ cstrncmp_~s2.offset 17) (select |#length| cstrncmp_~s2.base)), 62732#(<= (+ cstrncmp_~s2.offset 16) (select |#length| cstrncmp_~s2.base)), 62733#(<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)), 62734#(<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)), 62735#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 62736#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 62737#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 62738#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 62739#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 62740#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 62741#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 62742#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 62743#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 62744#(and (<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 62745#(and (<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 62746#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 2 cstrncmp_~s2.offset)), 62747#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 3 cstrncmp_~s2.offset)), 62748#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 4 cstrncmp_~s2.offset)), 62749#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 4 |cstrncmp_#t~post3.offset|)), 62687#true, 62688#false, 62689#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 62690#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 62691#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 62692#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 62693#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 62694#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 62695#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 62696#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 62697#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 62698#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 62699#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 62700#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 62701#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 62702#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 62703#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 62704#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 62705#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 62706#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 15) cstrlen_~s~0.offset)), 62707#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 16) cstrlen_~s~0.offset)), 62708#(and (<= (+ |cstrlen_#in~str.offset| 17) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 62709#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 18) cstrlen_~s~0.offset)), 62710#(and (<= (+ |cstrlen_#in~str.offset| 19) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 62711#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 20) cstrlen_~s~0.offset)), 62712#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 21) cstrlen_~s~0.offset)), 62713#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 22) cstrlen_~s~0.offset)), 62714#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 23) cstrlen_~s~0.offset)), 62715#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 24) cstrlen_~s~0.offset)), 62716#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 25) cstrlen_~s~0.offset)), 62717#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 26) cstrlen_~s~0.offset)), 62718#(<= (+ |cstrlen_#in~str.offset| 27) (select |#length| |cstrlen_#in~str.base|)), 62719#(<= (+ cstrstr_~find.offset 27) (select |#length| cstrstr_~find.base))] [2018-02-04 15:07:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4407 backedges. 1250 proven. 3157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:11,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-04 15:07:11,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-04 15:07:11,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=3205, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 15:07:11,239 INFO L87 Difference]: Start difference. First operand 394 states and 476 transitions. Second operand 63 states. [2018-02-04 15:07:14,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:14,478 INFO L93 Difference]: Finished difference Result 631 states and 716 transitions. [2018-02-04 15:07:14,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-02-04 15:07:14,479 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 379 [2018-02-04 15:07:14,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:14,479 INFO L225 Difference]: With dead ends: 631 [2018-02-04 15:07:14,479 INFO L226 Difference]: Without dead ends: 631 [2018-02-04 15:07:14,480 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5962 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3567, Invalid=16455, Unknown=0, NotChecked=0, Total=20022 [2018-02-04 15:07:14,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2018-02-04 15:07:14,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 402. [2018-02-04 15:07:14,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-02-04 15:07:14,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 486 transitions. [2018-02-04 15:07:14,483 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 486 transitions. Word has length 379 [2018-02-04 15:07:14,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:14,483 INFO L432 AbstractCegarLoop]: Abstraction has 402 states and 486 transitions. [2018-02-04 15:07:14,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-04 15:07:14,483 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 486 transitions. [2018-02-04 15:07:14,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-02-04 15:07:14,484 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:14,484 INFO L351 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 15:07:14,484 INFO L371 AbstractCegarLoop]: === Iteration 108 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 15:07:14,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1743295121, now seen corresponding path program 26 times [2018-02-04 15:07:14,484 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:14,515 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-04 15:07:15,219 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:267) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:203) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-04 15:07:15,222 INFO L168 Benchmark]: Toolchain (without parser) took 174519.60 ms. Allocated memory was 403.7 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 360.4 MB in the beginning and 1.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-02-04 15:07:15,223 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 403.7 MB. Free memory is still 367.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 15:07:15,223 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.71 ms. Allocated memory is still 403.7 MB. Free memory was 360.4 MB in the beginning and 349.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-02-04 15:07:15,223 INFO L168 Benchmark]: Boogie Preprocessor took 27.61 ms. Allocated memory is still 403.7 MB. Free memory was 349.7 MB in the beginning and 348.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 15:07:15,224 INFO L168 Benchmark]: RCFGBuilder took 342.03 ms. Allocated memory is still 403.7 MB. Free memory was 348.4 MB in the beginning and 320.6 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. [2018-02-04 15:07:15,224 INFO L168 Benchmark]: TraceAbstraction took 174002.73 ms. Allocated memory was 403.7 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 319.2 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-02-04 15:07:15,225 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.13 ms. Allocated memory is still 403.7 MB. Free memory is still 367.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 144.71 ms. Allocated memory is still 403.7 MB. Free memory was 360.4 MB in the beginning and 349.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.61 ms. Allocated memory is still 403.7 MB. Free memory was 349.7 MB in the beginning and 348.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 342.03 ms. Allocated memory is still 403.7 MB. Free memory was 348.4 MB in the beginning and 320.6 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 174002.73 ms. Allocated memory was 403.7 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 319.2 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_15-07-15-232.csv Completed graceful shutdown