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-ccafca9-m [2018-02-04 01:50:09,066 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 01:50:09,067 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 01:50:09,077 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 01:50:09,077 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 01:50:09,078 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 01:50:09,079 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 01:50:09,081 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 01:50:09,082 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 01:50:09,083 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 01:50:09,084 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 01:50:09,084 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 01:50:09,085 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 01:50:09,086 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 01:50:09,087 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 01:50:09,088 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 01:50:09,090 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 01:50:09,091 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 01:50:09,092 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 01:50:09,093 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 01:50:09,095 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 01:50:09,095 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 01:50:09,096 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 01:50:09,096 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 01:50:09,097 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 01:50:09,098 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 01:50:09,098 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 01:50:09,099 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 01:50:09,099 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 01:50:09,099 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 01:50:09,099 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 01:50:09,100 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 01:50:09,110 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 01:50:09,110 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 01:50:09,111 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 01:50:09,111 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 01:50:09,111 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 01:50:09,111 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 01:50:09,112 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 01:50:09,112 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 01:50:09,112 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 01:50:09,112 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 01:50:09,112 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 01:50:09,112 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 01:50:09,113 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 01:50:09,113 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 01:50:09,113 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 01:50:09,113 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 01:50:09,113 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 01:50:09,113 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 01:50:09,114 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 01:50:09,114 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 01:50:09,114 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:50:09,114 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 01:50:09,114 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 01:50:09,142 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 01:50:09,156 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 01:50:09,160 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 01:50:09,161 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 01:50:09,161 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 01:50:09,162 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 01:50:09,305 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 01:50:09,306 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 01:50:09,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 01:50:09,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 01:50:09,312 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 01:50:09,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:50:09" (1/1) ... [2018-02-04 01:50:09,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ba94080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:50:09, skipping insertion in model container [2018-02-04 01:50:09,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:50:09" (1/1) ... [2018-02-04 01:50:09,330 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:50:09,357 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:50:09,464 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:50:09,476 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:50:09,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:50:09 WrapperNode [2018-02-04 01:50:09,482 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 01:50:09,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 01:50:09,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 01:50:09,483 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 01:50:09,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:50:09" (1/1) ... [2018-02-04 01:50:09,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:50:09" (1/1) ... [2018-02-04 01:50:09,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:50:09" (1/1) ... [2018-02-04 01:50:09,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:50:09" (1/1) ... [2018-02-04 01:50:09,507 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:50:09" (1/1) ... [2018-02-04 01:50:09,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:50:09" (1/1) ... [2018-02-04 01:50:09,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:50:09" (1/1) ... [2018-02-04 01:50:09,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 01:50:09,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 01:50:09,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 01:50:09,513 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 01:50:09,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:50:09" (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 01:50:09,550 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 01:50:09,550 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 01:50:09,550 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-02-04 01:50:09,550 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-02-04 01:50:09,550 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrstr [2018-02-04 01:50:09,550 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 01:50:09,550 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 01:50:09,550 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 01:50:09,550 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 01:50:09,551 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 01:50:09,551 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 01:50:09,551 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 01:50:09,551 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-02-04 01:50:09,551 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-02-04 01:50:09,551 INFO L128 BoogieDeclarations]: Found specification of procedure cstrstr [2018-02-04 01:50:09,551 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 01:50:09,551 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 01:50:09,551 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 01:50:09,779 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 01:50:09,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:50:09 BoogieIcfgContainer [2018-02-04 01:50:09,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 01:50:09,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 01:50:09,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 01:50:09,783 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 01:50:09,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:50:09" (1/3) ... [2018-02-04 01:50:09,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3889824c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:50:09, skipping insertion in model container [2018-02-04 01:50:09,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:50:09" (2/3) ... [2018-02-04 01:50:09,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3889824c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:50:09, skipping insertion in model container [2018-02-04 01:50:09,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:50:09" (3/3) ... [2018-02-04 01:50:09,786 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-02-04 01:50:09,793 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 01:50:09,798 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-02-04 01:50:09,829 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 01:50:09,829 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 01:50:09,829 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 01:50:09,829 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 01:50:09,829 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 01:50:09,830 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 01:50:09,830 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 01:50:09,830 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 01:50:09,830 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 01:50:09,842 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2018-02-04 01:50:09,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 01:50:09,850 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:09,850 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:50:09,851 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 01:50:09,855 INFO L82 PathProgramCache]: Analyzing trace with hash -718609434, now seen corresponding path program 1 times [2018-02-04 01:50:09,902 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:09,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:10,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:10,057 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:50:10,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:50:10,059 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:10,059 INFO 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 01:50:10,063 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 01:50:10,063 INFO 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 01:50:10,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:50:10,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:50:10,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:50:10,078 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 4 states. [2018-02-04 01:50:10,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:10,231 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-02-04 01:50:10,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:50:10,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 01:50:10,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:10,238 INFO L225 Difference]: With dead ends: 89 [2018-02-04 01:50:10,239 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 01:50:10,240 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 01:50:10,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 01:50:10,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-02-04 01:50:10,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 01:50:10,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-02-04 01:50:10,267 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 13 [2018-02-04 01:50:10,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:10,267 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-02-04 01:50:10,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:50:10,268 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-02-04 01:50:10,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 01:50:10,268 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:10,268 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:50:10,269 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 01:50:10,269 INFO L82 PathProgramCache]: Analyzing trace with hash -718609433, now seen corresponding path program 1 times [2018-02-04 01:50:10,270 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:10,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:10,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:10,362 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:50:10,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:50:10,363 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:10,363 INFO 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 01:50:10,363 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 01:50:10,363 INFO 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 01:50:10,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:50:10,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:50:10,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:50:10,364 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 6 states. [2018-02-04 01:50:10,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:10,418 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-02-04 01:50:10,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:50:10,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-04 01:50:10,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:10,420 INFO L225 Difference]: With dead ends: 85 [2018-02-04 01:50:10,420 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 01:50:10,420 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 01:50:10,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 01:50:10,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-02-04 01:50:10,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 01:50:10,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-02-04 01:50:10,426 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 13 [2018-02-04 01:50:10,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:10,427 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-02-04 01:50:10,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:50:10,427 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-02-04 01:50:10,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 01:50:10,427 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:10,428 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:50:10,428 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 01:50:10,428 INFO L82 PathProgramCache]: Analyzing trace with hash -802055959, now seen corresponding path program 1 times [2018-02-04 01:50:10,428 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:10,439 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:10,460 INFO 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 01:50:10,460 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:50:10,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:50:10,460 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:10,460 INFO 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 01:50:10,461 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 01:50:10,461 INFO 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 01:50:10,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:50:10,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:50:10,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:50:10,461 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 4 states. [2018-02-04 01:50:10,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:10,525 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-02-04 01:50:10,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:50:10,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 01:50:10,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:10,527 INFO L225 Difference]: With dead ends: 84 [2018-02-04 01:50:10,527 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 01:50:10,528 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 01:50:10,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 01:50:10,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-02-04 01:50:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 01:50:10,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2018-02-04 01:50:10,533 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 14 [2018-02-04 01:50:10,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:10,533 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-02-04 01:50:10,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:50:10,533 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2018-02-04 01:50:10,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 01:50:10,534 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:10,534 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:50:10,534 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 01:50:10,534 INFO L82 PathProgramCache]: Analyzing trace with hash -802055958, now seen corresponding path program 1 times [2018-02-04 01:50:10,535 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:10,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:10,600 INFO 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 01:50:10,600 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:50:10,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:50:10,600 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:10,601 INFO 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 01:50:10,601 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 01:50:10,601 INFO 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 01:50:10,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:50:10,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:50:10,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:50:10,602 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 5 states. [2018-02-04 01:50:10,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:10,630 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-02-04 01:50:10,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:50:10,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 01:50:10,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:10,632 INFO L225 Difference]: With dead ends: 83 [2018-02-04 01:50:10,632 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 01:50:10,632 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 01:50:10,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 01:50:10,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-02-04 01:50:10,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 01:50:10,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-02-04 01:50:10,636 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 14 [2018-02-04 01:50:10,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:10,636 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-02-04 01:50:10,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:50:10,636 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-02-04 01:50:10,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 01:50:10,636 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:10,637 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 01:50:10,637 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 01:50:10,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1145880583, now seen corresponding path program 1 times [2018-02-04 01:50:10,637 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:10,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:10,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:10,675 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:50:10,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:50:10,675 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:10,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 01:50:10,675 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 01:50:10,676 INFO 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 01:50:10,676 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:50:10,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:50:10,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:50:10,676 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 5 states. [2018-02-04 01:50:10,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:10,743 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-02-04 01:50:10,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:50:10,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 01:50:10,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:10,748 INFO L225 Difference]: With dead ends: 82 [2018-02-04 01:50:10,748 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 01:50:10,748 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 01:50:10,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 01:50:10,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-02-04 01:50:10,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 01:50:10,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-02-04 01:50:10,751 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 17 [2018-02-04 01:50:10,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:10,751 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-02-04 01:50:10,751 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:50:10,751 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-02-04 01:50:10,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 01:50:10,752 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:10,752 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 01:50:10,752 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 01:50:10,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1145880582, now seen corresponding path program 1 times [2018-02-04 01:50:10,752 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:10,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:10,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:10,835 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:50:10,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 01:50:10,835 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:10,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:10,836 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 01:50:10,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:10,836 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:50:10,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:50:10,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:50:10,836 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 8 states. [2018-02-04 01:50:10,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:10,951 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-02-04 01:50:10,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:50:10,952 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-02-04 01:50:10,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:10,953 INFO L225 Difference]: With dead ends: 81 [2018-02-04 01:50:10,953 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 01:50:10,953 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 01:50:10,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 01:50:10,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-04 01:50:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 01:50:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-02-04 01:50:10,961 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 17 [2018-02-04 01:50:10,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:10,961 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-02-04 01:50:10,961 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:50:10,961 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-02-04 01:50:10,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 01:50:10,962 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:10,962 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 01:50:10,962 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 01:50:10,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1883098626, now seen corresponding path program 1 times [2018-02-04 01:50:10,963 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:10,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:11,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 01:50:11,037 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:50:11,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 01:50:11,037 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:11,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 01:50:11,037 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 01:50:11,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 01:50:11,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 01:50:11,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 01:50:11,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:50:11,038 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 7 states. [2018-02-04 01:50:11,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:11,158 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2018-02-04 01:50:11,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 01:50:11,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-04 01:50:11,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:11,159 INFO L225 Difference]: With dead ends: 80 [2018-02-04 01:50:11,159 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 01:50:11,159 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 01:50:11,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 01:50:11,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-04 01:50:11,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 01:50:11,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-02-04 01:50:11,164 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 23 [2018-02-04 01:50:11,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:11,164 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-02-04 01:50:11,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 01:50:11,164 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-02-04 01:50:11,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 01:50:11,165 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:11,165 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 01:50:11,165 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 01:50:11,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1883098625, now seen corresponding path program 1 times [2018-02-04 01:50:11,166 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:11,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:11,308 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:50:11,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 01:50:11,308 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:11,308 INFO 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 01:50:11,308 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 01:50:11,309 INFO 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 01:50:11,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 01:50:11,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 01:50:11,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:50:11,309 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 10 states. [2018-02-04 01:50:11,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:11,425 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-02-04 01:50:11,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 01:50:11,426 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-02-04 01:50:11,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:11,427 INFO L225 Difference]: With dead ends: 104 [2018-02-04 01:50:11,428 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 01:50:11,428 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 01:50:11,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 01:50:11,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2018-02-04 01:50:11,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 01:50:11,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2018-02-04 01:50:11,432 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 23 [2018-02-04 01:50:11,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:11,432 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2018-02-04 01:50:11,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 01:50:11,432 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2018-02-04 01:50:11,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 01:50:11,433 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:11,433 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 01:50:11,433 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 01:50:11,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1390800317, now seen corresponding path program 1 times [2018-02-04 01:50:11,434 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:11,446 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:11,680 INFO 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 01:50:11,680 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:50:11,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 01:50:11,680 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:11,680 INFO 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 01:50:11,680 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 01:50:11,681 INFO 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 01:50:11,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 01:50:11,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 01:50:11,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:50:11,681 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 13 states. [2018-02-04 01:50:11,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:11,924 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2018-02-04 01:50:11,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 01:50:11,924 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-02-04 01:50:11,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:11,925 INFO L225 Difference]: With dead ends: 104 [2018-02-04 01:50:11,925 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 01:50:11,925 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2018-02-04 01:50:11,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 01:50:11,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2018-02-04 01:50:11,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 01:50:11,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-02-04 01:50:11,928 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 23 [2018-02-04 01:50:11,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:11,928 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-02-04 01:50:11,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 01:50:11,928 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-02-04 01:50:11,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 01:50:11,929 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:11,929 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 01:50:11,929 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 01:50:11,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1853436480, now seen corresponding path program 1 times [2018-02-04 01:50:11,930 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:11,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:12,175 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 01:50:12,175 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:12,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 01:50:12,176 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:12,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:12,179 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 01:50:12,179 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 01:50:12,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 01:50:12,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 01:50:12,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:50:12,179 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 13 states. [2018-02-04 01:50:12,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:12,511 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2018-02-04 01:50:12,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 01:50:12,511 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-02-04 01:50:12,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:12,515 INFO L225 Difference]: With dead ends: 108 [2018-02-04 01:50:12,515 INFO L226 Difference]: Without dead ends: 108 [2018-02-04 01:50:12,516 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 01:50:12,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-04 01:50:12,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2018-02-04 01:50:12,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-04 01:50:12,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2018-02-04 01:50:12,518 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 27 [2018-02-04 01:50:12,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:12,518 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2018-02-04 01:50:12,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 01:50:12,518 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2018-02-04 01:50:12,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 01:50:12,519 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:12,519 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 01:50:12,519 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 01:50:12,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1699013504, now seen corresponding path program 1 times [2018-02-04 01:50:12,519 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:12,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:12,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:12,568 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:50:12,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:50:12,568 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:12,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:12,568 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 01:50:12,569 INFO 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 01:50:12,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:50:12,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:50:12,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:50:12,569 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 6 states. [2018-02-04 01:50:12,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:12,721 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2018-02-04 01:50:12,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:50:12,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-02-04 01:50:12,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:12,722 INFO L225 Difference]: With dead ends: 99 [2018-02-04 01:50:12,722 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 01:50:12,722 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 01:50:12,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 01:50:12,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-02-04 01:50:12,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 01:50:12,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2018-02-04 01:50:12,723 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 28 [2018-02-04 01:50:12,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:12,724 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-02-04 01:50:12,724 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:50:12,724 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2018-02-04 01:50:12,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 01:50:12,724 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:12,724 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 01:50:12,724 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 01:50:12,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1948682038, now seen corresponding path program 1 times [2018-02-04 01:50:12,725 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:12,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:12,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:12,767 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:50:12,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:50:12,767 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:12,768 INFO 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 01:50:12,768 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 01:50:12,768 INFO 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 01:50:12,768 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:50:12,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:50:12,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:50:12,769 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 6 states. [2018-02-04 01:50:12,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:12,838 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-02-04 01:50:12,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:50:12,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-04 01:50:12,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:12,840 INFO L225 Difference]: With dead ends: 74 [2018-02-04 01:50:12,840 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 01:50:12,840 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 01:50:12,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 01:50:12,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-04 01:50:12,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 01:50:12,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2018-02-04 01:50:12,842 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 31 [2018-02-04 01:50:12,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:12,842 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-02-04 01:50:12,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:50:12,842 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-02-04 01:50:12,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 01:50:12,843 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:12,843 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 01:50:12,843 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 01:50:12,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1948682039, now seen corresponding path program 1 times [2018-02-04 01:50:12,844 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:12,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:12,921 INFO 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 01:50:12,922 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:50:12,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 01:50:12,922 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:12,923 INFO 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 01:50:12,923 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 01:50:12,923 INFO 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 01:50:12,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 01:50:12,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 01:50:12,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:50:12,924 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 9 states. [2018-02-04 01:50:13,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:13,035 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2018-02-04 01:50:13,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:50:13,036 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-02-04 01:50:13,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:13,036 INFO L225 Difference]: With dead ends: 79 [2018-02-04 01:50:13,037 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 01:50:13,037 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:50:13,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 01:50:13,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-02-04 01:50:13,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 01:50:13,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-02-04 01:50:13,039 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 31 [2018-02-04 01:50:13,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:13,039 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-02-04 01:50:13,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 01:50:13,039 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-02-04 01:50:13,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 01:50:13,040 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:13,040 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 01:50:13,040 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 01:50:13,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1308654915, now seen corresponding path program 2 times [2018-02-04 01:50:13,041 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:13,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:13,199 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 01:50:13,199 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:13,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 01:50:13,199 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:13,200 INFO 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 01:50:13,200 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 01:50:13,200 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 01:50:13,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 01:50:13,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 01:50:13,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-02-04 01:50:13,205 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 14 states. [2018-02-04 01:50:13,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:13,491 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2018-02-04 01:50:13,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 01:50:13,491 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2018-02-04 01:50:13,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:13,492 INFO L225 Difference]: With dead ends: 84 [2018-02-04 01:50:13,492 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 01:50:13,492 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 01:50:13,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 01:50:13,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 70. [2018-02-04 01:50:13,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 01:50:13,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-02-04 01:50:13,494 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 31 [2018-02-04 01:50:13,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:13,494 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-02-04 01:50:13,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 01:50:13,494 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-02-04 01:50:13,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 01:50:13,495 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:13,495 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 01:50:13,495 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 01:50:13,495 INFO L82 PathProgramCache]: Analyzing trace with hash -211494479, now seen corresponding path program 1 times [2018-02-04 01:50:13,496 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:13,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:13,638 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 01:50:13,638 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:50:13,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 01:50:13,639 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:13,639 INFO 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 01:50:13,639 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 01:50:13,639 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 01:50:13,639 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 01:50:13,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 01:50:13,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:50:13,640 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 13 states. [2018-02-04 01:50:13,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:13,754 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-02-04 01:50:13,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 01:50:13,754 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-02-04 01:50:13,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:13,754 INFO L225 Difference]: With dead ends: 89 [2018-02-04 01:50:13,754 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 01:50:13,755 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 01:50:13,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 01:50:13,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-04 01:50:13,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 01:50:13,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-02-04 01:50:13,761 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 36 [2018-02-04 01:50:13,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:13,761 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-02-04 01:50:13,761 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 01:50:13,761 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-02-04 01:50:13,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 01:50:13,761 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:13,761 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 01:50:13,761 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 01:50:13,762 INFO L82 PathProgramCache]: Analyzing trace with hash -188862225, now seen corresponding path program 1 times [2018-02-04 01:50:13,762 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:13,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:13,965 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 01:50:13,965 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:13,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 01:50:13,966 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:13,966 INFO 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 01:50:13,966 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 01:50:13,966 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 01:50:13,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 01:50:13,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 01:50:13,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-04 01:50:13,967 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 15 states. [2018-02-04 01:50:14,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:14,272 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2018-02-04 01:50:14,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 01:50:14,272 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-02-04 01:50:14,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:14,272 INFO L225 Difference]: With dead ends: 81 [2018-02-04 01:50:14,272 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 01:50:14,273 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 01:50:14,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 01:50:14,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-02-04 01:50:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-04 01:50:14,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-02-04 01:50:14,275 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 36 [2018-02-04 01:50:14,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:14,275 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-02-04 01:50:14,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 01:50:14,275 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-02-04 01:50:14,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 01:50:14,276 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:14,276 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 01:50:14,276 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 01:50:14,276 INFO L82 PathProgramCache]: Analyzing trace with hash -7823713, now seen corresponding path program 1 times [2018-02-04 01:50:14,277 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:14,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:14,321 INFO 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 01:50:14,322 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:50:14,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 01:50:14,322 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:14,322 INFO 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 01:50:14,322 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 01:50:14,322 INFO 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 01:50:14,322 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 01:50:14,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 01:50:14,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:50:14,323 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 7 states. [2018-02-04 01:50:14,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:14,400 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2018-02-04 01:50:14,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 01:50:14,400 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-02-04 01:50:14,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:14,400 INFO L225 Difference]: With dead ends: 77 [2018-02-04 01:50:14,401 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 01:50:14,401 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 01:50:14,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 01:50:14,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-04 01:50:14,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 01:50:14,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-02-04 01:50:14,403 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 39 [2018-02-04 01:50:14,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:14,403 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-02-04 01:50:14,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 01:50:14,403 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-02-04 01:50:14,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 01:50:14,404 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:14,404 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 01:50:14,404 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 01:50:14,404 INFO L82 PathProgramCache]: Analyzing trace with hash -7823712, now seen corresponding path program 1 times [2018-02-04 01:50:14,405 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:14,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:14,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:14,484 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:50:14,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 01:50:14,485 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:14,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:14,485 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 01:50:14,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:14,485 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:50:14,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:50:14,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:50:14,486 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 8 states. [2018-02-04 01:50:14,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:14,526 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-02-04 01:50:14,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:50:14,526 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-02-04 01:50:14,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:14,527 INFO L225 Difference]: With dead ends: 111 [2018-02-04 01:50:14,527 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 01:50:14,527 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 01:50:14,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 01:50:14,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-02-04 01:50:14,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 01:50:14,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2018-02-04 01:50:14,531 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 39 [2018-02-04 01:50:14,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:14,532 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2018-02-04 01:50:14,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:50:14,532 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2018-02-04 01:50:14,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 01:50:14,532 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:14,532 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 01:50:14,532 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 01:50:14,532 INFO L82 PathProgramCache]: Analyzing trace with hash -701857031, now seen corresponding path program 2 times [2018-02-04 01:50:14,533 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:14,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:14,884 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 01:50:14,884 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:14,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 01:50:14,884 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:14,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 01:50:14,885 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 01:50:14,885 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 01:50:14,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 01:50:14,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 01:50:14,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-02-04 01:50:14,885 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand 16 states. [2018-02-04 01:50:15,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:15,408 INFO L93 Difference]: Finished difference Result 131 states and 148 transitions. [2018-02-04 01:50:15,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 01:50:15,480 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-02-04 01:50:15,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:15,481 INFO L225 Difference]: With dead ends: 131 [2018-02-04 01:50:15,481 INFO L226 Difference]: Without dead ends: 131 [2018-02-04 01:50:15,481 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2018-02-04 01:50:15,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-04 01:50:15,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2018-02-04 01:50:15,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-04 01:50:15,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 144 transitions. [2018-02-04 01:50:15,485 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 144 transitions. Word has length 41 [2018-02-04 01:50:15,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:15,485 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 144 transitions. [2018-02-04 01:50:15,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 01:50:15,485 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 144 transitions. [2018-02-04 01:50:15,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 01:50:15,485 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:15,485 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 01:50:15,486 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 01:50:15,486 INFO L82 PathProgramCache]: Analyzing trace with hash 648064035, now seen corresponding path program 1 times [2018-02-04 01:50:15,486 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:15,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:15,760 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 01:50:15,760 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:50:15,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-04 01:50:15,760 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:15,761 INFO 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 01:50:15,761 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 01:50:15,761 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 01:50:15,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 01:50:15,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 01:50:15,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-02-04 01:50:15,762 INFO L87 Difference]: Start difference. First operand 127 states and 144 transitions. Second operand 16 states. [2018-02-04 01:50:16,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:16,128 INFO L93 Difference]: Finished difference Result 172 states and 192 transitions. [2018-02-04 01:50:16,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 01:50:16,131 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-02-04 01:50:16,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:16,132 INFO L225 Difference]: With dead ends: 172 [2018-02-04 01:50:16,132 INFO L226 Difference]: Without dead ends: 172 [2018-02-04 01:50:16,132 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2018-02-04 01:50:16,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-04 01:50:16,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2018-02-04 01:50:16,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-04 01:50:16,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 185 transitions. [2018-02-04 01:50:16,136 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 185 transitions. Word has length 43 [2018-02-04 01:50:16,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:16,136 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 185 transitions. [2018-02-04 01:50:16,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 01:50:16,137 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 185 transitions. [2018-02-04 01:50:16,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 01:50:16,137 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:16,137 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 01:50:16,137 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 01:50:16,137 INFO L82 PathProgramCache]: Analyzing trace with hash 19279971, now seen corresponding path program 1 times [2018-02-04 01:50:16,138 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:16,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:16,179 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 01:50:16,179 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:16,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 01:50:16,179 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:16,179 INFO 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 01:50:16,180 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 01:50:16,180 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 01:50:16,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 01:50:16,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 01:50:16,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:50:16,180 INFO L87 Difference]: Start difference. First operand 155 states and 185 transitions. Second operand 9 states. [2018-02-04 01:50:16,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:16,262 INFO L93 Difference]: Finished difference Result 154 states and 182 transitions. [2018-02-04 01:50:16,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:50:16,262 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-02-04 01:50:16,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:16,263 INFO L225 Difference]: With dead ends: 154 [2018-02-04 01:50:16,263 INFO L226 Difference]: Without dead ends: 154 [2018-02-04 01:50:16,263 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 01:50:16,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-04 01:50:16,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-02-04 01:50:16,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-04 01:50:16,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 182 transitions. [2018-02-04 01:50:16,266 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 182 transitions. Word has length 45 [2018-02-04 01:50:16,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:16,266 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 182 transitions. [2018-02-04 01:50:16,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 01:50:16,266 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 182 transitions. [2018-02-04 01:50:16,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 01:50:16,266 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:16,266 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 01:50:16,266 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 01:50:16,266 INFO L82 PathProgramCache]: Analyzing trace with hash 19279972, now seen corresponding path program 1 times [2018-02-04 01:50:16,267 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:16,272 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:16,446 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 01:50:16,447 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:16,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 01:50:16,447 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:16,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 01:50:16,448 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 01:50:16,448 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 01:50:16,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 01:50:16,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 01:50:16,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-02-04 01:50:16,448 INFO L87 Difference]: Start difference. First operand 154 states and 182 transitions. Second operand 15 states. [2018-02-04 01:50:16,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:16,638 INFO L93 Difference]: Finished difference Result 165 states and 194 transitions. [2018-02-04 01:50:16,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 01:50:16,639 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-02-04 01:50:16,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:16,639 INFO L225 Difference]: With dead ends: 165 [2018-02-04 01:50:16,639 INFO L226 Difference]: Without dead ends: 165 [2018-02-04 01:50:16,640 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-02-04 01:50:16,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-04 01:50:16,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 158. [2018-02-04 01:50:16,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-04 01:50:16,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 186 transitions. [2018-02-04 01:50:16,642 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 186 transitions. Word has length 45 [2018-02-04 01:50:16,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:16,642 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 186 transitions. [2018-02-04 01:50:16,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 01:50:16,642 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 186 transitions. [2018-02-04 01:50:16,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 01:50:16,643 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:16,643 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 01:50:16,643 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 01:50:16,643 INFO L82 PathProgramCache]: Analyzing trace with hash -156113105, now seen corresponding path program 3 times [2018-02-04 01:50:16,643 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:16,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:16,849 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 01:50:16,850 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:16,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 01:50:16,850 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:16,850 INFO 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 01:50:16,851 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 01:50:16,851 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 01:50:16,851 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 01:50:16,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 01:50:16,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-02-04 01:50:16,852 INFO L87 Difference]: Start difference. First operand 158 states and 186 transitions. Second operand 15 states. [2018-02-04 01:50:17,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:17,249 INFO L93 Difference]: Finished difference Result 157 states and 184 transitions. [2018-02-04 01:50:17,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 01:50:17,255 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-02-04 01:50:17,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:17,255 INFO L225 Difference]: With dead ends: 157 [2018-02-04 01:50:17,255 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 01:50:17,256 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 01:50:17,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 01:50:17,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 101. [2018-02-04 01:50:17,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 01:50:17,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2018-02-04 01:50:17,258 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 46 [2018-02-04 01:50:17,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:17,258 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2018-02-04 01:50:17,258 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 01:50:17,258 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2018-02-04 01:50:17,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 01:50:17,258 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:17,258 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 01:50:17,258 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 01:50:17,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1348184644, now seen corresponding path program 1 times [2018-02-04 01:50:17,259 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:17,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:17,302 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 01:50:17,302 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:50:17,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 01:50:17,302 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:17,302 INFO 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 01:50:17,302 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 01:50:17,303 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 01:50:17,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:50:17,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:50:17,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:50:17,303 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand 8 states. [2018-02-04 01:50:17,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:17,435 INFO L93 Difference]: Finished difference Result 100 states and 119 transitions. [2018-02-04 01:50:17,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:50:17,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-02-04 01:50:17,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:17,436 INFO L225 Difference]: With dead ends: 100 [2018-02-04 01:50:17,436 INFO L226 Difference]: Without dead ends: 100 [2018-02-04 01:50:17,436 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 01:50:17,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-04 01:50:17,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-02-04 01:50:17,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-04 01:50:17,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2018-02-04 01:50:17,442 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 47 [2018-02-04 01:50:17,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:17,442 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2018-02-04 01:50:17,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:50:17,442 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2018-02-04 01:50:17,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 01:50:17,442 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:17,442 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 01:50:17,442 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 01:50:17,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1348184645, now seen corresponding path program 1 times [2018-02-04 01:50:17,443 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:17,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:17,508 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 01:50:17,511 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:50:17,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:50:17,512 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:17,512 INFO 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 01:50:17,512 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 01:50:17,512 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 01:50:17,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:50:17,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:50:17,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:50:17,513 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand 5 states. [2018-02-04 01:50:17,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:17,561 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2018-02-04 01:50:17,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:50:17,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-02-04 01:50:17,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:17,562 INFO L225 Difference]: With dead ends: 102 [2018-02-04 01:50:17,562 INFO L226 Difference]: Without dead ends: 102 [2018-02-04 01:50:17,562 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 01:50:17,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-04 01:50:17,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2018-02-04 01:50:17,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 01:50:17,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2018-02-04 01:50:17,566 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 47 [2018-02-04 01:50:17,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:17,567 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2018-02-04 01:50:17,567 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:50:17,567 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2018-02-04 01:50:17,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 01:50:17,567 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:17,567 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 01:50:17,567 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 01:50:17,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1381663923, now seen corresponding path program 1 times [2018-02-04 01:50:17,568 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:17,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:17,907 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 01:50:17,907 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:17,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 01:50:17,907 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:17,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:17,908 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 01:50:17,908 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 01:50:17,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 01:50:17,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 01:50:17,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-02-04 01:50:17,908 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand 17 states. [2018-02-04 01:50:18,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:18,443 INFO L93 Difference]: Finished difference Result 144 states and 166 transitions. [2018-02-04 01:50:18,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 01:50:18,444 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 48 [2018-02-04 01:50:18,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:18,444 INFO L225 Difference]: With dead ends: 144 [2018-02-04 01:50:18,444 INFO L226 Difference]: Without dead ends: 144 [2018-02-04 01:50:18,445 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 01:50:18,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-04 01:50:18,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 127. [2018-02-04 01:50:18,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-04 01:50:18,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 152 transitions. [2018-02-04 01:50:18,447 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 152 transitions. Word has length 48 [2018-02-04 01:50:18,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:18,447 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 152 transitions. [2018-02-04 01:50:18,447 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 01:50:18,447 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 152 transitions. [2018-02-04 01:50:18,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 01:50:18,448 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:18,448 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 01:50:18,448 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 01:50:18,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1474955739, now seen corresponding path program 1 times [2018-02-04 01:50:18,449 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:18,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:18,488 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 01:50:18,489 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:18,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 01:50:18,489 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:18,489 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 01:50:18,489 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 01:50:18,490 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:50:18,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:50:18,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:50:18,490 INFO L87 Difference]: Start difference. First operand 127 states and 152 transitions. Second operand 8 states. [2018-02-04 01:50:18,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:18,579 INFO L93 Difference]: Finished difference Result 126 states and 149 transitions. [2018-02-04 01:50:18,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:50:18,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-02-04 01:50:18,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:18,581 INFO L225 Difference]: With dead ends: 126 [2018-02-04 01:50:18,581 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 01:50:18,582 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 01:50:18,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 01:50:18,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-02-04 01:50:18,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-04 01:50:18,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 149 transitions. [2018-02-04 01:50:18,587 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 149 transitions. Word has length 49 [2018-02-04 01:50:18,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:18,588 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 149 transitions. [2018-02-04 01:50:18,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:50:18,588 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 149 transitions. [2018-02-04 01:50:18,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 01:50:18,588 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:18,588 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 01:50:18,589 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 01:50:18,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1474955738, now seen corresponding path program 1 times [2018-02-04 01:50:18,589 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:18,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:18,771 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 01:50:18,772 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:18,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 01:50:18,772 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:18,772 INFO 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 01:50:18,772 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 01:50:18,772 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 01:50:18,773 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 01:50:18,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 01:50:18,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-02-04 01:50:18,773 INFO L87 Difference]: Start difference. First operand 126 states and 149 transitions. Second operand 16 states. [2018-02-04 01:50:19,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:19,023 INFO L93 Difference]: Finished difference Result 180 states and 213 transitions. [2018-02-04 01:50:19,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 01:50:19,023 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-02-04 01:50:19,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:19,024 INFO L225 Difference]: With dead ends: 180 [2018-02-04 01:50:19,024 INFO L226 Difference]: Without dead ends: 180 [2018-02-04 01:50:19,025 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 01:50:19,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-04 01:50:19,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 138. [2018-02-04 01:50:19,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-04 01:50:19,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 164 transitions. [2018-02-04 01:50:19,030 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 164 transitions. Word has length 49 [2018-02-04 01:50:19,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:19,030 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 164 transitions. [2018-02-04 01:50:19,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 01:50:19,030 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 164 transitions. [2018-02-04 01:50:19,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 01:50:19,031 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:19,031 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 01:50:19,031 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 01:50:19,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1071735008, now seen corresponding path program 1 times [2018-02-04 01:50:19,032 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:19,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:19,139 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 01:50:19,139 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:19,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 01:50:19,139 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:19,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:19,140 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 01:50:19,140 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 01:50:19,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 01:50:19,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 01:50:19,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:50:19,141 INFO L87 Difference]: Start difference. First operand 138 states and 164 transitions. Second operand 10 states. [2018-02-04 01:50:19,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:19,225 INFO L93 Difference]: Finished difference Result 236 states and 272 transitions. [2018-02-04 01:50:19,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 01:50:19,225 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-02-04 01:50:19,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:19,226 INFO L225 Difference]: With dead ends: 236 [2018-02-04 01:50:19,226 INFO L226 Difference]: Without dead ends: 236 [2018-02-04 01:50:19,226 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:50:19,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-02-04 01:50:19,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 225. [2018-02-04 01:50:19,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-04 01:50:19,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 262 transitions. [2018-02-04 01:50:19,231 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 262 transitions. Word has length 52 [2018-02-04 01:50:19,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:19,231 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 262 transitions. [2018-02-04 01:50:19,231 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 01:50:19,231 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 262 transitions. [2018-02-04 01:50:19,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 01:50:19,232 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:19,232 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 01:50:19,232 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 01:50:19,232 INFO L82 PathProgramCache]: Analyzing trace with hash 515999267, now seen corresponding path program 2 times [2018-02-04 01:50:19,233 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:19,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:19,477 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 01:50:19,478 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:19,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 01:50:19,478 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:19,478 INFO 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 01:50:19,479 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 01:50:19,479 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 01:50:19,479 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 01:50:19,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 01:50:19,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-02-04 01:50:19,479 INFO L87 Difference]: Start difference. First operand 225 states and 262 transitions. Second operand 16 states. [2018-02-04 01:50:19,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:19,783 INFO L93 Difference]: Finished difference Result 240 states and 275 transitions. [2018-02-04 01:50:19,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 01:50:19,783 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2018-02-04 01:50:19,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:19,784 INFO L225 Difference]: With dead ends: 240 [2018-02-04 01:50:19,784 INFO L226 Difference]: Without dead ends: 151 [2018-02-04 01:50:19,784 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 01:50:19,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-04 01:50:19,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 74. [2018-02-04 01:50:19,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 01:50:19,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-02-04 01:50:19,786 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 53 [2018-02-04 01:50:19,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:19,786 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-02-04 01:50:19,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 01:50:19,786 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-02-04 01:50:19,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 01:50:19,786 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:19,786 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 01:50:19,786 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 01:50:19,786 INFO L82 PathProgramCache]: Analyzing trace with hash 931438653, now seen corresponding path program 2 times [2018-02-04 01:50:19,787 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:19,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:20,470 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 01:50:20,470 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:20,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 01:50:20,535 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:20,535 INFO 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 01:50:20,535 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 01:50:20,535 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 01:50:20,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 01:50:20,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 01:50:20,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=504, Unknown=0, NotChecked=0, Total=552 [2018-02-04 01:50:20,536 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 24 states. [2018-02-04 01:50:21,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:21,395 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2018-02-04 01:50:21,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 01:50:21,396 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 56 [2018-02-04 01:50:21,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:21,396 INFO L225 Difference]: With dead ends: 134 [2018-02-04 01:50:21,397 INFO L226 Difference]: Without dead ends: 134 [2018-02-04 01:50:21,397 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=147, Invalid=1493, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 01:50:21,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-04 01:50:21,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 113. [2018-02-04 01:50:21,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 01:50:21,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2018-02-04 01:50:21,400 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 56 [2018-02-04 01:50:21,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:21,400 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2018-02-04 01:50:21,400 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 01:50:21,400 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2018-02-04 01:50:21,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 01:50:21,401 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:21,401 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 01:50:21,401 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 01:50:21,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1759348222, now seen corresponding path program 1 times [2018-02-04 01:50:21,402 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:21,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:21,559 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 01:50:21,559 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:21,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 01:50:21,559 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:21,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:21,560 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 01:50:21,560 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 01:50:21,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 01:50:21,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 01:50:21,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-04 01:50:21,560 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand 14 states. [2018-02-04 01:50:21,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:21,743 INFO L93 Difference]: Finished difference Result 141 states and 163 transitions. [2018-02-04 01:50:21,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 01:50:21,744 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2018-02-04 01:50:21,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:21,744 INFO L225 Difference]: With dead ends: 141 [2018-02-04 01:50:21,744 INFO L226 Difference]: Without dead ends: 141 [2018-02-04 01:50:21,745 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 01:50:21,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-04 01:50:21,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 123. [2018-02-04 01:50:21,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 01:50:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2018-02-04 01:50:21,746 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 58 [2018-02-04 01:50:21,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:21,747 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2018-02-04 01:50:21,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 01:50:21,747 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2018-02-04 01:50:21,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 01:50:21,747 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:21,747 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 01:50:21,747 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 01:50:21,747 INFO L82 PathProgramCache]: Analyzing trace with hash 189332755, now seen corresponding path program 1 times [2018-02-04 01:50:21,748 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:21,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:21,997 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 01:50:21,998 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:21,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 01:50:21,998 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:21,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 01:50:21,998 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 01:50:21,999 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 01:50:21,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 01:50:21,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 01:50:21,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-02-04 01:50:21,999 INFO L87 Difference]: Start difference. First operand 123 states and 144 transitions. Second operand 16 states. [2018-02-04 01:50:22,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:22,306 INFO L93 Difference]: Finished difference Result 134 states and 153 transitions. [2018-02-04 01:50:22,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 01:50:22,306 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 61 [2018-02-04 01:50:22,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:22,307 INFO L225 Difference]: With dead ends: 134 [2018-02-04 01:50:22,307 INFO L226 Difference]: Without dead ends: 134 [2018-02-04 01:50:22,307 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 01:50:22,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-04 01:50:22,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 81. [2018-02-04 01:50:22,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 01:50:22,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2018-02-04 01:50:22,308 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 61 [2018-02-04 01:50:22,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:22,308 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2018-02-04 01:50:22,308 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 01:50:22,309 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2018-02-04 01:50:22,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 01:50:22,309 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:22,309 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 01:50:22,309 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 01:50:22,309 INFO L82 PathProgramCache]: Analyzing trace with hash 311750336, now seen corresponding path program 1 times [2018-02-04 01:50:22,309 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:22,318 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:22,476 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 01:50:22,477 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:22,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 01:50:22,477 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:22,477 INFO 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 01:50:22,477 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 01:50:22,477 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 01:50:22,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 01:50:22,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 01:50:22,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-02-04 01:50:22,478 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 18 states. [2018-02-04 01:50:22,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:22,731 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2018-02-04 01:50:22,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 01:50:22,732 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 62 [2018-02-04 01:50:22,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:22,732 INFO L225 Difference]: With dead ends: 105 [2018-02-04 01:50:22,732 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 01:50:22,732 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2018-02-04 01:50:22,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 01:50:22,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 82. [2018-02-04 01:50:22,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 01:50:22,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-02-04 01:50:22,734 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 62 [2018-02-04 01:50:22,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:22,734 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-02-04 01:50:22,734 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 01:50:22,734 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-02-04 01:50:22,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 01:50:22,734 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:22,734 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 01:50:22,734 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 01:50:22,734 INFO L82 PathProgramCache]: Analyzing trace with hash 2045968775, now seen corresponding path program 2 times [2018-02-04 01:50:22,735 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:22,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:22,951 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 01:50:22,951 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:22,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 01:50:22,951 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:22,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:22,952 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 01:50:22,952 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 01:50:22,952 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 01:50:22,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 01:50:22,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-02-04 01:50:22,952 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 18 states. [2018-02-04 01:50:23,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:23,192 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2018-02-04 01:50:23,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 01:50:23,192 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2018-02-04 01:50:23,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:23,193 INFO L225 Difference]: With dead ends: 107 [2018-02-04 01:50:23,193 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 01:50:23,193 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2018-02-04 01:50:23,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 01:50:23,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 90. [2018-02-04 01:50:23,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-04 01:50:23,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2018-02-04 01:50:23,194 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 67 [2018-02-04 01:50:23,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:23,194 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2018-02-04 01:50:23,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 01:50:23,195 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2018-02-04 01:50:23,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-04 01:50:23,195 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:23,195 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 01:50:23,195 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 01:50:23,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1577024969, now seen corresponding path program 2 times [2018-02-04 01:50:23,196 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:23,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:23,366 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 01:50:23,366 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:23,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 01:50:23,366 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:23,367 INFO 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 01:50:23,367 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 01:50:23,367 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 01:50:23,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 01:50:23,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 01:50:23,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-02-04 01:50:23,367 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand 19 states. [2018-02-04 01:50:23,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:23,697 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2018-02-04 01:50:23,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 01:50:23,697 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 71 [2018-02-04 01:50:23,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:23,698 INFO L225 Difference]: With dead ends: 121 [2018-02-04 01:50:23,698 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 01:50:23,698 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 01:50:23,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 01:50:23,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 91. [2018-02-04 01:50:23,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 01:50:23,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2018-02-04 01:50:23,700 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 71 [2018-02-04 01:50:23,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:23,700 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2018-02-04 01:50:23,700 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 01:50:23,700 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2018-02-04 01:50:23,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-04 01:50:23,700 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:23,700 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 01:50:23,700 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 01:50:23,701 INFO L82 PathProgramCache]: Analyzing trace with hash -718966754, now seen corresponding path program 3 times [2018-02-04 01:50:23,701 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:23,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:23,831 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 01:50:23,831 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:23,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 01:50:23,831 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:23,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 01:50:23,831 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 01:50:23,832 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 01:50:23,832 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 01:50:23,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 01:50:23,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-04 01:50:23,832 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 12 states. [2018-02-04 01:50:23,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:23,906 INFO L93 Difference]: Finished difference Result 146 states and 166 transitions. [2018-02-04 01:50:23,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 01:50:23,907 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 76 [2018-02-04 01:50:23,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:23,907 INFO L225 Difference]: With dead ends: 146 [2018-02-04 01:50:23,907 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 01:50:23,907 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 01:50:23,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 01:50:23,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-02-04 01:50:23,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 01:50:23,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2018-02-04 01:50:23,909 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 76 [2018-02-04 01:50:23,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:23,909 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2018-02-04 01:50:23,909 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 01:50:23,909 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2018-02-04 01:50:23,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-04 01:50:23,909 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:23,909 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 01:50:23,909 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 01:50:23,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1136154501, now seen corresponding path program 4 times [2018-02-04 01:50:23,910 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:23,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:24,116 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 01:50:24,117 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:24,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 01:50:24,117 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:24,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 01:50:24,117 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 01:50:24,117 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 01:50:24,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 01:50:24,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 01:50:24,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-02-04 01:50:24,118 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand 17 states. [2018-02-04 01:50:24,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:24,400 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2018-02-04 01:50:24,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 01:50:24,400 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 80 [2018-02-04 01:50:24,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:24,401 INFO L225 Difference]: With dead ends: 131 [2018-02-04 01:50:24,401 INFO L226 Difference]: Without dead ends: 131 [2018-02-04 01:50:24,401 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 01:50:24,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-04 01:50:24,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 103. [2018-02-04 01:50:24,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 01:50:24,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2018-02-04 01:50:24,402 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 80 [2018-02-04 01:50:24,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:24,402 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2018-02-04 01:50:24,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 01:50:24,402 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2018-02-04 01:50:24,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-04 01:50:24,403 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:24,403 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 01:50:24,403 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 01:50:24,403 INFO L82 PathProgramCache]: Analyzing trace with hash -2030073155, now seen corresponding path program 3 times [2018-02-04 01:50:24,403 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:24,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:24,607 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 01:50:24,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:24,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 01:50:24,608 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:24,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 01:50:24,608 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 01:50:24,608 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 01:50:24,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 01:50:24,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 01:50:24,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-02-04 01:50:24,609 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand 18 states. [2018-02-04 01:50:24,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:24,992 INFO L93 Difference]: Finished difference Result 145 states and 163 transitions. [2018-02-04 01:50:24,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 01:50:24,992 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 84 [2018-02-04 01:50:24,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:24,993 INFO L225 Difference]: With dead ends: 145 [2018-02-04 01:50:24,993 INFO L226 Difference]: Without dead ends: 145 [2018-02-04 01:50:24,993 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 01:50:24,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-04 01:50:24,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 104. [2018-02-04 01:50:24,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-04 01:50:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2018-02-04 01:50:24,995 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 84 [2018-02-04 01:50:24,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:24,995 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2018-02-04 01:50:24,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 01:50:24,995 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2018-02-04 01:50:24,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 01:50:24,995 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:24,996 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 01:50:24,996 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 01:50:24,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1722506154, now seen corresponding path program 5 times [2018-02-04 01:50:24,996 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:25,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:25,120 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 01:50:25,120 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:25,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 01:50:25,120 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:25,120 INFO 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 01:50:25,120 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 01:50:25,121 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 01:50:25,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 01:50:25,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 01:50:25,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-02-04 01:50:25,121 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand 14 states. [2018-02-04 01:50:25,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:25,264 INFO L93 Difference]: Finished difference Result 175 states and 201 transitions. [2018-02-04 01:50:25,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 01:50:25,265 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2018-02-04 01:50:25,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:25,265 INFO L225 Difference]: With dead ends: 175 [2018-02-04 01:50:25,265 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 01:50:25,266 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 01:50:25,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 01:50:25,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-02-04 01:50:25,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 01:50:25,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2018-02-04 01:50:25,268 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 89 [2018-02-04 01:50:25,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:25,268 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2018-02-04 01:50:25,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 01:50:25,268 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2018-02-04 01:50:25,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-04 01:50:25,271 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:25,271 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 01:50:25,271 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 01:50:25,272 INFO L82 PathProgramCache]: Analyzing trace with hash 947282541, now seen corresponding path program 6 times [2018-02-04 01:50:25,272 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:25,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:25,569 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 01:50:25,588 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:25,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 01:50:25,588 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:25,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:25,588 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 01:50:25,588 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 01:50:25,588 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 01:50:25,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 01:50:25,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-02-04 01:50:25,589 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 19 states. [2018-02-04 01:50:25,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:25,974 INFO L93 Difference]: Finished difference Result 151 states and 170 transitions. [2018-02-04 01:50:25,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 01:50:25,974 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 93 [2018-02-04 01:50:25,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:25,975 INFO L225 Difference]: With dead ends: 151 [2018-02-04 01:50:25,975 INFO L226 Difference]: Without dead ends: 151 [2018-02-04 01:50:25,975 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 01:50:25,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-04 01:50:25,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 116. [2018-02-04 01:50:25,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 01:50:25,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2018-02-04 01:50:25,977 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 93 [2018-02-04 01:50:25,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:25,977 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2018-02-04 01:50:25,977 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 01:50:25,977 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2018-02-04 01:50:25,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-04 01:50:25,978 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:25,978 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 01:50:25,978 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 01:50:25,978 INFO L82 PathProgramCache]: Analyzing trace with hash 2021391279, now seen corresponding path program 4 times [2018-02-04 01:50:25,979 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:25,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:26,217 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 01:50:26,217 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:26,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 01:50:26,217 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:26,218 INFO 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 01:50:26,218 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 01:50:26,218 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 01:50:26,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 01:50:26,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 01:50:26,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-02-04 01:50:26,218 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand 20 states. [2018-02-04 01:50:26,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:26,710 INFO L93 Difference]: Finished difference Result 165 states and 186 transitions. [2018-02-04 01:50:26,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 01:50:26,710 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2018-02-04 01:50:26,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:26,711 INFO L225 Difference]: With dead ends: 165 [2018-02-04 01:50:26,711 INFO L226 Difference]: Without dead ends: 165 [2018-02-04 01:50:26,711 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 01:50:26,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-04 01:50:26,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 117. [2018-02-04 01:50:26,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 01:50:26,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2018-02-04 01:50:26,713 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 97 [2018-02-04 01:50:26,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:26,713 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2018-02-04 01:50:26,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 01:50:26,714 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2018-02-04 01:50:26,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-04 01:50:26,714 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:26,714 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 01:50:26,714 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 01:50:26,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1100369416, now seen corresponding path program 7 times [2018-02-04 01:50:26,715 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:26,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:26,892 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 01:50:26,892 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:26,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 01:50:26,893 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:26,893 INFO 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 01:50:26,893 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 01:50:26,893 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 01:50:26,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 01:50:26,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 01:50:26,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-02-04 01:50:26,893 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand 16 states. [2018-02-04 01:50:27,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:27,077 INFO L93 Difference]: Finished difference Result 204 states and 236 transitions. [2018-02-04 01:50:27,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 01:50:27,077 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 102 [2018-02-04 01:50:27,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:27,078 INFO L225 Difference]: With dead ends: 204 [2018-02-04 01:50:27,078 INFO L226 Difference]: Without dead ends: 122 [2018-02-04 01:50:27,078 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 01:50:27,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-04 01:50:27,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-02-04 01:50:27,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 01:50:27,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2018-02-04 01:50:27,080 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 102 [2018-02-04 01:50:27,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:27,081 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2018-02-04 01:50:27,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 01:50:27,081 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2018-02-04 01:50:27,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-02-04 01:50:27,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:27,082 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 01:50:27,082 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 01:50:27,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1389821931, now seen corresponding path program 8 times [2018-02-04 01:50:27,082 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:27,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:27,351 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 01:50:27,351 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:27,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 01:50:27,351 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:27,352 INFO 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 01:50:27,352 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 01:50:27,352 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 01:50:27,352 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 01:50:27,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 01:50:27,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-02-04 01:50:27,352 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 21 states. [2018-02-04 01:50:27,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:27,797 INFO L93 Difference]: Finished difference Result 175 states and 197 transitions. [2018-02-04 01:50:27,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 01:50:27,797 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 106 [2018-02-04 01:50:27,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:27,798 INFO L225 Difference]: With dead ends: 175 [2018-02-04 01:50:27,798 INFO L226 Difference]: Without dead ends: 175 [2018-02-04 01:50:27,798 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 01:50:27,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-04 01:50:27,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 129. [2018-02-04 01:50:27,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-04 01:50:27,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2018-02-04 01:50:27,800 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 106 [2018-02-04 01:50:27,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:27,800 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2018-02-04 01:50:27,800 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 01:50:27,800 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2018-02-04 01:50:27,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-04 01:50:27,800 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:27,801 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 01:50:27,801 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 01:50:27,801 INFO L82 PathProgramCache]: Analyzing trace with hash -237533865, now seen corresponding path program 5 times [2018-02-04 01:50:27,801 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:27,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:28,284 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 01:50:28,284 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:28,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 01:50:28,285 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:28,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:28,285 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 01:50:28,285 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 01:50:28,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 01:50:28,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 01:50:28,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2018-02-04 01:50:28,286 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 25 states. [2018-02-04 01:50:29,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:29,025 INFO L93 Difference]: Finished difference Result 181 states and 205 transitions. [2018-02-04 01:50:29,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 01:50:29,025 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 110 [2018-02-04 01:50:29,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:29,026 INFO L225 Difference]: With dead ends: 181 [2018-02-04 01:50:29,026 INFO L226 Difference]: Without dead ends: 181 [2018-02-04 01:50:29,026 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 01:50:29,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-04 01:50:29,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 130. [2018-02-04 01:50:29,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-04 01:50:29,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2018-02-04 01:50:29,029 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 110 [2018-02-04 01:50:29,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:29,029 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2018-02-04 01:50:29,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 01:50:29,029 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2018-02-04 01:50:29,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-02-04 01:50:29,030 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:29,030 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 01:50:29,030 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 01:50:29,030 INFO L82 PathProgramCache]: Analyzing trace with hash -863375024, now seen corresponding path program 9 times [2018-02-04 01:50:29,031 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:29,045 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:29,256 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 01:50:29,256 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:29,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 01:50:29,257 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:29,257 INFO 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 01:50:29,257 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 01:50:29,257 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 01:50:29,258 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 01:50:29,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 01:50:29,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-02-04 01:50:29,258 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand 18 states. [2018-02-04 01:50:29,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:29,559 INFO L93 Difference]: Finished difference Result 233 states and 271 transitions. [2018-02-04 01:50:29,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 01:50:29,559 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 115 [2018-02-04 01:50:29,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:29,560 INFO L225 Difference]: With dead ends: 233 [2018-02-04 01:50:29,560 INFO L226 Difference]: Without dead ends: 135 [2018-02-04 01:50:29,560 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 01:50:29,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-04 01:50:29,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-02-04 01:50:29,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-04 01:50:29,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2018-02-04 01:50:29,564 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 115 [2018-02-04 01:50:29,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:29,564 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2018-02-04 01:50:29,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 01:50:29,564 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2018-02-04 01:50:29,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-02-04 01:50:29,565 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:29,565 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 01:50:29,565 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 01:50:29,566 INFO L82 PathProgramCache]: Analyzing trace with hash 901331539, now seen corresponding path program 10 times [2018-02-04 01:50:29,566 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:29,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:30,019 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 01:50:30,019 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:30,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 01:50:30,019 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:30,019 INFO 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 01:50:30,019 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 01:50:30,019 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 01:50:30,020 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 01:50:30,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 01:50:30,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2018-02-04 01:50:30,020 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand 26 states. [2018-02-04 01:50:30,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:30,605 INFO L93 Difference]: Finished difference Result 187 states and 212 transitions. [2018-02-04 01:50:30,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 01:50:30,606 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 119 [2018-02-04 01:50:30,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:30,607 INFO L225 Difference]: With dead ends: 187 [2018-02-04 01:50:30,607 INFO L226 Difference]: Without dead ends: 187 [2018-02-04 01:50:30,607 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 01:50:30,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-04 01:50:30,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 142. [2018-02-04 01:50:30,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-04 01:50:30,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 166 transitions. [2018-02-04 01:50:30,610 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 166 transitions. Word has length 119 [2018-02-04 01:50:30,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:30,610 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 166 transitions. [2018-02-04 01:50:30,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 01:50:30,610 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 166 transitions. [2018-02-04 01:50:30,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-02-04 01:50:30,611 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:30,611 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 01:50:30,611 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 01:50:30,611 INFO L82 PathProgramCache]: Analyzing trace with hash -417042283, now seen corresponding path program 6 times [2018-02-04 01:50:30,612 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:30,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:31,070 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 01:50:31,070 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:31,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 01:50:31,071 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:31,071 INFO 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 01:50:31,071 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 01:50:31,071 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 01:50:31,071 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 01:50:31,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 01:50:31,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2018-02-04 01:50:31,072 INFO L87 Difference]: Start difference. First operand 142 states and 166 transitions. Second operand 27 states. [2018-02-04 01:50:31,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:31,911 INFO L93 Difference]: Finished difference Result 201 states and 228 transitions. [2018-02-04 01:50:31,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 01:50:31,912 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 123 [2018-02-04 01:50:31,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:31,912 INFO L225 Difference]: With dead ends: 201 [2018-02-04 01:50:31,912 INFO L226 Difference]: Without dead ends: 201 [2018-02-04 01:50:31,913 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 01:50:31,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-02-04 01:50:31,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 143. [2018-02-04 01:50:31,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-04 01:50:31,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 168 transitions. [2018-02-04 01:50:31,915 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 168 transitions. Word has length 123 [2018-02-04 01:50:31,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:31,915 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 168 transitions. [2018-02-04 01:50:31,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 01:50:31,915 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 168 transitions. [2018-02-04 01:50:31,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-02-04 01:50:31,916 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:31,916 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 01:50:31,916 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 01:50:31,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1285268270, now seen corresponding path program 11 times [2018-02-04 01:50:31,916 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:31,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:32,163 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 01:50:32,163 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:32,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 01:50:32,163 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:32,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 01:50:32,163 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 01:50:32,164 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 01:50:32,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 01:50:32,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 01:50:32,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-02-04 01:50:32,164 INFO L87 Difference]: Start difference. First operand 143 states and 168 transitions. Second operand 20 states. [2018-02-04 01:50:32,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:32,411 INFO L93 Difference]: Finished difference Result 262 states and 306 transitions. [2018-02-04 01:50:32,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 01:50:32,411 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 128 [2018-02-04 01:50:32,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:32,412 INFO L225 Difference]: With dead ends: 262 [2018-02-04 01:50:32,412 INFO L226 Difference]: Without dead ends: 148 [2018-02-04 01:50:32,412 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 01:50:32,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-04 01:50:32,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-02-04 01:50:32,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-04 01:50:32,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 172 transitions. [2018-02-04 01:50:32,414 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 172 transitions. Word has length 128 [2018-02-04 01:50:32,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:32,414 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 172 transitions. [2018-02-04 01:50:32,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 01:50:32,414 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 172 transitions. [2018-02-04 01:50:32,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-04 01:50:32,415 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:32,415 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 01:50:32,415 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 01:50:32,415 INFO L82 PathProgramCache]: Analyzing trace with hash -760409937, now seen corresponding path program 12 times [2018-02-04 01:50:32,416 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:32,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:32,760 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 01:50:32,760 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:32,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 01:50:32,761 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:32,761 INFO 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 01:50:32,761 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 01:50:32,761 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 01:50:32,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 01:50:32,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 01:50:32,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2018-02-04 01:50:32,761 INFO L87 Difference]: Start difference. First operand 147 states and 172 transitions. Second operand 25 states. [2018-02-04 01:50:33,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:33,352 INFO L93 Difference]: Finished difference Result 219 states and 247 transitions. [2018-02-04 01:50:33,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 01:50:33,353 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 132 [2018-02-04 01:50:33,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:33,353 INFO L225 Difference]: With dead ends: 219 [2018-02-04 01:50:33,353 INFO L226 Difference]: Without dead ends: 219 [2018-02-04 01:50:33,354 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 01:50:33,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-04 01:50:33,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 155. [2018-02-04 01:50:33,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-04 01:50:33,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 182 transitions. [2018-02-04 01:50:33,357 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 182 transitions. Word has length 132 [2018-02-04 01:50:33,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:33,357 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 182 transitions. [2018-02-04 01:50:33,357 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 01:50:33,357 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 182 transitions. [2018-02-04 01:50:33,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-02-04 01:50:33,358 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:33,358 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 01:50:33,358 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 01:50:33,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1622296335, now seen corresponding path program 7 times [2018-02-04 01:50:33,359 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:33,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:33,782 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 01:50:33,783 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:33,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 01:50:33,783 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:33,783 INFO 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 01:50:33,783 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 01:50:33,783 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 01:50:33,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 01:50:33,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 01:50:33,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2018-02-04 01:50:33,784 INFO L87 Difference]: Start difference. First operand 155 states and 182 transitions. Second operand 26 states. [2018-02-04 01:50:34,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:34,609 INFO L93 Difference]: Finished difference Result 233 states and 263 transitions. [2018-02-04 01:50:34,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 01:50:34,609 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 136 [2018-02-04 01:50:34,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:34,610 INFO L225 Difference]: With dead ends: 233 [2018-02-04 01:50:34,610 INFO L226 Difference]: Without dead ends: 233 [2018-02-04 01:50:34,611 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=524, Invalid=2782, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 01:50:34,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-04 01:50:34,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 156. [2018-02-04 01:50:34,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-04 01:50:34,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 184 transitions. [2018-02-04 01:50:34,614 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 184 transitions. Word has length 136 [2018-02-04 01:50:34,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:34,614 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 184 transitions. [2018-02-04 01:50:34,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 01:50:34,615 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 184 transitions. [2018-02-04 01:50:34,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-02-04 01:50:34,615 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:34,615 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 01:50:34,615 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 01:50:34,616 INFO L82 PathProgramCache]: Analyzing trace with hash 650505718, now seen corresponding path program 13 times [2018-02-04 01:50:34,616 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:34,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:34,928 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 01:50:34,929 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:34,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 01:50:34,929 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:34,929 INFO 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 01:50:34,929 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 01:50:34,929 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 01:50:34,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 01:50:34,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 01:50:34,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-02-04 01:50:34,930 INFO L87 Difference]: Start difference. First operand 156 states and 184 transitions. Second operand 22 states. [2018-02-04 01:50:35,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:35,246 INFO L93 Difference]: Finished difference Result 291 states and 341 transitions. [2018-02-04 01:50:35,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 01:50:35,246 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 141 [2018-02-04 01:50:35,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:35,247 INFO L225 Difference]: With dead ends: 291 [2018-02-04 01:50:35,247 INFO L226 Difference]: Without dead ends: 161 [2018-02-04 01:50:35,247 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 01:50:35,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-04 01:50:35,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2018-02-04 01:50:35,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-04 01:50:35,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 188 transitions. [2018-02-04 01:50:35,249 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 188 transitions. Word has length 141 [2018-02-04 01:50:35,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:35,249 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 188 transitions. [2018-02-04 01:50:35,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 01:50:35,249 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 188 transitions. [2018-02-04 01:50:35,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-02-04 01:50:35,250 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:35,250 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 01:50:35,250 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 01:50:35,250 INFO L82 PathProgramCache]: Analyzing trace with hash 753871161, now seen corresponding path program 14 times [2018-02-04 01:50:35,251 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:35,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:35,605 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 01:50:35,606 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:35,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 01:50:35,646 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:35,646 INFO 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 01:50:35,646 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 01:50:35,646 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 01:50:35,646 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 01:50:35,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 01:50:35,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2018-02-04 01:50:35,647 INFO L87 Difference]: Start difference. First operand 160 states and 188 transitions. Second operand 27 states. [2018-02-04 01:50:36,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:36,350 INFO L93 Difference]: Finished difference Result 239 states and 270 transitions. [2018-02-04 01:50:36,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 01:50:36,350 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 145 [2018-02-04 01:50:36,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:36,351 INFO L225 Difference]: With dead ends: 239 [2018-02-04 01:50:36,351 INFO L226 Difference]: Without dead ends: 239 [2018-02-04 01:50:36,351 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=450, Invalid=2412, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 01:50:36,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-04 01:50:36,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 168. [2018-02-04 01:50:36,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-04 01:50:36,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 198 transitions. [2018-02-04 01:50:36,353 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 198 transitions. Word has length 145 [2018-02-04 01:50:36,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:36,354 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 198 transitions. [2018-02-04 01:50:36,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 01:50:36,354 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 198 transitions. [2018-02-04 01:50:36,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-02-04 01:50:36,354 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:36,354 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 01:50:36,354 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 01:50:36,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1650228347, now seen corresponding path program 8 times [2018-02-04 01:50:36,355 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:36,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:36,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:36,731 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 01:50:36,731 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:36,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 01:50:36,731 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:36,731 INFO 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 01:50:36,731 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 01:50:36,731 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 01:50:36,731 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 01:50:36,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 01:50:36,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2018-02-04 01:50:36,732 INFO L87 Difference]: Start difference. First operand 168 states and 198 transitions. Second operand 28 states. [2018-02-04 01:50:37,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:37,708 INFO L93 Difference]: Finished difference Result 253 states and 286 transitions. [2018-02-04 01:50:37,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 01:50:37,709 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 149 [2018-02-04 01:50:37,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:37,710 INFO L225 Difference]: With dead ends: 253 [2018-02-04 01:50:37,710 INFO L226 Difference]: Without dead ends: 253 [2018-02-04 01:50:37,710 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 01:50:37,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-04 01:50:37,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 169. [2018-02-04 01:50:37,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-04 01:50:37,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 200 transitions. [2018-02-04 01:50:37,748 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 200 transitions. Word has length 149 [2018-02-04 01:50:37,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:37,749 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 200 transitions. [2018-02-04 01:50:37,749 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 01:50:37,749 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 200 transitions. [2018-02-04 01:50:37,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-04 01:50:37,749 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:37,750 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 01:50:37,750 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 01:50:37,750 INFO L82 PathProgramCache]: Analyzing trace with hash -923414356, now seen corresponding path program 15 times [2018-02-04 01:50:37,750 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:37,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:38,126 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 01:50:38,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:38,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 01:50:38,126 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:38,126 INFO 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 01:50:38,126 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 01:50:38,126 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 01:50:38,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 01:50:38,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 01:50:38,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-02-04 01:50:38,127 INFO L87 Difference]: Start difference. First operand 169 states and 200 transitions. Second operand 24 states. [2018-02-04 01:50:38,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:38,524 INFO L93 Difference]: Finished difference Result 320 states and 376 transitions. [2018-02-04 01:50:38,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 01:50:38,524 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 154 [2018-02-04 01:50:38,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:38,525 INFO L225 Difference]: With dead ends: 320 [2018-02-04 01:50:38,525 INFO L226 Difference]: Without dead ends: 174 [2018-02-04 01:50:38,525 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 01:50:38,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-04 01:50:38,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-02-04 01:50:38,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-04 01:50:38,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 204 transitions. [2018-02-04 01:50:38,527 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 204 transitions. Word has length 154 [2018-02-04 01:50:38,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:38,527 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 204 transitions. [2018-02-04 01:50:38,527 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 01:50:38,527 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 204 transitions. [2018-02-04 01:50:38,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-02-04 01:50:38,527 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:38,527 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 01:50:38,527 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 01:50:38,528 INFO L82 PathProgramCache]: Analyzing trace with hash 133184073, now seen corresponding path program 16 times [2018-02-04 01:50:38,528 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:38,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:39,039 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 01:50:39,039 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:39,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 01:50:39,039 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:39,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:39,040 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 01:50:39,040 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 01:50:39,040 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 01:50:39,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 01:50:39,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2018-02-04 01:50:39,041 INFO L87 Difference]: Start difference. First operand 173 states and 204 transitions. Second operand 29 states. [2018-02-04 01:50:39,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:39,865 INFO L93 Difference]: Finished difference Result 263 states and 297 transitions. [2018-02-04 01:50:39,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 01:50:39,865 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 158 [2018-02-04 01:50:39,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:39,866 INFO L225 Difference]: With dead ends: 263 [2018-02-04 01:50:39,866 INFO L226 Difference]: Without dead ends: 263 [2018-02-04 01:50:39,866 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 01:50:39,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-04 01:50:39,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 181. [2018-02-04 01:50:39,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-04 01:50:39,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 214 transitions. [2018-02-04 01:50:39,868 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 214 transitions. Word has length 158 [2018-02-04 01:50:39,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:39,868 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 214 transitions. [2018-02-04 01:50:39,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 01:50:39,869 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 214 transitions. [2018-02-04 01:50:39,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-02-04 01:50:39,869 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:39,869 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 01:50:39,869 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 01:50:39,869 INFO L82 PathProgramCache]: Analyzing trace with hash -984709749, now seen corresponding path program 9 times [2018-02-04 01:50:39,870 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:39,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:40,333 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 01:50:40,333 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:40,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-04 01:50:40,333 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:40,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 01:50:40,334 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 01:50:40,334 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 01:50:40,334 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 01:50:40,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 01:50:40,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2018-02-04 01:50:40,334 INFO L87 Difference]: Start difference. First operand 181 states and 214 transitions. Second operand 30 states. [2018-02-04 01:50:41,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:41,369 INFO L93 Difference]: Finished difference Result 273 states and 309 transitions. [2018-02-04 01:50:41,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 01:50:41,370 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 162 [2018-02-04 01:50:41,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:41,370 INFO L225 Difference]: With dead ends: 273 [2018-02-04 01:50:41,370 INFO L226 Difference]: Without dead ends: 273 [2018-02-04 01:50:41,371 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 01:50:41,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-02-04 01:50:41,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 182. [2018-02-04 01:50:41,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-04 01:50:41,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 216 transitions. [2018-02-04 01:50:41,373 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 216 transitions. Word has length 162 [2018-02-04 01:50:41,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:41,373 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 216 transitions. [2018-02-04 01:50:41,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 01:50:41,373 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 216 transitions. [2018-02-04 01:50:41,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-02-04 01:50:41,373 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:41,373 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 01:50:41,373 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 01:50:41,374 INFO L82 PathProgramCache]: Analyzing trace with hash -466685540, now seen corresponding path program 17 times [2018-02-04 01:50:41,374 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:41,393 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:41,705 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 01:50:41,705 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:41,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 01:50:41,705 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:41,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:41,705 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 01:50:41,705 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 01:50:41,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 01:50:41,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 01:50:41,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-02-04 01:50:41,706 INFO L87 Difference]: Start difference. First operand 182 states and 216 transitions. Second operand 26 states. [2018-02-04 01:50:42,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:42,137 INFO L93 Difference]: Finished difference Result 349 states and 411 transitions. [2018-02-04 01:50:42,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 01:50:42,137 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 167 [2018-02-04 01:50:42,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:42,138 INFO L225 Difference]: With dead ends: 349 [2018-02-04 01:50:42,138 INFO L226 Difference]: Without dead ends: 187 [2018-02-04 01:50:42,138 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 01:50:42,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-04 01:50:42,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2018-02-04 01:50:42,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-04 01:50:42,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 220 transitions. [2018-02-04 01:50:42,140 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 220 transitions. Word has length 167 [2018-02-04 01:50:42,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:42,140 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 220 transitions. [2018-02-04 01:50:42,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 01:50:42,140 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 220 transitions. [2018-02-04 01:50:42,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-02-04 01:50:42,141 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:42,141 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 01:50:42,141 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 01:50:42,142 INFO L82 PathProgramCache]: Analyzing trace with hash -936653025, now seen corresponding path program 18 times [2018-02-04 01:50:42,142 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:42,160 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:42,631 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 01:50:42,631 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:42,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 01:50:42,632 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:42,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:42,632 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 01:50:42,632 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 01:50:42,632 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 01:50:42,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 01:50:42,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2018-02-04 01:50:42,633 INFO L87 Difference]: Start difference. First operand 186 states and 220 transitions. Second operand 31 states. [2018-02-04 01:50:43,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:43,535 INFO L93 Difference]: Finished difference Result 279 states and 316 transitions. [2018-02-04 01:50:43,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 01:50:43,535 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 171 [2018-02-04 01:50:43,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:43,536 INFO L225 Difference]: With dead ends: 279 [2018-02-04 01:50:43,536 INFO L226 Difference]: Without dead ends: 279 [2018-02-04 01:50:43,537 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=519, Invalid=3263, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 01:50:43,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-02-04 01:50:43,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 194. [2018-02-04 01:50:43,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-04 01:50:43,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 230 transitions. [2018-02-04 01:50:43,539 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 230 transitions. Word has length 171 [2018-02-04 01:50:43,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:43,539 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 230 transitions. [2018-02-04 01:50:43,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 01:50:43,540 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 230 transitions. [2018-02-04 01:50:43,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-02-04 01:50:43,540 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:43,541 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 01:50:43,541 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 01:50:43,541 INFO L82 PathProgramCache]: Analyzing trace with hash 560447329, now seen corresponding path program 10 times [2018-02-04 01:50:43,541 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:43,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:44,040 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 01:50:44,040 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:44,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 01:50:44,040 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:44,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:44,041 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 01:50:44,041 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 01:50:44,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 01:50:44,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 01:50:44,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2018-02-04 01:50:44,044 INFO L87 Difference]: Start difference. First operand 194 states and 230 transitions. Second operand 32 states. [2018-02-04 01:50:45,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:45,196 INFO L93 Difference]: Finished difference Result 293 states and 332 transitions. [2018-02-04 01:50:45,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 01:50:45,196 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 175 [2018-02-04 01:50:45,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:45,197 INFO L225 Difference]: With dead ends: 293 [2018-02-04 01:50:45,197 INFO L226 Difference]: Without dead ends: 293 [2018-02-04 01:50:45,197 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=581, Invalid=3841, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 01:50:45,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-02-04 01:50:45,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 195. [2018-02-04 01:50:45,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-04 01:50:45,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 232 transitions. [2018-02-04 01:50:45,199 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 232 transitions. Word has length 175 [2018-02-04 01:50:45,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:45,200 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 232 transitions. [2018-02-04 01:50:45,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 01:50:45,200 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 232 transitions. [2018-02-04 01:50:45,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-02-04 01:50:45,201 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:45,201 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 01:50:45,201 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 01:50:45,201 INFO L82 PathProgramCache]: Analyzing trace with hash -518099578, now seen corresponding path program 19 times [2018-02-04 01:50:45,201 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:45,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:45,580 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 01:50:45,580 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:45,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 01:50:45,580 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:45,580 INFO 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 01:50:45,580 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 01:50:45,580 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 01:50:45,581 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 01:50:45,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 01:50:45,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-02-04 01:50:45,581 INFO L87 Difference]: Start difference. First operand 195 states and 232 transitions. Second operand 28 states. [2018-02-04 01:50:46,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:46,093 INFO L93 Difference]: Finished difference Result 378 states and 446 transitions. [2018-02-04 01:50:46,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 01:50:46,093 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 180 [2018-02-04 01:50:46,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:46,094 INFO L225 Difference]: With dead ends: 378 [2018-02-04 01:50:46,094 INFO L226 Difference]: Without dead ends: 200 [2018-02-04 01:50:46,094 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=1459, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 01:50:46,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-02-04 01:50:46,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2018-02-04 01:50:46,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-04 01:50:46,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 236 transitions. [2018-02-04 01:50:46,096 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 236 transitions. Word has length 180 [2018-02-04 01:50:46,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:46,096 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 236 transitions. [2018-02-04 01:50:46,096 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 01:50:46,096 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 236 transitions. [2018-02-04 01:50:46,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-02-04 01:50:46,097 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:46,097 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 01:50:46,097 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 01:50:46,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1647238371, now seen corresponding path program 20 times [2018-02-04 01:50:46,097 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:46,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:46,763 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 01:50:46,763 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:46,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 01:50:46,763 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:46,764 INFO 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 01:50:46,764 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 01:50:46,764 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 01:50:46,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 01:50:46,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 01:50:46,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=883, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 01:50:46,764 INFO L87 Difference]: Start difference. First operand 199 states and 236 transitions. Second operand 33 states. [2018-02-04 01:50:47,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:47,611 INFO L93 Difference]: Finished difference Result 307 states and 347 transitions. [2018-02-04 01:50:47,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 01:50:47,611 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 184 [2018-02-04 01:50:47,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:47,612 INFO L225 Difference]: With dead ends: 307 [2018-02-04 01:50:47,612 INFO L226 Difference]: Without dead ends: 307 [2018-02-04 01:50:47,612 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 01:50:47,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-02-04 01:50:47,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 207. [2018-02-04 01:50:47,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-04 01:50:47,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 246 transitions. [2018-02-04 01:50:47,614 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 246 transitions. Word has length 184 [2018-02-04 01:50:47,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:47,614 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 246 transitions. [2018-02-04 01:50:47,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 01:50:47,614 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 246 transitions. [2018-02-04 01:50:47,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-02-04 01:50:47,615 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:47,615 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 01:50:47,615 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 01:50:47,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1008317659, now seen corresponding path program 11 times [2018-02-04 01:50:47,615 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:47,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:48,237 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 01:50:48,238 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:48,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-04 01:50:48,238 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:48,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 01:50:48,238 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 01:50:48,238 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 01:50:48,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 01:50:48,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 01:50:48,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=947, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 01:50:48,239 INFO L87 Difference]: Start difference. First operand 207 states and 246 transitions. Second operand 34 states. [2018-02-04 01:50:49,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:49,432 INFO L93 Difference]: Finished difference Result 321 states and 363 transitions. [2018-02-04 01:50:49,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-04 01:50:49,433 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 188 [2018-02-04 01:50:49,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:49,434 INFO L225 Difference]: With dead ends: 321 [2018-02-04 01:50:49,434 INFO L226 Difference]: Without dead ends: 321 [2018-02-04 01:50:49,434 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1826 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1112, Invalid=5530, Unknown=0, NotChecked=0, Total=6642 [2018-02-04 01:50:49,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-02-04 01:50:49,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 208. [2018-02-04 01:50:49,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-04 01:50:49,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 248 transitions. [2018-02-04 01:50:49,437 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 248 transitions. Word has length 188 [2018-02-04 01:50:49,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:49,437 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 248 transitions. [2018-02-04 01:50:49,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 01:50:49,437 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 248 transitions. [2018-02-04 01:50:49,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-02-04 01:50:49,437 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:49,437 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 01:50:49,437 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 01:50:49,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1653302206, now seen corresponding path program 21 times [2018-02-04 01:50:49,438 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:49,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:49,845 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 01:50:49,846 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:49,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-04 01:50:49,884 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:49,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 01:50:49,884 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 01:50:49,885 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 01:50:49,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 01:50:49,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 01:50:49,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-02-04 01:50:49,885 INFO L87 Difference]: Start difference. First operand 208 states and 248 transitions. Second operand 30 states. [2018-02-04 01:50:50,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:50,507 INFO L93 Difference]: Finished difference Result 407 states and 481 transitions. [2018-02-04 01:50:50,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 01:50:50,507 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 193 [2018-02-04 01:50:50,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:50,508 INFO L225 Difference]: With dead ends: 407 [2018-02-04 01:50:50,508 INFO L226 Difference]: Without dead ends: 213 [2018-02-04 01:50:50,508 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 01:50:50,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-02-04 01:50:50,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2018-02-04 01:50:50,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-04 01:50:50,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 252 transitions. [2018-02-04 01:50:50,510 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 252 transitions. Word has length 193 [2018-02-04 01:50:50,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:50,510 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 252 transitions. [2018-02-04 01:50:50,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 01:50:50,510 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 252 transitions. [2018-02-04 01:50:50,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-02-04 01:50:50,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:50,511 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 01:50:50,511 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 01:50:50,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1906127867, now seen corresponding path program 22 times [2018-02-04 01:50:50,511 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:50,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:51,107 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 01:50:51,108 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:51,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-04 01:50:51,108 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:51,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:51,108 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 01:50:51,108 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 01:50:51,108 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 01:50:51,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 01:50:51,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1002, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 01:50:51,109 INFO L87 Difference]: Start difference. First operand 212 states and 252 transitions. Second operand 35 states. [2018-02-04 01:50:52,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:52,261 INFO L93 Difference]: Finished difference Result 327 states and 370 transitions. [2018-02-04 01:50:52,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 01:50:52,261 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 197 [2018-02-04 01:50:52,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:52,262 INFO L225 Difference]: With dead ends: 327 [2018-02-04 01:50:52,262 INFO L226 Difference]: Without dead ends: 327 [2018-02-04 01:50:52,262 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 01:50:52,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-02-04 01:50:52,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 220. [2018-02-04 01:50:52,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-04 01:50:52,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 262 transitions. [2018-02-04 01:50:52,264 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 262 transitions. Word has length 197 [2018-02-04 01:50:52,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:52,264 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 262 transitions. [2018-02-04 01:50:52,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 01:50:52,264 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 262 transitions. [2018-02-04 01:50:52,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-02-04 01:50:52,265 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:52,265 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 01:50:52,265 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 01:50:52,266 INFO L82 PathProgramCache]: Analyzing trace with hash -932587193, now seen corresponding path program 12 times [2018-02-04 01:50:52,266 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:52,285 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:52,903 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 01:50:52,903 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:52,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-04 01:50:52,903 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:52,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:50:52,904 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 01:50:52,904 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 01:50:52,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 01:50:52,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 01:50:52,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1070, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 01:50:52,905 INFO L87 Difference]: Start difference. First operand 220 states and 262 transitions. Second operand 36 states. [2018-02-04 01:50:54,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:54,348 INFO L93 Difference]: Finished difference Result 341 states and 386 transitions. [2018-02-04 01:50:54,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-02-04 01:50:54,348 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 201 [2018-02-04 01:50:54,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:54,349 INFO L225 Difference]: With dead ends: 341 [2018-02-04 01:50:54,349 INFO L226 Difference]: Without dead ends: 341 [2018-02-04 01:50:54,350 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1971 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1140, Invalid=6000, Unknown=0, NotChecked=0, Total=7140 [2018-02-04 01:50:54,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-02-04 01:50:54,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 221. [2018-02-04 01:50:54,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-04 01:50:54,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 264 transitions. [2018-02-04 01:50:54,352 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 264 transitions. Word has length 201 [2018-02-04 01:50:54,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:54,352 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 264 transitions. [2018-02-04 01:50:54,352 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 01:50:54,352 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 264 transitions. [2018-02-04 01:50:54,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-02-04 01:50:54,353 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:54,353 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 01:50:54,353 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 01:50:54,353 INFO L82 PathProgramCache]: Analyzing trace with hash 2097058656, now seen corresponding path program 23 times [2018-02-04 01:50:54,353 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:54,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:54,795 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 01:50:54,796 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:54,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 01:50:54,796 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:54,796 INFO 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 01:50:54,796 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 01:50:54,796 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 01:50:54,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 01:50:54,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 01:50:54,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-02-04 01:50:54,797 INFO L87 Difference]: Start difference. First operand 221 states and 264 transitions. Second operand 32 states. [2018-02-04 01:50:55,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:55,454 INFO L93 Difference]: Finished difference Result 436 states and 516 transitions. [2018-02-04 01:50:55,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 01:50:55,454 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 206 [2018-02-04 01:50:55,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:55,455 INFO L225 Difference]: With dead ends: 436 [2018-02-04 01:50:55,455 INFO L226 Difference]: Without dead ends: 226 [2018-02-04 01:50:55,455 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 01:50:55,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-04 01:50:55,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-02-04 01:50:55,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-04 01:50:55,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 268 transitions. [2018-02-04 01:50:55,457 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 268 transitions. Word has length 206 [2018-02-04 01:50:55,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:55,457 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 268 transitions. [2018-02-04 01:50:55,457 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 01:50:55,457 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 268 transitions. [2018-02-04 01:50:55,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-02-04 01:50:55,458 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:55,458 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 01:50:55,458 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 01:50:55,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1027254147, now seen corresponding path program 24 times [2018-02-04 01:50:55,458 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:55,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:56,171 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 01:50:56,171 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:56,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 01:50:56,171 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:56,171 INFO 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 01:50:56,171 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 01:50:56,172 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 01:50:56,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 01:50:56,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 01:50:56,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1105, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 01:50:56,172 INFO L87 Difference]: Start difference. First operand 225 states and 268 transitions. Second operand 37 states. [2018-02-04 01:50:57,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:57,227 INFO L93 Difference]: Finished difference Result 351 states and 397 transitions. [2018-02-04 01:50:57,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-04 01:50:57,228 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 210 [2018-02-04 01:50:57,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:57,229 INFO L225 Difference]: With dead ends: 351 [2018-02-04 01:50:57,229 INFO L226 Difference]: Without dead ends: 351 [2018-02-04 01:50:57,229 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 01:50:57,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-02-04 01:50:57,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 233. [2018-02-04 01:50:57,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-02-04 01:50:57,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 278 transitions. [2018-02-04 01:50:57,231 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 278 transitions. Word has length 210 [2018-02-04 01:50:57,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:57,231 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 278 transitions. [2018-02-04 01:50:57,231 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 01:50:57,231 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 278 transitions. [2018-02-04 01:50:57,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-02-04 01:50:57,232 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:57,232 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 01:50:57,232 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 01:50:57,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1220449857, now seen corresponding path program 13 times [2018-02-04 01:50:57,233 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:57,247 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:50:58,046 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 01:50:58,046 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:50:58,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-04 01:50:58,047 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:50:58,047 INFO 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 01:50:58,047 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 01:50:58,047 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 01:50:58,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 01:50:58,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 01:50:58,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1480, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 01:50:58,048 INFO L87 Difference]: Start difference. First operand 233 states and 278 transitions. Second operand 41 states. [2018-02-04 01:50:59,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:50:59,601 INFO L93 Difference]: Finished difference Result 341 states and 389 transitions. [2018-02-04 01:50:59,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 01:50:59,601 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 214 [2018-02-04 01:50:59,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:50:59,602 INFO L225 Difference]: With dead ends: 341 [2018-02-04 01:50:59,602 INFO L226 Difference]: Without dead ends: 341 [2018-02-04 01:50:59,603 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 01:50:59,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-02-04 01:50:59,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 234. [2018-02-04 01:50:59,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-02-04 01:50:59,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 280 transitions. [2018-02-04 01:50:59,605 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 280 transitions. Word has length 214 [2018-02-04 01:50:59,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:50:59,605 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 280 transitions. [2018-02-04 01:50:59,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 01:50:59,605 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 280 transitions. [2018-02-04 01:50:59,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-02-04 01:50:59,605 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:50:59,605 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 01:50:59,606 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 01:50:59,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1020883480, now seen corresponding path program 25 times [2018-02-04 01:50:59,606 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:50:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:50:59,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:00,196 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 01:51:00,196 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:51:00,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-04 01:51:00,196 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:00,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:51:00,197 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 01:51:00,197 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 01:51:00,197 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 01:51:00,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 01:51:00,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 01:51:00,197 INFO L87 Difference]: Start difference. First operand 234 states and 280 transitions. Second operand 34 states. [2018-02-04 01:51:00,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:00,967 INFO L93 Difference]: Finished difference Result 465 states and 551 transitions. [2018-02-04 01:51:00,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 01:51:00,967 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 219 [2018-02-04 01:51:00,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:00,968 INFO L225 Difference]: With dead ends: 465 [2018-02-04 01:51:00,968 INFO L226 Difference]: Without dead ends: 239 [2018-02-04 01:51:00,968 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 01:51:00,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-04 01:51:00,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 238. [2018-02-04 01:51:00,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-04 01:51:00,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 284 transitions. [2018-02-04 01:51:00,970 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 284 transitions. Word has length 219 [2018-02-04 01:51:00,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:00,970 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 284 transitions. [2018-02-04 01:51:00,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 01:51:00,970 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 284 transitions. [2018-02-04 01:51:00,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-02-04 01:51:00,971 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:00,971 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 01:51:00,971 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 01:51:00,971 INFO L82 PathProgramCache]: Analyzing trace with hash -781729813, now seen corresponding path program 26 times [2018-02-04 01:51:00,971 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51:00,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:01,875 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 01:51:01,875 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:51:01,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-04 01:51:01,936 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:01,936 INFO 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 01:51:01,936 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 01:51:01,936 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 01:51:01,936 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 01:51:01,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 01:51:01,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1547, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 01:51:01,937 INFO L87 Difference]: Start difference. First operand 238 states and 284 transitions. Second operand 42 states. [2018-02-04 01:51:03,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:03,834 INFO L93 Difference]: Finished difference Result 347 states and 396 transitions. [2018-02-04 01:51:03,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 01:51:03,835 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 223 [2018-02-04 01:51:03,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:03,836 INFO L225 Difference]: With dead ends: 347 [2018-02-04 01:51:03,836 INFO L226 Difference]: Without dead ends: 347 [2018-02-04 01:51:03,836 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=277, Invalid=3629, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 01:51:03,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-02-04 01:51:03,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 246. [2018-02-04 01:51:03,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-02-04 01:51:03,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 294 transitions. [2018-02-04 01:51:03,839 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 294 transitions. Word has length 223 [2018-02-04 01:51:03,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:03,839 INFO L432 AbstractCegarLoop]: Abstraction has 246 states and 294 transitions. [2018-02-04 01:51:03,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 01:51:03,839 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 294 transitions. [2018-02-04 01:51:03,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-02-04 01:51:03,840 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:03,841 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 01:51:03,841 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 01:51:03,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1449552429, now seen corresponding path program 14 times [2018-02-04 01:51:03,841 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51:03,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:04,825 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 01:51:04,825 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:51:04,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-04 01:51:04,825 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:04,826 INFO 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 01:51:04,826 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 01:51:04,826 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 01:51:04,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 01:51:04,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 01:51:04,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1629, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 01:51:04,826 INFO L87 Difference]: Start difference. First operand 246 states and 294 transitions. Second operand 43 states. [2018-02-04 01:51:06,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:06,570 INFO L93 Difference]: Finished difference Result 361 states and 412 transitions. [2018-02-04 01:51:06,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 01:51:06,571 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 227 [2018-02-04 01:51:06,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:06,572 INFO L225 Difference]: With dead ends: 361 [2018-02-04 01:51:06,572 INFO L226 Difference]: Without dead ends: 361 [2018-02-04 01:51:06,572 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 01:51:06,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-02-04 01:51:06,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 247. [2018-02-04 01:51:06,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-02-04 01:51:06,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 296 transitions. [2018-02-04 01:51:06,574 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 296 transitions. Word has length 227 [2018-02-04 01:51:06,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:06,574 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 296 transitions. [2018-02-04 01:51:06,574 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 01:51:06,574 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 296 transitions. [2018-02-04 01:51:06,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-02-04 01:51:06,575 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:06,575 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 01:51:06,575 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 01:51:06,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1898536390, now seen corresponding path program 27 times [2018-02-04 01:51:06,576 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51:06,592 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:07,153 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 01:51:07,153 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:51:07,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 01:51:07,153 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:07,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:51:07,153 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 01:51:07,154 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 01:51:07,154 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 01:51:07,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 01:51:07,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 01:51:07,154 INFO L87 Difference]: Start difference. First operand 247 states and 296 transitions. Second operand 36 states. [2018-02-04 01:51:08,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:08,082 INFO L93 Difference]: Finished difference Result 494 states and 586 transitions. [2018-02-04 01:51:08,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 01:51:08,082 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 232 [2018-02-04 01:51:08,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:08,084 INFO L225 Difference]: With dead ends: 494 [2018-02-04 01:51:08,084 INFO L226 Difference]: Without dead ends: 252 [2018-02-04 01:51:08,084 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=2519, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 01:51:08,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-02-04 01:51:08,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 251. [2018-02-04 01:51:08,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-02-04 01:51:08,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 300 transitions. [2018-02-04 01:51:08,086 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 300 transitions. Word has length 232 [2018-02-04 01:51:08,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:08,086 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 300 transitions. [2018-02-04 01:51:08,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 01:51:08,086 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 300 transitions. [2018-02-04 01:51:08,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-02-04 01:51:08,087 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:08,087 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 01:51:08,087 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 01:51:08,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1764756759, now seen corresponding path program 28 times [2018-02-04 01:51:08,088 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51:08,105 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:08,863 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 01:51:08,863 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:51:08,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-04 01:51:08,863 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:08,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:51:08,863 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 01:51:08,863 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 01:51:08,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 01:51:08,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 01:51:08,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1351, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 01:51:08,864 INFO L87 Difference]: Start difference. First operand 251 states and 300 transitions. Second operand 41 states. [2018-02-04 01:51:10,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:10,193 INFO L93 Difference]: Finished difference Result 395 states and 447 transitions. [2018-02-04 01:51:10,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-02-04 01:51:10,193 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 236 [2018-02-04 01:51:10,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:10,194 INFO L225 Difference]: With dead ends: 395 [2018-02-04 01:51:10,194 INFO L226 Difference]: Without dead ends: 395 [2018-02-04 01:51:10,194 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2197 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1517, Invalid=6493, Unknown=0, NotChecked=0, Total=8010 [2018-02-04 01:51:10,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-02-04 01:51:10,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 259. [2018-02-04 01:51:10,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-02-04 01:51:10,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 310 transitions. [2018-02-04 01:51:10,196 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 310 transitions. Word has length 236 [2018-02-04 01:51:10,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:10,196 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 310 transitions. [2018-02-04 01:51:10,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 01:51:10,196 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 310 transitions. [2018-02-04 01:51:10,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-02-04 01:51:10,197 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:10,197 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 01:51:10,197 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 01:51:10,197 INFO L82 PathProgramCache]: Analyzing trace with hash 162283865, now seen corresponding path program 15 times [2018-02-04 01:51:10,198 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51:10,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:11,137 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 01:51:11,137 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:51:11,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-04 01:51:11,138 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:11,138 INFO 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 01:51:11,138 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 01:51:11,138 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 01:51:11,138 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 01:51:11,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 01:51:11,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1431, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 01:51:11,139 INFO L87 Difference]: Start difference. First operand 259 states and 310 transitions. Second operand 42 states. [2018-02-04 01:51:13,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:13,111 INFO L93 Difference]: Finished difference Result 409 states and 463 transitions. [2018-02-04 01:51:13,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-02-04 01:51:13,111 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 240 [2018-02-04 01:51:13,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:13,112 INFO L225 Difference]: With dead ends: 409 [2018-02-04 01:51:13,113 INFO L226 Difference]: Without dead ends: 409 [2018-02-04 01:51:13,113 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3274 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1924, Invalid=9206, Unknown=0, NotChecked=0, Total=11130 [2018-02-04 01:51:13,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-02-04 01:51:13,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 260. [2018-02-04 01:51:13,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-02-04 01:51:13,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 312 transitions. [2018-02-04 01:51:13,115 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 312 transitions. Word has length 240 [2018-02-04 01:51:13,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:13,115 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 312 transitions. [2018-02-04 01:51:13,116 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 01:51:13,116 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 312 transitions. [2018-02-04 01:51:13,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-02-04 01:51:13,116 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:13,116 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 01:51:13,116 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 01:51:13,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1270113934, now seen corresponding path program 29 times [2018-02-04 01:51:13,117 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51:13,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:13,788 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 01:51:13,789 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:51:13,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-04 01:51:13,789 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:13,789 INFO 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 01:51:13,789 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 01:51:13,789 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 01:51:13,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 01:51:13,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 01:51:13,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 01:51:13,790 INFO L87 Difference]: Start difference. First operand 260 states and 312 transitions. Second operand 38 states. [2018-02-04 01:51:14,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:14,770 INFO L93 Difference]: Finished difference Result 523 states and 621 transitions. [2018-02-04 01:51:14,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 01:51:14,771 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 245 [2018-02-04 01:51:14,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:14,771 INFO L225 Difference]: With dead ends: 523 [2018-02-04 01:51:14,771 INFO L226 Difference]: Without dead ends: 265 [2018-02-04 01:51:14,772 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 01:51:14,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-02-04 01:51:14,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 264. [2018-02-04 01:51:14,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-02-04 01:51:14,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 316 transitions. [2018-02-04 01:51:14,773 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 316 transitions. Word has length 245 [2018-02-04 01:51:14,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:14,774 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 316 transitions. [2018-02-04 01:51:14,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 01:51:14,774 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 316 transitions. [2018-02-04 01:51:14,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-02-04 01:51:14,774 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:14,774 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 01:51:14,774 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 01:51:14,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1678882095, now seen corresponding path program 30 times [2018-02-04 01:51:14,775 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51:14,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:15,773 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 01:51:15,774 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:51:15,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-04 01:51:15,774 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:15,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:51:15,774 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 01:51:15,774 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 01:51:15,775 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 01:51:15,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 01:51:15,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1498, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 01:51:15,775 INFO L87 Difference]: Start difference. First operand 264 states and 316 transitions. Second operand 43 states. [2018-02-04 01:51:17,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:17,198 INFO L93 Difference]: Finished difference Result 415 states and 470 transitions. [2018-02-04 01:51:17,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-02-04 01:51:17,198 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 249 [2018-02-04 01:51:17,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:17,200 INFO L225 Difference]: With dead ends: 415 [2018-02-04 01:51:17,200 INFO L226 Difference]: Without dead ends: 415 [2018-02-04 01:51:17,200 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 01:51:17,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-02-04 01:51:17,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 272. [2018-02-04 01:51:17,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-02-04 01:51:17,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 326 transitions. [2018-02-04 01:51:17,203 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 326 transitions. Word has length 249 [2018-02-04 01:51:17,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:17,203 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 326 transitions. [2018-02-04 01:51:17,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 01:51:17,203 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 326 transitions. [2018-02-04 01:51:17,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-02-04 01:51:17,204 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:17,204 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 01:51:17,204 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 01:51:17,204 INFO L82 PathProgramCache]: Analyzing trace with hash 323031571, now seen corresponding path program 16 times [2018-02-04 01:51:17,205 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51:17,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:18,163 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 01:51:18,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:51:18,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-04 01:51:18,164 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:18,164 INFO 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 01:51:18,164 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 01:51:18,164 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 01:51:18,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 01:51:18,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 01:51:18,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1582, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 01:51:18,165 INFO L87 Difference]: Start difference. First operand 272 states and 326 transitions. Second operand 44 states. [2018-02-04 01:51:20,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:20,020 INFO L93 Difference]: Finished difference Result 429 states and 486 transitions. [2018-02-04 01:51:20,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-02-04 01:51:20,020 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 253 [2018-02-04 01:51:20,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:20,021 INFO L225 Difference]: With dead ends: 429 [2018-02-04 01:51:20,021 INFO L226 Difference]: Without dead ends: 429 [2018-02-04 01:51:20,021 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3467 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1960, Invalid=9812, Unknown=0, NotChecked=0, Total=11772 [2018-02-04 01:51:20,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-02-04 01:51:20,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 273. [2018-02-04 01:51:20,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-02-04 01:51:20,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 328 transitions. [2018-02-04 01:51:20,024 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 328 transitions. Word has length 253 [2018-02-04 01:51:20,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:20,024 INFO L432 AbstractCegarLoop]: Abstraction has 273 states and 328 transitions. [2018-02-04 01:51:20,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 01:51:20,024 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 328 transitions. [2018-02-04 01:51:20,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-02-04 01:51:20,025 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:20,025 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 01:51:20,025 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 01:51:20,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1275525652, now seen corresponding path program 31 times [2018-02-04 01:51:20,025 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51:20,044 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:20,699 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 01:51:20,700 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:51:20,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-04 01:51:20,700 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:20,700 INFO 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 01:51:20,700 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 01:51:20,700 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 01:51:20,700 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 01:51:20,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 01:51:20,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 01:51:20,701 INFO L87 Difference]: Start difference. First operand 273 states and 328 transitions. Second operand 40 states. [2018-02-04 01:51:21,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:21,717 INFO L93 Difference]: Finished difference Result 552 states and 656 transitions. [2018-02-04 01:51:21,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 01:51:21,717 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 258 [2018-02-04 01:51:21,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:21,718 INFO L225 Difference]: With dead ends: 552 [2018-02-04 01:51:21,718 INFO L226 Difference]: Without dead ends: 278 [2018-02-04 01:51:21,718 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=149, Invalid=3157, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 01:51:21,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-02-04 01:51:21,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2018-02-04 01:51:21,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-02-04 01:51:21,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 332 transitions. [2018-02-04 01:51:21,720 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 332 transitions. Word has length 258 [2018-02-04 01:51:21,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:21,720 INFO L432 AbstractCegarLoop]: Abstraction has 277 states and 332 transitions. [2018-02-04 01:51:21,720 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 01:51:21,721 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 332 transitions. [2018-02-04 01:51:21,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-02-04 01:51:21,721 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:21,721 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 01:51:21,721 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 01:51:21,721 INFO L82 PathProgramCache]: Analyzing trace with hash -2062853455, now seen corresponding path program 32 times [2018-02-04 01:51:21,722 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51:21,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:22,696 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 01:51:22,696 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:51:22,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-04 01:51:22,696 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:22,696 INFO 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 01:51:22,697 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 01:51:22,697 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 01:51:22,697 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 01:51:22,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 01:51:22,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=1621, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 01:51:22,697 INFO L87 Difference]: Start difference. First operand 277 states and 332 transitions. Second operand 45 states. [2018-02-04 01:51:24,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:24,218 INFO L93 Difference]: Finished difference Result 439 states and 497 transitions. [2018-02-04 01:51:24,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-02-04 01:51:24,218 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 262 [2018-02-04 01:51:24,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:24,219 INFO L225 Difference]: With dead ends: 439 [2018-02-04 01:51:24,219 INFO L226 Difference]: Without dead ends: 439 [2018-02-04 01:51:24,220 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 01:51:24,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-02-04 01:51:24,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 285. [2018-02-04 01:51:24,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-02-04 01:51:24,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 342 transitions. [2018-02-04 01:51:24,222 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 342 transitions. Word has length 262 [2018-02-04 01:51:24,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:24,223 INFO L432 AbstractCegarLoop]: Abstraction has 285 states and 342 transitions. [2018-02-04 01:51:24,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 01:51:24,223 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 342 transitions. [2018-02-04 01:51:24,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-02-04 01:51:24,223 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:24,223 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 01:51:24,224 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 01:51:24,224 INFO L82 PathProgramCache]: Analyzing trace with hash 93532659, now seen corresponding path program 17 times [2018-02-04 01:51:24,224 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51:24,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:25,392 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 01:51:25,392 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:51:25,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-04 01:51:25,392 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:25,392 INFO 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 01:51:25,392 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 01:51:25,393 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 01:51:25,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 01:51:25,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 01:51:25,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=1740, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 01:51:25,393 INFO L87 Difference]: Start difference. First operand 285 states and 342 transitions. Second operand 46 states. [2018-02-04 01:51:27,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:27,448 INFO L93 Difference]: Finished difference Result 449 states and 509 transitions. [2018-02-04 01:51:27,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-02-04 01:51:27,448 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 266 [2018-02-04 01:51:27,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:27,449 INFO L225 Difference]: With dead ends: 449 [2018-02-04 01:51:27,449 INFO L226 Difference]: Without dead ends: 449 [2018-02-04 01:51:27,450 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3665 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1995, Invalid=10437, Unknown=0, NotChecked=0, Total=12432 [2018-02-04 01:51:27,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-02-04 01:51:27,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 286. [2018-02-04 01:51:27,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-02-04 01:51:27,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 344 transitions. [2018-02-04 01:51:27,454 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 344 transitions. Word has length 266 [2018-02-04 01:51:27,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:27,455 INFO L432 AbstractCegarLoop]: Abstraction has 286 states and 344 transitions. [2018-02-04 01:51:27,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 01:51:27,455 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 344 transitions. [2018-02-04 01:51:27,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-02-04 01:51:27,456 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:27,456 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 01:51:27,456 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 01:51:27,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1634584116, now seen corresponding path program 33 times [2018-02-04 01:51:27,457 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51:27,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:28,226 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 01:51:28,226 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:51:28,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-04 01:51:28,226 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:28,226 INFO 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 01:51:28,227 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 01:51:28,227 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 01:51:28,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 01:51:28,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 01:51:28,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 01:51:28,227 INFO L87 Difference]: Start difference. First operand 286 states and 344 transitions. Second operand 42 states. [2018-02-04 01:51:29,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:29,402 INFO L93 Difference]: Finished difference Result 581 states and 691 transitions. [2018-02-04 01:51:29,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 01:51:29,403 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 271 [2018-02-04 01:51:29,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:29,403 INFO L225 Difference]: With dead ends: 581 [2018-02-04 01:51:29,404 INFO L226 Difference]: Without dead ends: 291 [2018-02-04 01:51:29,404 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 01:51:29,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-02-04 01:51:29,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 290. [2018-02-04 01:51:29,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-02-04 01:51:29,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 348 transitions. [2018-02-04 01:51:29,406 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 348 transitions. Word has length 271 [2018-02-04 01:51:29,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:29,406 INFO L432 AbstractCegarLoop]: Abstraction has 290 states and 348 transitions. [2018-02-04 01:51:29,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 01:51:29,406 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 348 transitions. [2018-02-04 01:51:29,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-02-04 01:51:29,407 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:29,407 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 01:51:29,407 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 01:51:29,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1618342729, now seen corresponding path program 34 times [2018-02-04 01:51:29,407 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51:29,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:30,565 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 01:51:30,566 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:51:30,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-04 01:51:30,566 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:30,566 INFO 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 01:51:30,566 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 01:51:30,566 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 01:51:30,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 01:51:30,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 01:51:30,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1813, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 01:51:30,567 INFO L87 Difference]: Start difference. First operand 290 states and 348 transitions. Second operand 47 states. [2018-02-04 01:51:32,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:32,400 INFO L93 Difference]: Finished difference Result 455 states and 516 transitions. [2018-02-04 01:51:32,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-02-04 01:51:32,400 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 275 [2018-02-04 01:51:32,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:32,402 INFO L225 Difference]: With dead ends: 455 [2018-02-04 01:51:32,402 INFO L226 Difference]: Without dead ends: 455 [2018-02-04 01:51:32,403 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 01:51:32,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-02-04 01:51:32,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 298. [2018-02-04 01:51:32,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-02-04 01:51:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 358 transitions. [2018-02-04 01:51:32,405 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 358 transitions. Word has length 275 [2018-02-04 01:51:32,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:32,405 INFO L432 AbstractCegarLoop]: Abstraction has 298 states and 358 transitions. [2018-02-04 01:51:32,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 01:51:32,405 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 358 transitions. [2018-02-04 01:51:32,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-02-04 01:51:32,406 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:32,406 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 01:51:32,406 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 01:51:32,406 INFO L82 PathProgramCache]: Analyzing trace with hash 2109567225, now seen corresponding path program 18 times [2018-02-04 01:51:32,407 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51:32,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:33,490 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 01:51:33,491 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:51:33,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-02-04 01:51:33,491 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:33,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:51:33,491 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 01:51:33,491 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 01:51:33,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 01:51:33,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 01:51:33,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=1905, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 01:51:33,492 INFO L87 Difference]: Start difference. First operand 298 states and 358 transitions. Second operand 48 states. [2018-02-04 01:51:35,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:35,589 INFO L93 Difference]: Finished difference Result 469 states and 532 transitions. [2018-02-04 01:51:35,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-02-04 01:51:35,589 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 279 [2018-02-04 01:51:35,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:35,590 INFO L225 Difference]: With dead ends: 469 [2018-02-04 01:51:35,590 INFO L226 Difference]: Without dead ends: 469 [2018-02-04 01:51:35,591 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3868 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2029, Invalid=11081, Unknown=0, NotChecked=0, Total=13110 [2018-02-04 01:51:35,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-02-04 01:51:35,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 299. [2018-02-04 01:51:35,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-02-04 01:51:35,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 360 transitions. [2018-02-04 01:51:35,593 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 360 transitions. Word has length 279 [2018-02-04 01:51:35,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:35,594 INFO L432 AbstractCegarLoop]: Abstraction has 299 states and 360 transitions. [2018-02-04 01:51:35,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 01:51:35,594 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 360 transitions. [2018-02-04 01:51:35,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-02-04 01:51:35,594 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:35,594 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 01:51:35,594 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 01:51:35,595 INFO L82 PathProgramCache]: Analyzing trace with hash -15729938, now seen corresponding path program 35 times [2018-02-04 01:51:35,595 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51: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 01:51:36,418 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 01:51:36,418 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:51:36,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-04 01:51:36,419 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:36,419 INFO 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 01:51:36,419 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 01:51:36,419 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 01:51:36,419 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 01:51:36,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 01:51:36,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 01:51:36,420 INFO L87 Difference]: Start difference. First operand 299 states and 360 transitions. Second operand 44 states. [2018-02-04 01:51:37,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:37,725 INFO L93 Difference]: Finished difference Result 610 states and 726 transitions. [2018-02-04 01:51:37,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 01:51:37,726 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 284 [2018-02-04 01:51:37,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:37,727 INFO L225 Difference]: With dead ends: 610 [2018-02-04 01:51:37,727 INFO L226 Difference]: Without dead ends: 304 [2018-02-04 01:51:37,727 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 01:51:37,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-02-04 01:51:37,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 303. [2018-02-04 01:51:37,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-02-04 01:51:37,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 364 transitions. [2018-02-04 01:51:37,729 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 364 transitions. Word has length 284 [2018-02-04 01:51:37,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:37,729 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 364 transitions. [2018-02-04 01:51:37,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 01:51:37,729 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 364 transitions. [2018-02-04 01:51:37,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-02-04 01:51:37,730 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:37,730 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 01:51:37,730 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 01:51:37,730 INFO L82 PathProgramCache]: Analyzing trace with hash -938237621, now seen corresponding path program 36 times [2018-02-04 01:51:37,731 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51:37,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:38,920 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 01:51:38,921 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:51:38,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-04 01:51:38,921 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:38,921 INFO 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 01:51:38,921 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 01:51:38,921 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 01:51:38,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 01:51:38,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 01:51:38,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=1915, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 01:51:38,922 INFO L87 Difference]: Start difference. First operand 303 states and 364 transitions. Second operand 49 states. [2018-02-04 01:51:40,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:40,753 INFO L93 Difference]: Finished difference Result 483 states and 547 transitions. [2018-02-04 01:51:40,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-02-04 01:51:40,754 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 288 [2018-02-04 01:51:40,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:40,755 INFO L225 Difference]: With dead ends: 483 [2018-02-04 01:51:40,755 INFO L226 Difference]: Without dead ends: 483 [2018-02-04 01:51:40,756 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3431 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2331, Invalid=9659, Unknown=0, NotChecked=0, Total=11990 [2018-02-04 01:51:40,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-02-04 01:51:40,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 311. [2018-02-04 01:51:40,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-02-04 01:51:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 374 transitions. [2018-02-04 01:51:40,758 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 374 transitions. Word has length 288 [2018-02-04 01:51:40,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:40,758 INFO L432 AbstractCegarLoop]: Abstraction has 311 states and 374 transitions. [2018-02-04 01:51:40,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 01:51:40,758 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 374 transitions. [2018-02-04 01:51:40,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-02-04 01:51:40,759 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:40,759 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 01:51:40,759 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 01:51:40,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1736612749, now seen corresponding path program 19 times [2018-02-04 01:51:40,760 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51:40,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:41,979 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 01:51:41,979 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:51:41,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-04 01:51:41,980 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:41,980 INFO 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 01:51:41,980 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 01:51:41,980 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 01:51:41,980 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 01:51:41,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 01:51:41,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=2011, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 01:51:41,981 INFO L87 Difference]: Start difference. First operand 311 states and 374 transitions. Second operand 50 states. [2018-02-04 01:51:44,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:44,405 INFO L93 Difference]: Finished difference Result 497 states and 563 transitions. [2018-02-04 01:51:44,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-02-04 01:51:44,406 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 292 [2018-02-04 01:51:44,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:44,407 INFO L225 Difference]: With dead ends: 497 [2018-02-04 01:51:44,407 INFO L226 Difference]: Without dead ends: 497 [2018-02-04 01:51:44,408 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5138 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2960, Invalid=13810, Unknown=0, NotChecked=0, Total=16770 [2018-02-04 01:51:44,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2018-02-04 01:51:44,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 312. [2018-02-04 01:51:44,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-02-04 01:51:44,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 376 transitions. [2018-02-04 01:51:44,411 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 376 transitions. Word has length 292 [2018-02-04 01:51:44,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:44,411 INFO L432 AbstractCegarLoop]: Abstraction has 312 states and 376 transitions. [2018-02-04 01:51:44,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 01:51:44,411 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 376 transitions. [2018-02-04 01:51:44,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-02-04 01:51:44,411 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:44,412 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 01:51:44,412 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 01:51:44,412 INFO L82 PathProgramCache]: Analyzing trace with hash 276974810, now seen corresponding path program 37 times [2018-02-04 01:51:44,412 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51:44,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:45,379 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 01:51:45,379 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:51:45,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-04 01:51:45,379 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:45,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:51:45,379 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 01:51:45,380 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 01:51:45,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 01:51:45,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 01:51:45,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 01:51:45,380 INFO L87 Difference]: Start difference. First operand 312 states and 376 transitions. Second operand 46 states. [2018-02-04 01:51:46,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:46,850 INFO L93 Difference]: Finished difference Result 639 states and 761 transitions. [2018-02-04 01:51:46,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 01:51:46,850 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 297 [2018-02-04 01:51:46,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:46,851 INFO L225 Difference]: With dead ends: 639 [2018-02-04 01:51:46,851 INFO L226 Difference]: Without dead ends: 317 [2018-02-04 01:51:46,852 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 01:51:46,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-02-04 01:51:46,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 316. [2018-02-04 01:51:46,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-02-04 01:51:46,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 380 transitions. [2018-02-04 01:51:46,854 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 380 transitions. Word has length 297 [2018-02-04 01:51:46,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:46,854 INFO L432 AbstractCegarLoop]: Abstraction has 316 states and 380 transitions. [2018-02-04 01:51:46,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 01:51:46,854 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 380 transitions. [2018-02-04 01:51:46,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-02-04 01:51:46,855 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:46,855 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 01:51:46,855 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 01:51:46,855 INFO L82 PathProgramCache]: Analyzing trace with hash 581871005, now seen corresponding path program 38 times [2018-02-04 01:51:46,856 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51:46,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:48,161 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 01:51:48,161 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:51:48,161 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-02-04 01:51:48,161 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:48,161 INFO 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 01:51:48,161 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 01:51:48,162 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 01:51:48,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 01:51:48,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 01:51:48,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=2090, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 01:51:48,162 INFO L87 Difference]: Start difference. First operand 316 states and 380 transitions. Second operand 51 states. [2018-02-04 01:51:50,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:50,241 INFO L93 Difference]: Finished difference Result 503 states and 570 transitions. [2018-02-04 01:51:50,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-02-04 01:51:50,241 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 301 [2018-02-04 01:51:50,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:50,242 INFO L225 Difference]: With dead ends: 503 [2018-02-04 01:51:50,242 INFO L226 Difference]: Without dead ends: 503 [2018-02-04 01:51:50,243 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 01:51:50,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-02-04 01:51:50,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 324. [2018-02-04 01:51:50,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-02-04 01:51:50,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 390 transitions. [2018-02-04 01:51:50,246 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 390 transitions. Word has length 301 [2018-02-04 01:51:50,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:50,246 INFO L432 AbstractCegarLoop]: Abstraction has 324 states and 390 transitions. [2018-02-04 01:51:50,246 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 01:51:50,246 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 390 transitions. [2018-02-04 01:51:50,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-02-04 01:51:50,247 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:50,247 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 01:51:50,247 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 01:51:50,247 INFO L82 PathProgramCache]: Analyzing trace with hash 964634335, now seen corresponding path program 20 times [2018-02-04 01:51:50,247 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51:50,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:51,580 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 01:51:51,581 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:51:51,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-04 01:51:51,581 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:51,581 INFO 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 01:51:51,581 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 01:51:51,581 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 01:51:51,581 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-04 01:51:51,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-04 01:51:51,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=462, Invalid=2190, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 01:51:51,582 INFO L87 Difference]: Start difference. First operand 324 states and 390 transitions. Second operand 52 states. [2018-02-04 01:51:54,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:54,199 INFO L93 Difference]: Finished difference Result 517 states and 586 transitions. [2018-02-04 01:51:54,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-02-04 01:51:54,199 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 305 [2018-02-04 01:51:54,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:54,201 INFO L225 Difference]: With dead ends: 517 [2018-02-04 01:51:54,201 INFO L226 Difference]: Without dead ends: 517 [2018-02-04 01:51:54,202 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5379 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3004, Invalid=14552, Unknown=0, NotChecked=0, Total=17556 [2018-02-04 01:51:54,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-02-04 01:51:54,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 325. [2018-02-04 01:51:54,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-02-04 01:51:54,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 392 transitions. [2018-02-04 01:51:54,205 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 392 transitions. Word has length 305 [2018-02-04 01:51:54,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:54,205 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 392 transitions. [2018-02-04 01:51:54,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-04 01:51:54,205 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 392 transitions. [2018-02-04 01:51:54,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-02-04 01:51:54,206 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:54,206 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 01:51:54,206 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 01:51:54,206 INFO L82 PathProgramCache]: Analyzing trace with hash -644741944, now seen corresponding path program 39 times [2018-02-04 01:51:54,206 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51:54,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:55,266 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 01:51:55,266 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:51:55,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-04 01:51:55,267 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:55,267 INFO 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 01:51:55,267 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 01:51:55,267 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 01:51:55,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 01:51:55,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 01:51:55,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 01:51:55,268 INFO L87 Difference]: Start difference. First operand 325 states and 392 transitions. Second operand 48 states. [2018-02-04 01:51:56,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:51:56,832 INFO L93 Difference]: Finished difference Result 668 states and 796 transitions. [2018-02-04 01:51:56,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 01:51:56,832 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 310 [2018-02-04 01:51:56,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:51:56,833 INFO L225 Difference]: With dead ends: 668 [2018-02-04 01:51:56,833 INFO L226 Difference]: Without dead ends: 330 [2018-02-04 01:51:56,834 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 01:51:56,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-02-04 01:51:56,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 329. [2018-02-04 01:51:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-02-04 01:51:56,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 396 transitions. [2018-02-04 01:51:56,836 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 396 transitions. Word has length 310 [2018-02-04 01:51:56,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:51:56,836 INFO L432 AbstractCegarLoop]: Abstraction has 329 states and 396 transitions. [2018-02-04 01:51:56,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 01:51:56,836 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 396 transitions. [2018-02-04 01:51:56,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-02-04 01:51:56,837 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:51:56,837 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 01:51:56,837 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 01:51:56,837 INFO L82 PathProgramCache]: Analyzing trace with hash -131776283, now seen corresponding path program 40 times [2018-02-04 01:51:56,838 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:51:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:51:56,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:51:58,170 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 01:51:58,171 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:51:58,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-02-04 01:51:58,171 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:51:58,171 INFO 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 01:51:58,171 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 01:51:58,171 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 01:51:58,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 01:51:58,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 01:51:58,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=2233, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 01:51:58,172 INFO L87 Difference]: Start difference. First operand 329 states and 396 transitions. Second operand 53 states. [2018-02-04 01:52:00,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:52:00,155 INFO L93 Difference]: Finished difference Result 527 states and 597 transitions. [2018-02-04 01:52:00,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-02-04 01:52:00,155 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 314 [2018-02-04 01:52:00,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:52:00,156 INFO L225 Difference]: With dead ends: 527 [2018-02-04 01:52:00,156 INFO L226 Difference]: Without dead ends: 527 [2018-02-04 01:52:00,157 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 01:52:00,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-02-04 01:52:00,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 337. [2018-02-04 01:52:00,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-02-04 01:52:00,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 406 transitions. [2018-02-04 01:52:00,161 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 406 transitions. Word has length 314 [2018-02-04 01:52:00,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:52:00,161 INFO L432 AbstractCegarLoop]: Abstraction has 337 states and 406 transitions. [2018-02-04 01:52:00,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 01:52:00,161 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 406 transitions. [2018-02-04 01:52:00,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-02-04 01:52:00,162 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:52:00,162 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 01:52:00,162 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 01:52:00,162 INFO L82 PathProgramCache]: Analyzing trace with hash -265888217, now seen corresponding path program 21 times [2018-02-04 01:52:00,163 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:52:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:52:00,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:52:01,615 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 01:52:01,615 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:52:01,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-02-04 01:52:01,616 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:52:01,616 INFO 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 01:52:01,616 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 01:52:01,616 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 01:52:01,617 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-04 01:52:01,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-04 01:52:01,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=2442, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 01:52:01,617 INFO L87 Difference]: Start difference. First operand 337 states and 406 transitions. Second operand 54 states. [2018-02-04 01:52:04,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:52:04,913 INFO L93 Difference]: Finished difference Result 529 states and 601 transitions. [2018-02-04 01:52:04,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-02-04 01:52:04,913 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 318 [2018-02-04 01:52:04,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:52:04,914 INFO L225 Difference]: With dead ends: 529 [2018-02-04 01:52:04,914 INFO L226 Difference]: Without dead ends: 529 [2018-02-04 01:52:04,915 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4507 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2125, Invalid=13127, Unknown=0, NotChecked=0, Total=15252 [2018-02-04 01:52:04,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-02-04 01:52:04,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 338. [2018-02-04 01:52:04,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-02-04 01:52:04,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 408 transitions. [2018-02-04 01:52:04,918 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 408 transitions. Word has length 318 [2018-02-04 01:52:04,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:52:04,918 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 408 transitions. [2018-02-04 01:52:04,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-04 01:52:04,918 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 408 transitions. [2018-02-04 01:52:04,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-02-04 01:52:04,919 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:52:04,919 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 01:52:04,919 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 01:52:04,919 INFO L82 PathProgramCache]: Analyzing trace with hash -184444288, now seen corresponding path program 41 times [2018-02-04 01:52:04,919 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:52:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:52:04,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:52:06,034 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 01:52:06,034 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:52:06,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-02-04 01:52:06,034 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:52:06,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 01:52:06,035 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 01:52:06,035 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 01:52:06,035 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 01:52:06,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 01:52:06,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 01:52:06,035 INFO L87 Difference]: Start difference. First operand 338 states and 408 transitions. Second operand 50 states. [2018-02-04 01:52:07,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:52:07,743 INFO L93 Difference]: Finished difference Result 697 states and 831 transitions. [2018-02-04 01:52:07,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 01:52:07,744 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 323 [2018-02-04 01:52:07,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:52:07,745 INFO L225 Difference]: With dead ends: 697 [2018-02-04 01:52:07,745 INFO L226 Difference]: Without dead ends: 343 [2018-02-04 01:52:07,745 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 01:52:07,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-02-04 01:52:07,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 342. [2018-02-04 01:52:07,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-02-04 01:52:07,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 412 transitions. [2018-02-04 01:52:07,747 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 412 transitions. Word has length 323 [2018-02-04 01:52:07,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:52:07,747 INFO L432 AbstractCegarLoop]: Abstraction has 342 states and 412 transitions. [2018-02-04 01:52:07,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 01:52:07,747 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 412 transitions. [2018-02-04 01:52:07,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-02-04 01:52:07,748 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:52:07,748 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 01:52:07,748 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 01:52:07,749 INFO L82 PathProgramCache]: Analyzing trace with hash -290474621, now seen corresponding path program 42 times [2018-02-04 01:52:07,749 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:52:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:52:07,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:52:09,261 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 01:52:09,261 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:52:09,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-02-04 01:52:09,261 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:52:09,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:52:09,261 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 01:52:09,262 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 01:52:09,262 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-04 01:52:09,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-04 01:52:09,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=2527, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 01:52:09,262 INFO L87 Difference]: Start difference. First operand 342 states and 412 transitions. Second operand 55 states. [2018-02-04 01:52:11,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:52:11,987 INFO L93 Difference]: Finished difference Result 535 states and 608 transitions. [2018-02-04 01:52:11,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-02-04 01:52:11,988 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 327 [2018-02-04 01:52:11,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:52:11,989 INFO L225 Difference]: With dead ends: 535 [2018-02-04 01:52:11,989 INFO L226 Difference]: Without dead ends: 535 [2018-02-04 01:52:11,990 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 01:52:11,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-02-04 01:52:11,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 350. [2018-02-04 01:52:11,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-02-04 01:52:11,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 422 transitions. [2018-02-04 01:52:11,992 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 422 transitions. Word has length 327 [2018-02-04 01:52:11,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:52:11,992 INFO L432 AbstractCegarLoop]: Abstraction has 350 states and 422 transitions. [2018-02-04 01:52:11,992 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-04 01:52:11,993 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 422 transitions. [2018-02-04 01:52:11,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-02-04 01:52:11,993 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:52:11,994 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 01:52:11,994 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 01:52:11,994 INFO L82 PathProgramCache]: Analyzing trace with hash -49687611, now seen corresponding path program 22 times [2018-02-04 01:52:11,994 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:52:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:52:12,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:52:13,567 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 01:52:13,567 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:52:13,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-02-04 01:52:13,567 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:52:13,567 INFO 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 01:52:13,568 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 01:52:13,568 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 01:52:13,568 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 01:52:13,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 01:52:13,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=2635, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 01:52:13,568 INFO L87 Difference]: Start difference. First operand 350 states and 422 transitions. Second operand 56 states. [2018-02-04 01:52:16,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:52:16,652 INFO L93 Difference]: Finished difference Result 549 states and 624 transitions. [2018-02-04 01:52:16,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-02-04 01:52:16,652 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 331 [2018-02-04 01:52:16,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:52:16,654 INFO L225 Difference]: With dead ends: 549 [2018-02-04 01:52:16,654 INFO L226 Difference]: Without dead ends: 549 [2018-02-04 01:52:16,655 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4730 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2155, Invalid=13847, Unknown=0, NotChecked=0, Total=16002 [2018-02-04 01:52:16,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-02-04 01:52:16,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 351. [2018-02-04 01:52:16,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-02-04 01:52:16,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 424 transitions. [2018-02-04 01:52:16,658 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 424 transitions. Word has length 331 [2018-02-04 01:52:16,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:52:16,658 INFO L432 AbstractCegarLoop]: Abstraction has 351 states and 424 transitions. [2018-02-04 01:52:16,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 01:52:16,658 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 424 transitions. [2018-02-04 01:52:16,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-02-04 01:52:16,659 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:52:16,659 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 01:52:16,659 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 01:52:16,659 INFO L82 PathProgramCache]: Analyzing trace with hash -968001630, now seen corresponding path program 43 times [2018-02-04 01:52:16,660 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:52:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:52:16,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:52:17,854 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 01:52:17,854 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:52:17,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-02-04 01:52:17,854 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:52:17,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:52:17,855 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 01:52:17,855 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 01:52:17,855 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-04 01:52:17,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-04 01:52:17,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 01:52:17,855 INFO L87 Difference]: Start difference. First operand 351 states and 424 transitions. Second operand 52 states. [2018-02-04 01:52:19,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:52:19,709 INFO L93 Difference]: Finished difference Result 726 states and 866 transitions. [2018-02-04 01:52:19,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 01:52:19,709 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 336 [2018-02-04 01:52:19,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:52:19,710 INFO L225 Difference]: With dead ends: 726 [2018-02-04 01:52:19,710 INFO L226 Difference]: Without dead ends: 356 [2018-02-04 01:52:19,710 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=197, Invalid=5503, Unknown=0, NotChecked=0, Total=5700 [2018-02-04 01:52:19,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-02-04 01:52:19,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 355. [2018-02-04 01:52:19,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-02-04 01:52:19,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 428 transitions. [2018-02-04 01:52:19,712 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 428 transitions. Word has length 336 [2018-02-04 01:52:19,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:52:19,713 INFO L432 AbstractCegarLoop]: Abstraction has 355 states and 428 transitions. [2018-02-04 01:52:19,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-04 01:52:19,713 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 428 transitions. [2018-02-04 01:52:19,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-02-04 01:52:19,714 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:52:19,714 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 01:52:19,714 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 01:52:19,714 INFO L82 PathProgramCache]: Analyzing trace with hash -2126734977, now seen corresponding path program 44 times [2018-02-04 01:52:19,714 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:52:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:52:19,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:52:21,378 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 01:52:21,379 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:52:21,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-02-04 01:52:21,379 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:52:21,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:52:21,379 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 01:52:21,379 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 01:52:21,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-04 01:52:21,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-04 01:52:21,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=617, Invalid=2575, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 01:52:21,380 INFO L87 Difference]: Start difference. First operand 355 states and 428 transitions. Second operand 57 states. [2018-02-04 01:52:23,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:52:23,617 INFO L93 Difference]: Finished difference Result 571 states and 647 transitions. [2018-02-04 01:52:23,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-02-04 01:52:23,617 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 340 [2018-02-04 01:52:23,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:52:23,619 INFO L225 Difference]: With dead ends: 571 [2018-02-04 01:52:23,619 INFO L226 Difference]: Without dead ends: 571 [2018-02-04 01:52:23,620 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 01:52:23,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-02-04 01:52:23,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 363. [2018-02-04 01:52:23,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-02-04 01:52:23,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 438 transitions. [2018-02-04 01:52:23,623 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 438 transitions. Word has length 340 [2018-02-04 01:52:23,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:52:23,623 INFO L432 AbstractCegarLoop]: Abstraction has 363 states and 438 transitions. [2018-02-04 01:52:23,623 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-04 01:52:23,624 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 438 transitions. [2018-02-04 01:52:23,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-02-04 01:52:23,624 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:52:23,625 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 01:52:23,625 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 01:52:23,625 INFO L82 PathProgramCache]: Analyzing trace with hash -162768447, now seen corresponding path program 23 times [2018-02-04 01:52:23,625 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:52:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:52:23,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:52:25,279 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 01:52:25,279 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:52:25,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-02-04 01:52:25,279 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:52:25,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 01:52:25,280 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 01:52:25,280 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 01:52:25,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 01:52:25,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 01:52:25,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=2687, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 01:52:25,280 INFO L87 Difference]: Start difference. First operand 363 states and 438 transitions. Second operand 58 states. [2018-02-04 01:52:28,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:52:28,264 INFO L93 Difference]: Finished difference Result 585 states and 663 transitions. [2018-02-04 01:52:28,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-02-04 01:52:28,264 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 344 [2018-02-04 01:52:28,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:52:28,265 INFO L225 Difference]: With dead ends: 585 [2018-02-04 01:52:28,265 INFO L226 Difference]: Without dead ends: 585 [2018-02-04 01:52:28,267 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 01:52:28,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-02-04 01:52:28,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 364. [2018-02-04 01:52:28,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-02-04 01:52:28,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 440 transitions. [2018-02-04 01:52:28,270 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 440 transitions. Word has length 344 [2018-02-04 01:52:28,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:52:28,270 INFO L432 AbstractCegarLoop]: Abstraction has 364 states and 440 transitions. [2018-02-04 01:52:28,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 01:52:28,270 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 440 transitions. [2018-02-04 01:52:28,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-02-04 01:52:28,271 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:52:28,271 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 01:52:28,271 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 01:52:28,271 INFO L82 PathProgramCache]: Analyzing trace with hash -388280538, now seen corresponding path program 45 times [2018-02-04 01:52:28,272 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:52:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:52:28,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:52:29,534 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 01:52:29,534 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:52:29,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-02-04 01:52:29,535 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:52:29,535 INFO 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 01:52:29,535 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 01:52:29,535 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 01:52:29,535 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-04 01:52:29,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-04 01:52:29,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 01:52:29,536 INFO L87 Difference]: Start difference. First operand 364 states and 440 transitions. Second operand 54 states. [2018-02-04 01:52:31,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:52:31,487 INFO L93 Difference]: Finished difference Result 755 states and 901 transitions. [2018-02-04 01:52:31,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 01:52:31,487 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 349 [2018-02-04 01:52:31,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:52:31,488 INFO L225 Difference]: With dead ends: 755 [2018-02-04 01:52:31,488 INFO L226 Difference]: Without dead ends: 369 [2018-02-04 01:52:31,488 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 01:52:31,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-02-04 01:52:31,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 368. [2018-02-04 01:52:31,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-02-04 01:52:31,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 444 transitions. [2018-02-04 01:52:31,491 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 444 transitions. Word has length 349 [2018-02-04 01:52:31,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:52:31,491 INFO L432 AbstractCegarLoop]: Abstraction has 368 states and 444 transitions. [2018-02-04 01:52:31,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-04 01:52:31,491 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 444 transitions. [2018-02-04 01:52:31,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-02-04 01:52:31,492 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:52:31,492 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 01:52:31,492 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 01:52:31,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1036049513, now seen corresponding path program 46 times [2018-02-04 01:52:31,492 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:52:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:52:31,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:52:33,222 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 01:52:33,222 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:52:33,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-02-04 01:52:33,222 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:52:33,223 INFO 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 01:52:33,223 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 01:52:33,223 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 01:52:33,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 01:52:33,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 01:52:33,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=644, Invalid=2778, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 01:52:33,224 INFO L87 Difference]: Start difference. First operand 368 states and 444 transitions. Second operand 59 states. [2018-02-04 01:52:35,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:52:35,898 INFO L93 Difference]: Finished difference Result 591 states and 670 transitions. [2018-02-04 01:52:35,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-02-04 01:52:35,898 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 353 [2018-02-04 01:52:35,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:52:35,899 INFO L225 Difference]: With dead ends: 591 [2018-02-04 01:52:35,899 INFO L226 Difference]: Without dead ends: 591 [2018-02-04 01:52:35,901 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 01:52:35,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2018-02-04 01:52:35,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 376. [2018-02-04 01:52:35,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-02-04 01:52:35,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 454 transitions. [2018-02-04 01:52:35,904 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 454 transitions. Word has length 353 [2018-02-04 01:52:35,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:52:35,904 INFO L432 AbstractCegarLoop]: Abstraction has 376 states and 454 transitions. [2018-02-04 01:52:35,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 01:52:35,904 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 454 transitions. [2018-02-04 01:52:35,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-02-04 01:52:35,905 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:52:35,905 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 01:52:35,905 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 01:52:35,905 INFO L82 PathProgramCache]: Analyzing trace with hash 2143360939, now seen corresponding path program 24 times [2018-02-04 01:52:35,906 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:52:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:52:35,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:52:37,750 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 01:52:37,751 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:52:37,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-02-04 01:52:37,751 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:52:37,751 INFO 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 01:52:37,751 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 01:52:37,751 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 01:52:37,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-04 01:52:37,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-04 01:52:37,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=646, Invalid=2894, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 01:52:37,752 INFO L87 Difference]: Start difference. First operand 376 states and 454 transitions. Second operand 60 states. [2018-02-04 01:52:41,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:52:41,098 INFO L93 Difference]: Finished difference Result 605 states and 686 transitions. [2018-02-04 01:52:41,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-02-04 01:52:41,099 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 357 [2018-02-04 01:52:41,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:52:41,100 INFO L225 Difference]: With dead ends: 605 [2018-02-04 01:52:41,100 INFO L226 Difference]: Without dead ends: 605 [2018-02-04 01:52:41,102 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 01:52:41,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-02-04 01:52:41,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 377. [2018-02-04 01:52:41,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-02-04 01:52:41,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 456 transitions. [2018-02-04 01:52:41,107 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 456 transitions. Word has length 357 [2018-02-04 01:52:41,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:52:41,107 INFO L432 AbstractCegarLoop]: Abstraction has 377 states and 456 transitions. [2018-02-04 01:52:41,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-04 01:52:41,107 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 456 transitions. [2018-02-04 01:52:41,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-02-04 01:52:41,109 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:52:41,109 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 01:52:41,109 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 01:52:41,109 INFO L82 PathProgramCache]: Analyzing trace with hash 992129916, now seen corresponding path program 47 times [2018-02-04 01:52:41,110 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:52:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:52:41,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:52:42,578 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 01:52:42,578 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:52:42,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-02-04 01:52:42,578 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:52:42,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:52:42,579 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 01:52:42,579 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 01:52:42,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 01:52:42,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 01:52:42,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 01:52:42,579 INFO L87 Difference]: Start difference. First operand 377 states and 456 transitions. Second operand 56 states. [2018-02-04 01:52:44,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:52:44,762 INFO L93 Difference]: Finished difference Result 784 states and 936 transitions. [2018-02-04 01:52:44,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 01:52:44,762 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 362 [2018-02-04 01:52:44,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:52:44,763 INFO L225 Difference]: With dead ends: 784 [2018-02-04 01:52:44,763 INFO L226 Difference]: Without dead ends: 382 [2018-02-04 01:52:44,764 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 01:52:44,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-02-04 01:52:44,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2018-02-04 01:52:44,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-02-04 01:52:44,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 460 transitions. [2018-02-04 01:52:44,766 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 460 transitions. Word has length 362 [2018-02-04 01:52:44,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:52:44,766 INFO L432 AbstractCegarLoop]: Abstraction has 381 states and 460 transitions. [2018-02-04 01:52:44,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 01:52:44,766 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 460 transitions. [2018-02-04 01:52:44,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-02-04 01:52:44,767 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:52:44,767 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 01:52:44,767 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 01:52:44,767 INFO L82 PathProgramCache]: Analyzing trace with hash 125176601, now seen corresponding path program 48 times [2018-02-04 01:52:44,768 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:52:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:52:44,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:52:46,669 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 01:52:46,669 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:52:46,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-02-04 01:52:46,669 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:52:46,669 INFO 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 01:52:46,669 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 01:52:46,670 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 01:52:46,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-04 01:52:46,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-04 01:52:46,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=719, Invalid=2941, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 01:52:46,670 INFO L87 Difference]: Start difference. First operand 381 states and 460 transitions. Second operand 61 states. [2018-02-04 01:52:49,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:52:49,232 INFO L93 Difference]: Finished difference Result 615 states and 697 transitions. [2018-02-04 01:52:49,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-02-04 01:52:49,232 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 366 [2018-02-04 01:52:49,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:52:49,233 INFO L225 Difference]: With dead ends: 615 [2018-02-04 01:52:49,233 INFO L226 Difference]: Without dead ends: 615 [2018-02-04 01:52:49,234 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 01:52:49,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-02-04 01:52:49,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 389. [2018-02-04 01:52:49,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-02-04 01:52:49,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 470 transitions. [2018-02-04 01:52:49,237 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 470 transitions. Word has length 366 [2018-02-04 01:52:49,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:52:49,237 INFO L432 AbstractCegarLoop]: Abstraction has 389 states and 470 transitions. [2018-02-04 01:52:49,237 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-04 01:52:49,237 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 470 transitions. [2018-02-04 01:52:49,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-02-04 01:52:49,238 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:52:49,238 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 01:52:49,238 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 01:52:49,239 INFO L82 PathProgramCache]: Analyzing trace with hash -119574949, now seen corresponding path program 25 times [2018-02-04 01:52:49,239 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:52:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:52:49,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:52:51,210 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 01:52:51,211 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:52:51,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-02-04 01:52:51,211 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:52:51,211 INFO 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 01:52:51,211 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 01:52:51,211 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 01:52:51,212 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-04 01:52:51,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-04 01:52:51,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=674, Invalid=3108, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 01:52:51,212 INFO L87 Difference]: Start difference. First operand 389 states and 470 transitions. Second operand 62 states. [2018-02-04 01:52:54,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:52:54,851 INFO L93 Difference]: Finished difference Result 625 states and 709 transitions. [2018-02-04 01:52:54,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-02-04 01:52:54,851 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 370 [2018-02-04 01:52:54,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:52:54,852 INFO L225 Difference]: With dead ends: 625 [2018-02-04 01:52:54,852 INFO L226 Difference]: Without dead ends: 625 [2018-02-04 01:52:54,854 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 01:52:54,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-02-04 01:52:54,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 390. [2018-02-04 01:52:54,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-02-04 01:52:54,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 472 transitions. [2018-02-04 01:52:54,858 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 472 transitions. Word has length 370 [2018-02-04 01:52:54,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:52:54,858 INFO L432 AbstractCegarLoop]: Abstraction has 390 states and 472 transitions. [2018-02-04 01:52:54,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-04 01:52:54,859 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 472 transitions. [2018-02-04 01:52:54,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-02-04 01:52:54,860 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:52:54,860 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 01:52:54,860 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 01:52:54,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1310782772, now seen corresponding path program 49 times [2018-02-04 01:52:54,861 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:52:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:52:54,895 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:52:56,321 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 01:52:56,322 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:52:56,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-02-04 01:52:56,322 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:52:56,322 INFO 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 01:52:56,322 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 01:52:56,323 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 01:52:56,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 01:52:56,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 01:52:56,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 01:52:56,323 INFO L87 Difference]: Start difference. First operand 390 states and 472 transitions. Second operand 58 states. [2018-02-04 01:52:58,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:52:58,656 INFO L93 Difference]: Finished difference Result 813 states and 971 transitions. [2018-02-04 01:52:58,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 01:52:58,656 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 375 [2018-02-04 01:52:58,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:52:58,657 INFO L225 Difference]: With dead ends: 813 [2018-02-04 01:52:58,657 INFO L226 Difference]: Without dead ends: 395 [2018-02-04 01:52:58,658 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 01:52:58,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-02-04 01:52:58,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 394. [2018-02-04 01:52:58,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-02-04 01:52:58,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 476 transitions. [2018-02-04 01:52:58,659 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 476 transitions. Word has length 375 [2018-02-04 01:52:58,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:52:58,660 INFO L432 AbstractCegarLoop]: Abstraction has 394 states and 476 transitions. [2018-02-04 01:52:58,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 01:52:58,660 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 476 transitions. [2018-02-04 01:52:58,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-02-04 01:52:58,660 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:52:58,661 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 01:52:58,661 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 01:52:58,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1460290993, now seen corresponding path program 50 times [2018-02-04 01:52:58,661 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:52:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:52:58,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:00,667 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 01:53:00,667 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:00,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-02-04 01:53:00,667 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:00,668 INFO 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 01:53:00,668 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 01:53:00,668 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 01:53:00,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-04 01:53:00,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-04 01:53:00,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=3205, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 01:53:00,669 INFO L87 Difference]: Start difference. First operand 394 states and 476 transitions. Second operand 63 states. [2018-02-04 01:53:04,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:04,095 INFO L93 Difference]: Finished difference Result 631 states and 716 transitions. [2018-02-04 01:53:04,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-02-04 01:53:04,095 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 379 [2018-02-04 01:53:04,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:04,096 INFO L225 Difference]: With dead ends: 631 [2018-02-04 01:53:04,096 INFO L226 Difference]: Without dead ends: 631 [2018-02-04 01:53:04,098 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 01:53:04,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2018-02-04 01:53:04,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 402. [2018-02-04 01:53:04,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-02-04 01:53:04,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 486 transitions. [2018-02-04 01:53:04,100 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 486 transitions. Word has length 379 [2018-02-04 01:53:04,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:04,100 INFO L432 AbstractCegarLoop]: Abstraction has 402 states and 486 transitions. [2018-02-04 01:53:04,100 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-04 01:53:04,100 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 486 transitions. [2018-02-04 01:53:04,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-02-04 01:53:04,101 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:04,101 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 01:53:04,101 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 01:53:04,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1743295121, now seen corresponding path program 26 times [2018-02-04 01:53:04,102 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:04,132 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 01:53:05,277 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 01:53:05,281 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 01:53:05,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:53:05 BoogieIcfgContainer [2018-02-04 01:53:05,281 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 01:53:05,281 INFO L168 Benchmark]: Toolchain (without parser) took 175975.89 ms. Allocated memory was 393.2 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 350.1 MB in the beginning and 746.5 MB in the end (delta: -396.4 MB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. [2018-02-04 01:53:05,282 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 393.2 MB. Free memory is still 355.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:53:05,282 INFO L168 Benchmark]: CACSL2BoogieTranslator took 175.08 ms. Allocated memory is still 393.2 MB. Free memory was 350.1 MB in the beginning and 339.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 01:53:05,283 INFO L168 Benchmark]: Boogie Preprocessor took 30.00 ms. Allocated memory is still 393.2 MB. Free memory was 339.5 MB in the beginning and 336.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 01:53:05,283 INFO L168 Benchmark]: RCFGBuilder took 267.32 ms. Allocated memory is still 393.2 MB. Free memory was 336.9 MB in the beginning and 309.6 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 5.3 GB. [2018-02-04 01:53:05,283 INFO L168 Benchmark]: TraceAbstraction took 175500.42 ms. Allocated memory was 393.2 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 309.6 MB in the beginning and 746.5 MB in the end (delta: -436.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. [2018-02-04 01:53:05,284 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.14 ms. Allocated memory is still 393.2 MB. Free memory is still 355.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 175.08 ms. Allocated memory is still 393.2 MB. Free memory was 350.1 MB in the beginning and 339.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.00 ms. Allocated memory is still 393.2 MB. Free memory was 339.5 MB in the beginning and 336.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 267.32 ms. Allocated memory is still 393.2 MB. Free memory was 336.9 MB in the beginning and 309.6 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 175500.42 ms. Allocated memory was 393.2 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 309.6 MB in the beginning and 746.5 MB in the end (delta: -436.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 384 with TraceHistMax 27, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 384 with TraceHistMax 27, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 384 with TraceHistMax 27, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 589). Cancelled while BasicCegarLoop was analyzing trace of length 384 with TraceHistMax 27, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 384 with TraceHistMax 27, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 589). Cancelled while BasicCegarLoop was analyzing trace of length 384 with TraceHistMax 27, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 384 with TraceHistMax 27, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 384 with TraceHistMax 27, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 384 with TraceHistMax 27, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 384 with TraceHistMax 27, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 384 with TraceHistMax 27, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 384 with TraceHistMax 27, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 384 with TraceHistMax 27, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 384 with TraceHistMax 27, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 384 with TraceHistMax 27, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 384 with TraceHistMax 27, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 384 with TraceHistMax 27, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 384 with TraceHistMax 27, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 384 with TraceHistMax 27, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 384 with TraceHistMax 27, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 384 with TraceHistMax 27, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 90 locations, 21 error locations. TIMEOUT Result, 175.4s OverallTime, 108 OverallIterations, 27 TraceHistogramMax, 108.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14549 SDtfs, 46691 SDslu, 386404 SDs, 0 SdLazy, 155119 SolverSat, 4809 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 44.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6126 GetRequests, 316 SyntacticMatches, 10 SemanticMatches, 5800 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128424 ImplicationChecksByTransitivity, 87.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=402occurred in iteration=107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 25211/116101 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 107 MinimizatonAttempts, 6593 StatesRemovedByMinimization, 93 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 59.8s InterpolantComputationTime, 17536 NumberOfCodeBlocks, 17536 NumberOfCodeBlocksAsserted, 107 NumberOfCheckSat, 17429 ConstructedInterpolants, 0 QuantifiedInterpolants, 31822915 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 107 InterpolantComputations, 18 PerfectInterpolantSequences, 25211/116101 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_01-53-05-288.csv 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-TraceAbstractionBenchmarks-0-2018-02-04_01-53-05-288.csv Completed graceful shutdown