java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:49:45,493 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:49:45,494 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:49:45,504 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:49:45,504 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:49:45,505 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:49:45,506 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:49:45,507 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:49:45,508 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:49:45,509 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:49:45,509 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:49:45,510 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:49:45,510 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:49:45,512 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:49:45,512 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:49:45,514 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:49:45,516 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:49:45,517 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:49:45,518 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:49:45,521 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:49:45,523 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:49:45,523 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:49:45,523 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:49:45,524 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:49:45,525 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:49:45,526 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:49:45,526 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:49:45,526 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:49:45,527 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:49:45,527 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:49:45,527 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:49:45,527 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 09:49:45,537 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:49:45,537 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:49:45,538 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:49:45,538 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:49:45,539 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:49:45,539 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:49:45,539 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:49:45,539 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:49:45,539 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:49:45,539 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:49:45,539 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:49:45,540 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:49:45,540 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:49:45,540 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:49:45,540 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:49:45,540 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:49:45,540 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:49:45,540 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:49:45,541 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:49:45,541 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:49:45,541 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:49:45,541 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:49:45,541 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 09:49:45,569 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:49:45,579 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:49:45,582 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:49:45,584 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:49:45,585 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:49:45,585 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-02-02 09:49:45,705 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:49:45,706 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:49:45,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:49:45,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:49:45,711 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:49:45,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:49:45" (1/1) ... [2018-02-02 09:49:45,713 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1801275f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:49:45, skipping insertion in model container [2018-02-02 09:49:45,713 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:49:45" (1/1) ... [2018-02-02 09:49:45,726 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:49:45,758 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:49:45,843 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:49:45,861 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:49:45,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:49:45 WrapperNode [2018-02-02 09:49:45,867 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:49:45,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:49:45,868 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:49:45,868 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:49:45,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:49:45" (1/1) ... [2018-02-02 09:49:45,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:49:45" (1/1) ... [2018-02-02 09:49:45,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:49:45" (1/1) ... [2018-02-02 09:49:45,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:49:45" (1/1) ... [2018-02-02 09:49:45,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:49:45" (1/1) ... [2018-02-02 09:49:45,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:49:45" (1/1) ... [2018-02-02 09:49:45,889 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:49:45" (1/1) ... [2018-02-02 09:49:45,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:49:45,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:49:45,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:49:45,890 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:49:45,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:49:45" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:49:45,928 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:49:45,928 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:49:45,928 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlcpy [2018-02-02 09:49:45,928 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:49:45,928 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 09:49:45,929 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 09:49:45,929 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:49:45,929 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:49:45,929 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:49:45,929 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 09:49:45,929 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlcpy [2018-02-02 09:49:45,929 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:49:45,929 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:49:45,929 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:49:46,072 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:49:46,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:49:46 BoogieIcfgContainer [2018-02-02 09:49:46,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:49:46,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:49:46,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:49:46,075 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:49:46,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:49:45" (1/3) ... [2018-02-02 09:49:46,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d19c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:49:46, skipping insertion in model container [2018-02-02 09:49:46,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:49:45" (2/3) ... [2018-02-02 09:49:46,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d19c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:49:46, skipping insertion in model container [2018-02-02 09:49:46,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:49:46" (3/3) ... [2018-02-02 09:49:46,078 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-02-02 09:49:46,084 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:49:46,089 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-02 09:49:46,121 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:49:46,121 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:49:46,121 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 09:49:46,121 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 09:49:46,121 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:49:46,122 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:49:46,122 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:49:46,122 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:49:46,123 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:49:46,135 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-02-02 09:49:46,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 09:49:46,143 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:46,144 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:46,144 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:46,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1536619982, now seen corresponding path program 1 times [2018-02-02 09:49:46,197 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:46,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:46,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:46,352 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:49:46,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:49:46,353 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:46,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:46,354 INFO L182 omatonBuilderFactory]: Interpolants [58#true, 59#false, 60#(= 1 (select |#valid| |main_#t~malloc10.base|)), 61#(= 1 (select |#valid| main_~nondetString1~0.base))] [2018-02-02 09:49:46,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:46,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:49:46,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:49:46,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:49:46,367 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 4 states. [2018-02-02 09:49:46,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:46,490 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-02-02 09:49:46,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:49:46,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 09:49:46,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:46,501 INFO L225 Difference]: With dead ends: 54 [2018-02-02 09:49:46,501 INFO L226 Difference]: Without dead ends: 51 [2018-02-02 09:49:46,503 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-02 09:49:46,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-02 09:49:46,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-02 09:49:46,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 09:49:46,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-02-02 09:49:46,535 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 13 [2018-02-02 09:49:46,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:46,535 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-02-02 09:49:46,535 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:49:46,535 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-02-02 09:49:46,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 09:49:46,536 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:46,536 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:46,536 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:46,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1536619983, now seen corresponding path program 1 times [2018-02-02 09:49:46,537 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:46,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:46,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:46,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:46,625 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:49:46,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:49:46,625 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:46,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:46,626 INFO L182 omatonBuilderFactory]: Interpolants [169#true, 170#false, 171#(<= 1 main_~n~1), 172#(and (= main_~n~1 (select |#length| |main_#t~malloc10.base|)) (= 0 |main_#t~malloc10.offset|) (<= 1 main_~n~1) (= (select |#valid| |main_#t~malloc10.base|) 1)), 173#(and (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~n~1 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~n~1) (= main_~nondetString1~0.offset 0)), 174#(and (= main_~n~1 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~n~1) (= main_~nondetString1~0.offset 0))] [2018-02-02 09:49:46,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:46,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:49:46,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:49:46,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:49:46,627 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2018-02-02 09:49:46,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:46,675 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-02-02 09:49:46,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:49:46,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-02 09:49:46,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:46,680 INFO L225 Difference]: With dead ends: 50 [2018-02-02 09:49:46,680 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 09:49:46,680 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-02 09:49:46,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 09:49:46,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-02 09:49:46,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 09:49:46,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-02-02 09:49:46,685 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 13 [2018-02-02 09:49:46,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:46,685 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-02-02 09:49:46,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:49:46,686 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-02-02 09:49:46,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 09:49:46,686 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:46,686 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:46,686 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:46,686 INFO L82 PathProgramCache]: Analyzing trace with hash 390579246, now seen corresponding path program 1 times [2018-02-02 09:49:46,687 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:46,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:46,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:46,742 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:49:46,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:49:46,742 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:46,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:46,742 INFO L182 omatonBuilderFactory]: Interpolants [277#true, 278#false, 279#(= 1 (select |#valid| |main_#t~malloc11.base|)), 280#(= 1 (select |#valid| main_~nondetString2~0.base))] [2018-02-02 09:49:46,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:46,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:49:46,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:49:46,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:49:46,744 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 4 states. [2018-02-02 09:49:46,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:46,785 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-02-02 09:49:46,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:49:46,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 09:49:46,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:46,786 INFO L225 Difference]: With dead ends: 49 [2018-02-02 09:49:46,786 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 09:49:46,787 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:49:46,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 09:49:46,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-02 09:49:46,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 09:49:46,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-02-02 09:49:46,791 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 14 [2018-02-02 09:49:46,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:46,791 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-02-02 09:49:46,791 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:49:46,791 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-02-02 09:49:46,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 09:49:46,792 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:46,792 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:46,792 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:46,792 INFO L82 PathProgramCache]: Analyzing trace with hash 390579247, now seen corresponding path program 1 times [2018-02-02 09:49:46,793 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:46,803 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:46,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:46,857 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:49:46,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:49:46,857 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:46,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:46,858 INFO L182 omatonBuilderFactory]: Interpolants [384#(and (= main_~length~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|) (<= 1 main_~length~0)), 385#(and (= main_~nondetString2~0.offset 0) (= main_~length~0 (select |#length| main_~nondetString2~0.base)) (<= 1 main_~length~0)), 381#true, 382#false, 383#(<= 1 main_~length~0)] [2018-02-02 09:49:46,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:46,858 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:49:46,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:49:46,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:49:46,858 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 5 states. [2018-02-02 09:49:46,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:46,913 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-02-02 09:49:46,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:49:46,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 09:49:46,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:46,914 INFO L225 Difference]: With dead ends: 48 [2018-02-02 09:49:46,914 INFO L226 Difference]: Without dead ends: 48 [2018-02-02 09:49:46,915 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-02 09:49:46,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-02 09:49:46,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-02 09:49:46,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-02 09:49:46,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-02-02 09:49:46,917 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 14 [2018-02-02 09:49:46,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:46,917 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-02-02 09:49:46,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:49:46,917 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-02-02 09:49:46,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 09:49:46,918 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:46,918 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] [2018-02-02 09:49:46,918 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:46,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1961349366, now seen corresponding path program 1 times [2018-02-02 09:49:46,918 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:46,931 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:46,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:46,956 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:49:46,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:49:46,957 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:46,957 INFO L182 omatonBuilderFactory]: Interpolants [484#true, 485#false, 486#(= 1 (select |#valid| main_~nondetString1~0.base)), 487#(= 1 (select |#valid| |cstrlcpy_#in~dst.base|)), 488#(= 1 (select |#valid| cstrlcpy_~d~0.base))] [2018-02-02 09:49:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:46,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:49:46,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:49:46,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:49:46,957 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 5 states. [2018-02-02 09:49:46,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:46,991 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-02-02 09:49:46,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:49:46,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-02 09:49:46,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:46,992 INFO L225 Difference]: With dead ends: 47 [2018-02-02 09:49:46,992 INFO L226 Difference]: Without dead ends: 47 [2018-02-02 09:49:46,992 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-02 09:49:46,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-02 09:49:46,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-02 09:49:46,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-02 09:49:46,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-02-02 09:49:46,994 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 20 [2018-02-02 09:49:46,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:46,995 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-02-02 09:49:46,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:49:46,995 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-02-02 09:49:46,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 09:49:46,995 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:46,995 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] [2018-02-02 09:49:46,995 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:46,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1961349365, now seen corresponding path program 1 times [2018-02-02 09:49:46,996 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:47,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:47,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:47,075 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:49:47,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:49:47,075 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:47,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:47,075 INFO L182 omatonBuilderFactory]: Interpolants [592#(and (<= 1 (select |#length| cstrlcpy_~d~0.base)) (= cstrlcpy_~d~0.offset 0)), 585#true, 586#false, 587#(<= 1 main_~n~1), 588#(and (= 0 |main_#t~malloc10.offset|) (<= 1 main_~n~1)), 589#(and (<= 1 main_~n~1) (= main_~nondetString1~0.offset 0)), 590#(and (<= (+ main_~nondetString1~0.offset 1) (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 591#(and (<= 1 (select |#length| |cstrlcpy_#in~dst.base|)) (= 0 |cstrlcpy_#in~dst.offset|))] [2018-02-02 09:49:47,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:47,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:49:47,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:49:47,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:49:47,076 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 8 states. [2018-02-02 09:49:47,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:47,151 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-02-02 09:49:47,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:49:47,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-02 09:49:47,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:47,153 INFO L225 Difference]: With dead ends: 62 [2018-02-02 09:49:47,153 INFO L226 Difference]: Without dead ends: 62 [2018-02-02 09:49:47,154 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:49:47,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-02 09:49:47,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2018-02-02 09:49:47,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 09:49:47,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-02-02 09:49:47,158 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 20 [2018-02-02 09:49:47,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:47,158 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-02-02 09:49:47,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:49:47,158 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-02-02 09:49:47,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 09:49:47,159 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:47,159 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] [2018-02-02 09:49:47,159 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:47,159 INFO L82 PathProgramCache]: Analyzing trace with hash -698055293, now seen corresponding path program 1 times [2018-02-02 09:49:47,160 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:47,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:47,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:47,206 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:49:47,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:49:47,206 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:47,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:47,207 INFO L182 omatonBuilderFactory]: Interpolants [720#(= 1 (select |#valid| cstrlcpy_~s~0.base)), 721#(= 1 (select |#valid| |cstrlcpy_#t~post2.base|)), 716#true, 717#false, 718#(= 1 (select |#valid| main_~nondetString2~0.base)), 719#(= 1 (select |#valid| |cstrlcpy_#in~src.base|))] [2018-02-02 09:49:47,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:47,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:49:47,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:49:47,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:49:47,207 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-02-02 09:49:47,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:47,269 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-02-02 09:49:47,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:49:47,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-02-02 09:49:47,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:47,271 INFO L225 Difference]: With dead ends: 52 [2018-02-02 09:49:47,271 INFO L226 Difference]: Without dead ends: 52 [2018-02-02 09:49:47,271 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-02 09:49:47,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-02 09:49:47,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-02 09:49:47,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 09:49:47,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-02-02 09:49:47,275 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 21 [2018-02-02 09:49:47,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:47,275 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-02-02 09:49:47,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:49:47,275 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-02-02 09:49:47,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 09:49:47,275 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:47,275 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] [2018-02-02 09:49:47,276 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:47,276 INFO L82 PathProgramCache]: Analyzing trace with hash -698055292, now seen corresponding path program 1 times [2018-02-02 09:49:47,276 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:47,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:47,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:47,339 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:49:47,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 09:49:47,340 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:47,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:47,340 INFO L182 omatonBuilderFactory]: Interpolants [832#(<= 1 main_~length~0), 833#(and (= main_~length~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|) (<= 1 main_~length~0)), 834#(and (= 0 main_~nondetString2~0.offset) (= main_~length~0 (select |#length| main_~nondetString2~0.base)) (<= 1 main_~length~0)), 835#(and (= 0 main_~nondetString2~0.offset) (<= 1 (select |#length| main_~nondetString2~0.base))), 836#(and (<= 1 (select |#length| |cstrlcpy_#in~src.base|)) (= 0 |cstrlcpy_#in~src.offset|)), 837#(and (<= 1 (select |#length| cstrlcpy_~s~0.base)) (= 0 cstrlcpy_~s~0.offset)), 838#(and (= |cstrlcpy_#t~post2.offset| 0) (<= 1 (select |#length| |cstrlcpy_#t~post2.base|))), 830#true, 831#false] [2018-02-02 09:49:47,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:47,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:49:47,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:49:47,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:49:47,341 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-02-02 09:49:47,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:47,443 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-02-02 09:49:47,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:49:47,443 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-02-02 09:49:47,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:47,444 INFO L225 Difference]: With dead ends: 62 [2018-02-02 09:49:47,444 INFO L226 Difference]: Without dead ends: 62 [2018-02-02 09:49:47,444 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:49:47,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-02 09:49:47,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2018-02-02 09:49:47,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 09:49:47,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-02-02 09:49:47,447 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 21 [2018-02-02 09:49:47,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:47,447 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-02-02 09:49:47,447 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:49:47,447 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-02-02 09:49:47,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 09:49:47,448 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:47,448 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:47,448 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:47,448 INFO L82 PathProgramCache]: Analyzing trace with hash -164877615, now seen corresponding path program 1 times [2018-02-02 09:49:47,449 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:47,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:47,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:47,492 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:49:47,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:49:47,492 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:47,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:47,493 INFO L182 omatonBuilderFactory]: Interpolants [960#true, 961#false, 962#(= 1 (select |#valid| main_~nondetString1~0.base)), 963#(= 1 (select |#valid| |cstrlcpy_#in~dst.base|)), 964#(= 1 (select |#valid| cstrlcpy_~d~0.base)), 965#(= 1 (select |#valid| |cstrlcpy_#t~post1.base|))] [2018-02-02 09:49:47,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:47,493 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:49:47,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:49:47,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:49:47,494 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-02-02 09:49:47,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:47,552 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-02-02 09:49:47,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:49:47,553 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-02 09:49:47,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:47,554 INFO L225 Difference]: With dead ends: 52 [2018-02-02 09:49:47,554 INFO L226 Difference]: Without dead ends: 52 [2018-02-02 09:49:47,554 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-02 09:49:47,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-02 09:49:47,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-02 09:49:47,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 09:49:47,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-02-02 09:49:47,557 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 22 [2018-02-02 09:49:47,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:47,558 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-02-02 09:49:47,558 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:49:47,558 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-02-02 09:49:47,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 09:49:47,558 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:47,562 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:47,562 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:47,562 INFO L82 PathProgramCache]: Analyzing trace with hash -164877614, now seen corresponding path program 1 times [2018-02-02 09:49:47,563 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:47,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:47,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-02 09:49:47,668 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:49:47,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 09:49:47,669 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:47,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-02 09:49:47,669 INFO L182 omatonBuilderFactory]: Interpolants [1074#true, 1075#false, 1076#(<= 1 main_~n~1), 1077#(and (= 0 |main_#t~malloc10.offset|) (<= 1 main_~n~1)), 1078#(and (<= 1 main_~n~1) (= main_~nondetString1~0.offset 0)), 1079#(and (<= (+ main_~nondetString1~0.offset 1) (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 1080#(and (<= 1 (select |#length| |cstrlcpy_#in~dst.base|)) (= 0 |cstrlcpy_#in~dst.offset|)), 1081#(and (<= 1 (select |#length| cstrlcpy_~d~0.base)) (= 0 cstrlcpy_~d~0.offset)), 1082#(and (<= 1 (select |#length| |cstrlcpy_#t~post1.base|)) (= |cstrlcpy_#t~post1.offset| 0))] [2018-02-02 09:49:47,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-02 09:49:47,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:49:47,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:49:47,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:49:47,670 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-02-02 09:49:47,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:47,760 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2018-02-02 09:49:47,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:49:47,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-02 09:49:47,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:47,761 INFO L225 Difference]: With dead ends: 63 [2018-02-02 09:49:47,761 INFO L226 Difference]: Without dead ends: 63 [2018-02-02 09:49:47,761 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:49:47,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-02 09:49:47,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2018-02-02 09:49:47,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 09:49:47,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-02-02 09:49:47,763 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 22 [2018-02-02 09:49:47,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:47,764 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-02-02 09:49:47,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:49:47,764 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-02-02 09:49:47,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 09:49:47,764 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:47,764 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:47,764 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:47,764 INFO L82 PathProgramCache]: Analyzing trace with hash 634059438, now seen corresponding path program 1 times [2018-02-02 09:49:47,765 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:47,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:47,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:47,812 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:49:47,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:49:47,812 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:47,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:47,813 INFO L182 omatonBuilderFactory]: Interpolants [1209#true, 1210#false, 1211#(= 1 (select |#valid| main_~nondetString2~0.base)), 1212#(= 1 (select |#valid| |cstrlcpy_#in~src.base|)), 1213#(= 1 (select |#valid| cstrlcpy_~s~0.base)), 1214#(= 1 (select |#valid| |cstrlcpy_#t~post6.base|))] [2018-02-02 09:49:47,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:47,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:49:47,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:49:47,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:49:47,813 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-02-02 09:49:47,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:47,853 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-02-02 09:49:47,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:49:47,853 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-02 09:49:47,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:47,854 INFO L225 Difference]: With dead ends: 52 [2018-02-02 09:49:47,854 INFO L226 Difference]: Without dead ends: 52 [2018-02-02 09:49:47,854 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-02 09:49:47,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-02 09:49:47,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-02 09:49:47,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 09:49:47,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-02-02 09:49:47,857 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 22 [2018-02-02 09:49:47,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:47,857 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-02-02 09:49:47,857 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:49:47,857 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-02-02 09:49:47,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 09:49:47,858 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:47,858 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:47,858 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:47,858 INFO L82 PathProgramCache]: Analyzing trace with hash 634059439, now seen corresponding path program 1 times [2018-02-02 09:49:47,859 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:47,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:47,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:47,949 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:49:47,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 09:49:47,950 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:47,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:47,950 INFO L182 omatonBuilderFactory]: Interpolants [1328#(and (= 0 main_~nondetString2~0.offset) (<= 1 (select |#length| main_~nondetString2~0.base))), 1329#(and (<= 1 (select |#length| |cstrlcpy_#in~src.base|)) (= 0 |cstrlcpy_#in~src.offset|)), 1330#(and (<= 1 (select |#length| cstrlcpy_~s~0.base)) (= 0 cstrlcpy_~s~0.offset)), 1331#(and (<= 1 (select |#length| |cstrlcpy_#t~post6.base|)) (= |cstrlcpy_#t~post6.offset| 0)), 1323#true, 1324#false, 1325#(<= 1 main_~length~0), 1326#(and (= main_~length~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|) (<= 1 main_~length~0)), 1327#(and (= 0 main_~nondetString2~0.offset) (= main_~length~0 (select |#length| main_~nondetString2~0.base)) (<= 1 main_~length~0))] [2018-02-02 09:49:47,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:47,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:49:47,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:49:47,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:49:47,951 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-02-02 09:49:48,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:48,043 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-02-02 09:49:48,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:49:48,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-02 09:49:48,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:48,044 INFO L225 Difference]: With dead ends: 59 [2018-02-02 09:49:48,044 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 09:49:48,044 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:49:48,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 09:49:48,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-02-02 09:49:48,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 09:49:48,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2018-02-02 09:49:48,046 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 22 [2018-02-02 09:49:48,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:48,046 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2018-02-02 09:49:48,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:49:48,046 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2018-02-02 09:49:48,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 09:49:48,046 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:48,046 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:48,046 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:48,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1535458206, now seen corresponding path program 1 times [2018-02-02 09:49:48,047 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:48,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:48,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-02 09:49:48,218 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:49:48,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 09:49:48,218 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:48,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-02 09:49:48,218 INFO L182 omatonBuilderFactory]: Interpolants [1456#(and (= 0 main_~nondetString1~0.offset) (<= main_~length~0 1) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~n~1 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length~0)), 1457#(and (= 0 main_~nondetString1~0.offset) (<= main_~length~0 1) (= main_~n~1 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length~0)), 1458#(and (= 0 main_~nondetString1~0.offset) (= main_~n~1 (select |#length| main_~nondetString1~0.base))), 1459#(and (<= (select |#length| |cstrlcpy_#in~dst.base|) |cstrlcpy_#in~siz|) (<= |cstrlcpy_#in~siz| (select |#length| |cstrlcpy_#in~dst.base|)) (= 0 |cstrlcpy_#in~dst.offset|)), 1460#(and (<= (select |#length| cstrlcpy_~d~0.base) cstrlcpy_~n~0) (= 0 cstrlcpy_~d~0.offset) (<= cstrlcpy_~n~0 (select |#length| cstrlcpy_~d~0.base))), 1461#(and (or (<= (+ (div |cstrlcpy_#t~pre0| 4294967296) 1) 0) (<= (+ |cstrlcpy_#t~pre0| 1) (select |#length| cstrlcpy_~d~0.base)) (<= |cstrlcpy_#t~pre0| (* 4294967296 (div |cstrlcpy_#t~pre0| 4294967296)))) (= 0 cstrlcpy_~d~0.offset) (or (< 0 (+ (div |cstrlcpy_#t~pre0| 4294967296) 1)) (<= (select |#length| cstrlcpy_~d~0.base) (+ |cstrlcpy_#t~pre0| 1)))), 1462#(and (= |cstrlcpy_#t~post1.offset| 0) (= (select |#length| |cstrlcpy_#t~post1.base|) (select |#length| cstrlcpy_~d~0.base)) (or (<= (+ cstrlcpy_~d~0.offset 1) (+ |cstrlcpy_#t~post1.offset| (select |#length| |cstrlcpy_#t~post1.base|))) (<= (select |#length| |cstrlcpy_#t~post1.base|) 0)) (<= (+ |cstrlcpy_#t~post1.offset| 1) cstrlcpy_~d~0.offset)), 1463#(and (<= 1 cstrlcpy_~d~0.offset) (<= (+ cstrlcpy_~d~0.offset 1) (select |#length| cstrlcpy_~d~0.base))), 1452#true, 1453#false, 1454#(and (<= main_~length~0 1) (<= 1 main_~length~0)), 1455#(and (<= main_~length~0 1) (= main_~n~1 (select |#length| |main_#t~malloc10.base|)) (= 0 |main_#t~malloc10.offset|) (<= 1 main_~length~0) (= (select |#valid| |main_#t~malloc10.base|) 1))] [2018-02-02 09:49:48,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:48,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:49:48,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:49:48,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:49:48,219 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 12 states. [2018-02-02 09:49:48,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:48,486 INFO L93 Difference]: Finished difference Result 132 states and 159 transitions. [2018-02-02 09:49:48,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:49:48,487 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-02-02 09:49:48,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:48,488 INFO L225 Difference]: With dead ends: 132 [2018-02-02 09:49:48,488 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 09:49:48,488 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:49:48,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 09:49:48,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 99. [2018-02-02 09:49:48,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 09:49:48,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 127 transitions. [2018-02-02 09:49:48,493 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 127 transitions. Word has length 26 [2018-02-02 09:49:48,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:48,493 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 127 transitions. [2018-02-02 09:49:48,493 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:49:48,494 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 127 transitions. [2018-02-02 09:49:48,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 09:49:48,494 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:48,494 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] [2018-02-02 09:49:48,495 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:48,495 INFO L82 PathProgramCache]: Analyzing trace with hash -44170330, now seen corresponding path program 1 times [2018-02-02 09:49:48,496 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:48,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:48,539 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-02 09:49:48,540 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:49:48,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:49:48,540 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:48,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:48,540 INFO L182 omatonBuilderFactory]: Interpolants [1712#(and (<= 1 cstrlcpy_~n~0) (<= (div cstrlcpy_~n~0 4294967296) 0)), 1707#true, 1708#false, 1709#(<= main_~n~1 2147483647), 1710#(and (<= main_~n~1 2147483647) (<= 1 main_~n~1)), 1711#(and (<= 1 |cstrlcpy_#in~siz|) (<= |cstrlcpy_#in~siz| 2147483647))] [2018-02-02 09:49:48,540 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-02 09:49:48,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:49:48,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:49:48,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:49:48,541 INFO L87 Difference]: Start difference. First operand 99 states and 127 transitions. Second operand 6 states. [2018-02-02 09:49:48,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:48,575 INFO L93 Difference]: Finished difference Result 99 states and 125 transitions. [2018-02-02 09:49:48,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:49:48,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-02 09:49:48,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:48,580 INFO L225 Difference]: With dead ends: 99 [2018-02-02 09:49:48,580 INFO L226 Difference]: Without dead ends: 99 [2018-02-02 09:49:48,580 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:49:48,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-02 09:49:48,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-02-02 09:49:48,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 09:49:48,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 125 transitions. [2018-02-02 09:49:48,587 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 125 transitions. Word has length 26 [2018-02-02 09:49:48,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:48,587 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 125 transitions. [2018-02-02 09:49:48,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:49:48,588 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 125 transitions. [2018-02-02 09:49:48,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 09:49:48,588 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:48,589 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:48,589 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:48,589 INFO L82 PathProgramCache]: Analyzing trace with hash 717809756, now seen corresponding path program 1 times [2018-02-02 09:49:48,589 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:48,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:48,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:48,787 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:49:48,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 09:49:48,788 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:48,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:48,788 INFO L182 omatonBuilderFactory]: Interpolants [1920#(and (<= 1 cstrlcpy_~n~0) (= 0 cstrlcpy_~d~0.offset) (<= cstrlcpy_~n~0 (select |#length| cstrlcpy_~d~0.base))), 1921#(and (< 0 (+ (div |cstrlcpy_#t~pre0| 4294967296) 1)) (= 0 cstrlcpy_~d~0.offset) (or (<= (+ |cstrlcpy_#t~pre0| 1) (select |#length| cstrlcpy_~d~0.base)) (<= |cstrlcpy_#t~pre0| (* 4294967296 (div |cstrlcpy_#t~pre0| 4294967296))))), 1922#(and (<= (+ cstrlcpy_~d~0.offset 1) (+ |cstrlcpy_#t~post1.offset| (select |#length| |cstrlcpy_#t~post1.base|))) (= |cstrlcpy_#t~post1.offset| 0) (= (select |#length| |cstrlcpy_#t~post1.base|) (select |#length| cstrlcpy_~d~0.base)) (<= (+ |cstrlcpy_#t~post1.offset| 1) cstrlcpy_~d~0.offset)), 1923#(and (<= 1 cstrlcpy_~d~0.offset) (<= (+ cstrlcpy_~d~0.offset 1) (select |#length| cstrlcpy_~d~0.base))), 1913#true, 1914#false, 1915#(<= 1 main_~n~1), 1916#(and (= main_~n~1 (select |#length| |main_#t~malloc10.base|)) (= 0 |main_#t~malloc10.offset|) (<= 1 main_~n~1) (= (select |#valid| |main_#t~malloc10.base|) 1)), 1917#(and (= 0 main_~nondetString1~0.offset) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~n~1 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~n~1)), 1918#(and (= 0 main_~nondetString1~0.offset) (= main_~n~1 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~n~1)), 1919#(and (<= 1 |cstrlcpy_#in~siz|) (<= |cstrlcpy_#in~siz| (select |#length| |cstrlcpy_#in~dst.base|)) (= 0 |cstrlcpy_#in~dst.offset|))] [2018-02-02 09:49:48,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:48,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:49:48,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:49:48,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:49:48,789 INFO L87 Difference]: Start difference. First operand 99 states and 125 transitions. Second operand 11 states. [2018-02-02 09:49:48,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:48,933 INFO L93 Difference]: Finished difference Result 121 states and 154 transitions. [2018-02-02 09:49:48,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:49:48,934 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-02-02 09:49:48,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:48,934 INFO L225 Difference]: With dead ends: 121 [2018-02-02 09:49:48,934 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 09:49:48,934 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:49:48,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 09:49:48,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 62. [2018-02-02 09:49:48,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-02 09:49:48,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2018-02-02 09:49:48,936 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 26 [2018-02-02 09:49:48,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:48,936 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2018-02-02 09:49:48,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:49:48,937 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2018-02-02 09:49:48,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 09:49:48,937 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:48,937 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] [2018-02-02 09:49:48,937 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:48,937 INFO L82 PathProgramCache]: Analyzing trace with hash 355579118, now seen corresponding path program 1 times [2018-02-02 09:49:48,938 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:48,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:49,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:49,020 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:49:49,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 09:49:49,021 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:49,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:49,021 INFO L182 omatonBuilderFactory]: Interpolants [2117#true, 2118#false, 2119#(and (<= main_~length~0 1) (<= 1 main_~length~0)), 2120#(and (<= main_~length~0 1) (= 0 |main_#t~malloc11.offset|) (<= 1 main_~length~0)), 2121#(and (= main_~nondetString2~0.offset 0) (= (+ main_~nondetString2~0.offset main_~length~0) 1)), 2122#(and (= main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString2~0.base) main_~nondetString2~0.offset))), 2123#(= 0 (select (select |#memory_int| |cstrlcpy_#in~src.base|) |cstrlcpy_#in~src.offset|)), 2124#(= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) cstrlcpy_~s~0.offset)), 2125#(= 0 (select (select |#memory_int| |cstrlcpy_#t~post2.base|) |cstrlcpy_#t~post2.offset|)), 2126#(= |cstrlcpy_#t~mem4| 0)] [2018-02-02 09:49:49,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:49,021 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:49:49,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:49:49,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:49:49,022 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand 10 states. [2018-02-02 09:49:49,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:49,113 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2018-02-02 09:49:49,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:49:49,114 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-02-02 09:49:49,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:49,114 INFO L225 Difference]: With dead ends: 105 [2018-02-02 09:49:49,114 INFO L226 Difference]: Without dead ends: 105 [2018-02-02 09:49:49,114 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:49:49,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-02 09:49:49,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 94. [2018-02-02 09:49:49,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 09:49:49,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 115 transitions. [2018-02-02 09:49:49,118 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 115 transitions. Word has length 27 [2018-02-02 09:49:49,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:49,118 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 115 transitions. [2018-02-02 09:49:49,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:49:49,118 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2018-02-02 09:49:49,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 09:49:49,119 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:49,119 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] [2018-02-02 09:49:49,119 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:49,119 INFO L82 PathProgramCache]: Analyzing trace with hash 778280944, now seen corresponding path program 1 times [2018-02-02 09:49:49,120 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:49,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:49,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:49,313 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:49:49,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 09:49:49,313 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:49,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:49,314 INFO L182 omatonBuilderFactory]: Interpolants [2338#true, 2339#false, 2340#(<= 1 main_~length~0), 2341#(and (= main_~length~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|) (<= 1 main_~length~0)), 2342#(and (= 0 main_~nondetString2~0.offset) (= main_~length~0 (select |#length| main_~nondetString2~0.base)) (<= 1 main_~length~0)), 2343#(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))))), 2344#(and (or (<= 2 (select |#length| |cstrlcpy_#in~src.base|)) (= 0 (select (select |#memory_int| |cstrlcpy_#in~src.base|) |cstrlcpy_#in~src.offset|))) (= 0 |cstrlcpy_#in~src.offset|)), 2345#(and (or (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) cstrlcpy_~s~0.offset)) (<= 2 (select |#length| cstrlcpy_~s~0.base))) (= 0 cstrlcpy_~s~0.offset)), 2346#(and (or (= 0 (select (select |#memory_int| |cstrlcpy_#t~post2.base|) |cstrlcpy_#t~post2.offset|)) (<= (+ cstrlcpy_~s~0.offset 1) (+ (select |#length| cstrlcpy_~s~0.base) |cstrlcpy_#t~post2.offset|))) (<= (+ |cstrlcpy_#t~post2.offset| 1) cstrlcpy_~s~0.offset) (= |cstrlcpy_#t~post2.offset| 0)), 2347#(and (<= 1 cstrlcpy_~s~0.offset) (or (= |cstrlcpy_#t~mem4| 0) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base)))), 2348#(and (<= 1 cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))), 2349#(and (<= (+ |cstrlcpy_#t~post2.offset| 1) (select |#length| |cstrlcpy_#t~post2.base|)) (<= 1 |cstrlcpy_#t~post2.offset|))] [2018-02-02 09:49:49,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:49,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:49:49,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:49:49,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:49:49,314 INFO L87 Difference]: Start difference. First operand 94 states and 115 transitions. Second operand 12 states. [2018-02-02 09:49:49,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:49,564 INFO L93 Difference]: Finished difference Result 134 states and 160 transitions. [2018-02-02 09:49:49,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 09:49:49,564 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-02-02 09:49:49,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:49,564 INFO L225 Difference]: With dead ends: 134 [2018-02-02 09:49:49,565 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 09:49:49,565 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:49:49,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 09:49:49,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 95. [2018-02-02 09:49:49,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 09:49:49,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2018-02-02 09:49:49,567 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 27 [2018-02-02 09:49:49,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:49,567 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2018-02-02 09:49:49,567 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:49:49,567 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2018-02-02 09:49:49,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 09:49:49,568 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:49,568 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:49,568 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:49,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1893257598, now seen corresponding path program 1 times [2018-02-02 09:49:49,568 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:49,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:49,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:49,618 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:49:49,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:49:49,618 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:49,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:49,618 INFO L182 omatonBuilderFactory]: Interpolants [2593#true, 2594#false, 2595#(= cstrlcpy_~n~0 cstrlcpy_~siz), 2596#(and (<= (+ (* 4294967296 (div cstrlcpy_~n~0 4294967296)) 1) cstrlcpy_~n~0) (= cstrlcpy_~n~0 cstrlcpy_~siz)), 2597#(<= (+ (* 4294967296 (div cstrlcpy_~siz 4294967296)) 1) cstrlcpy_~siz)] [2018-02-02 09:49:49,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:49,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:49:49,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:49:49,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:49:49,619 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 5 states. [2018-02-02 09:49:49,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:49,629 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2018-02-02 09:49:49,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:49:49,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-02 09:49:49,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:49,630 INFO L225 Difference]: With dead ends: 95 [2018-02-02 09:49:49,631 INFO L226 Difference]: Without dead ends: 95 [2018-02-02 09:49:49,631 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:49:49,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-02 09:49:49,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-02-02 09:49:49,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 09:49:49,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2018-02-02 09:49:49,634 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 28 [2018-02-02 09:49:49,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:49,634 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2018-02-02 09:49:49,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:49:49,634 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2018-02-02 09:49:49,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 09:49:49,634 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:49,635 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:49,635 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:49,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1643094554, now seen corresponding path program 1 times [2018-02-02 09:49:49,636 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:49,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:49,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:49,788 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:49:49,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 09:49:49,788 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:49,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:49,789 INFO L182 omatonBuilderFactory]: Interpolants [2788#true, 2789#false, 2790#(<= 1 main_~n~1), 2791#(and (= main_~n~1 (select |#length| |main_#t~malloc10.base|)) (= 0 |main_#t~malloc10.offset|) (<= 1 main_~n~1) (= (select |#valid| |main_#t~malloc10.base|) 1)), 2792#(and (= 0 main_~nondetString1~0.offset) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~n~1 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~n~1)), 2793#(and (= 0 main_~nondetString1~0.offset) (= main_~n~1 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~n~1)), 2794#(and (<= 1 |cstrlcpy_#in~siz|) (<= |cstrlcpy_#in~siz| (select |#length| |cstrlcpy_#in~dst.base|)) (= 0 |cstrlcpy_#in~dst.offset|)), 2795#(and (<= 1 cstrlcpy_~n~0) (= 0 cstrlcpy_~d~0.offset) (<= cstrlcpy_~n~0 (select |#length| cstrlcpy_~d~0.base))), 2796#(and (< 0 (+ (div |cstrlcpy_#t~pre0| 4294967296) 1)) (= 0 cstrlcpy_~d~0.offset) (or (<= (+ |cstrlcpy_#t~pre0| 1) (select |#length| cstrlcpy_~d~0.base)) (<= |cstrlcpy_#t~pre0| (* 4294967296 (div |cstrlcpy_#t~pre0| 4294967296))))), 2797#(and (<= (+ cstrlcpy_~d~0.offset 1) (+ |cstrlcpy_#t~post1.offset| (select |#length| |cstrlcpy_#t~post1.base|))) (= |cstrlcpy_#t~post1.offset| 0) (= |cstrlcpy_#t~post1.base| cstrlcpy_~d~0.base) (<= (+ |cstrlcpy_#t~post1.offset| 1) cstrlcpy_~d~0.offset)), 2798#(and (<= 1 cstrlcpy_~d~0.offset) (<= (+ cstrlcpy_~d~0.offset 1) (select |#length| cstrlcpy_~d~0.base))), 2799#(and (<= (+ |cstrlcpy_#t~post1.offset| 1) (select |#length| |cstrlcpy_#t~post1.base|)) (<= 1 |cstrlcpy_#t~post1.offset|))] [2018-02-02 09:49:49,789 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:49,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:49:49,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:49:49,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:49:49,790 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand 12 states. [2018-02-02 09:49:49,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:49,949 INFO L93 Difference]: Finished difference Result 112 states and 132 transitions. [2018-02-02 09:49:49,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:49:49,949 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-02-02 09:49:49,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:49,950 INFO L225 Difference]: With dead ends: 112 [2018-02-02 09:49:49,950 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 09:49:49,950 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:49:49,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 09:49:49,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2018-02-02 09:49:49,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 09:49:49,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2018-02-02 09:49:49,952 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 28 [2018-02-02 09:49:49,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:49,953 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2018-02-02 09:49:49,953 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:49:49,953 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2018-02-02 09:49:49,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 09:49:49,953 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:49,953 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:49,953 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:49,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1433698709, now seen corresponding path program 1 times [2018-02-02 09:49:49,954 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:49,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:50,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:50,099 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:49:50,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 09:49:50,099 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:50,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:50,099 INFO L182 omatonBuilderFactory]: Interpolants [3024#(and (= 0 main_~nondetString1~0.offset) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~n~1 (select |#length| main_~nondetString1~0.base)) (<= main_~n~1 2147483647)), 3025#(and (= 0 main_~nondetString1~0.offset) (= main_~n~1 (select |#length| main_~nondetString1~0.base)) (<= main_~n~1 2147483647)), 3026#(and (<= (select |#length| |cstrlcpy_#in~dst.base|) |cstrlcpy_#in~siz|) (<= |cstrlcpy_#in~siz| 2147483647) (= 0 |cstrlcpy_#in~dst.offset|)), 3027#(and (<= (select |#length| cstrlcpy_~d~0.base) cstrlcpy_~n~0) (<= cstrlcpy_~n~0 2147483647) (= 0 cstrlcpy_~d~0.offset)), 3028#(and (<= (div cstrlcpy_~n~0 4294967296) 0) (= 0 cstrlcpy_~d~0.offset) (<= (select |#length| cstrlcpy_~d~0.base) (+ cstrlcpy_~n~0 1))), 3029#(and (<= (div cstrlcpy_~n~0 4294967296) 0) (= |cstrlcpy_#t~post1.offset| 0) (= (select |#length| |cstrlcpy_#t~post1.base|) (select |#length| cstrlcpy_~d~0.base)) (<= (+ |cstrlcpy_#t~post1.offset| (select |#length| |cstrlcpy_#t~post1.base|)) (+ cstrlcpy_~d~0.offset cstrlcpy_~n~0))), 3030#(and (<= (div cstrlcpy_~n~0 4294967296) 0) (<= (select |#length| cstrlcpy_~d~0.base) (+ cstrlcpy_~d~0.offset cstrlcpy_~n~0))), 3031#(<= (select |#length| cstrlcpy_~d~0.base) cstrlcpy_~d~0.offset), 3020#true, 3021#false, 3022#(<= main_~n~1 2147483647), 3023#(and (= main_~n~1 (select |#length| |main_#t~malloc10.base|)) (= 0 |main_#t~malloc10.offset|) (<= main_~n~1 2147483647) (= (select |#valid| |main_#t~malloc10.base|) 1))] [2018-02-02 09:49:50,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:50,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:49:50,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:49:50,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:49:50,100 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand 12 states. [2018-02-02 09:49:50,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:50,317 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2018-02-02 09:49:50,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:49:50,318 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-02-02 09:49:50,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:50,318 INFO L225 Difference]: With dead ends: 113 [2018-02-02 09:49:50,318 INFO L226 Difference]: Without dead ends: 109 [2018-02-02 09:49:50,318 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:49:50,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-02 09:49:50,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 95. [2018-02-02 09:49:50,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 09:49:50,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2018-02-02 09:49:50,320 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 29 [2018-02-02 09:49:50,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:50,320 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2018-02-02 09:49:50,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:49:50,320 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2018-02-02 09:49:50,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 09:49:50,321 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:50,321 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] [2018-02-02 09:49:50,321 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:50,321 INFO L82 PathProgramCache]: Analyzing trace with hash -163894416, now seen corresponding path program 1 times [2018-02-02 09:49:50,321 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:50,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:50,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:50,470 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:49:50,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 09:49:50,470 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:50,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:50,470 INFO L182 omatonBuilderFactory]: Interpolants [3264#(= |cstrlcpy_#t~mem7| 0), 3252#true, 3253#false, 3254#(and (<= main_~length~0 1) (<= 1 main_~length~0)), 3255#(and (<= main_~length~0 1) (<= 1 main_~length~0) (= (select |#valid| |main_#t~malloc10.base|) 1)), 3256#(and (<= main_~length~0 1) (= (select |#valid| main_~nondetString1~0.base) 1) (<= 1 main_~length~0)), 3257#(and (<= main_~length~0 1) (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|) (<= 1 main_~length~0)), 3258#(and (= main_~nondetString2~0.offset 0) (= 1 (+ main_~nondetString2~0.offset main_~length~0)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 3259#(and (= main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString2~0.base) main_~nondetString2~0.offset)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 3260#(and (= 0 (select (select |#memory_int| |cstrlcpy_#in~src.base|) |cstrlcpy_#in~src.offset|)) (not (= |cstrlcpy_#in~dst.base| |cstrlcpy_#in~src.base|))), 3261#(= 0 (select (select (store |#memory_int| cstrlcpy_~d~0.base (store (select |#memory_int| cstrlcpy_~d~0.base) cstrlcpy_~d~0.offset 0)) cstrlcpy_~s~0.base) cstrlcpy_~s~0.offset)), 3262#(= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) cstrlcpy_~s~0.offset)), 3263#(= 0 (select (select |#memory_int| |cstrlcpy_#t~post6.base|) |cstrlcpy_#t~post6.offset|))] [2018-02-02 09:49:50,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:50,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:49:50,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:49:50,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:49:50,471 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand 13 states. [2018-02-02 09:49:50,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:50,660 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2018-02-02 09:49:50,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:49:50,660 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-02-02 09:49:50,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:50,660 INFO L225 Difference]: With dead ends: 112 [2018-02-02 09:49:50,661 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 09:49:50,661 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2018-02-02 09:49:50,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 09:49:50,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 92. [2018-02-02 09:49:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-02 09:49:50,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2018-02-02 09:49:50,663 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 30 [2018-02-02 09:49:50,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:50,663 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2018-02-02 09:49:50,663 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:49:50,663 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2018-02-02 09:49:50,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 09:49:50,663 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:50,663 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] [2018-02-02 09:49:50,664 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:50,664 INFO L82 PathProgramCache]: Analyzing trace with hash 215739387, now seen corresponding path program 1 times [2018-02-02 09:49:50,664 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:50,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:50,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:50,713 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:49:50,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:49:50,714 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:50,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:50,714 INFO L182 omatonBuilderFactory]: Interpolants [3489#true, 3490#false, 3491#(= |#valid| |old(#valid)|), 3492#(and (= |old(#valid)| (store |#valid| |main_#t~malloc10.base| 0)) (= (select |#valid| |main_#t~malloc10.base|) 1)), 3493#(and (= |old(#valid)| (store (store |#valid| |main_#t~malloc11.base| 0) |main_#t~malloc10.base| (select (store |#valid| |main_#t~malloc10.base| 0) |main_#t~malloc10.base|))) (not (= |main_#t~malloc10.base| |main_#t~malloc11.base|))), 3494#(= |old(#valid)| (store |#valid| |main_#t~malloc11.base| 0))] [2018-02-02 09:49:50,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:50,714 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:49:50,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:49:50,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:49:50,714 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand 6 states. [2018-02-02 09:49:50,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:50,800 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2018-02-02 09:49:50,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:49:50,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-02 09:49:50,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:50,802 INFO L225 Difference]: With dead ends: 91 [2018-02-02 09:49:50,802 INFO L226 Difference]: Without dead ends: 54 [2018-02-02 09:49:50,802 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-02 09:49:50,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-02 09:49:50,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-02 09:49:50,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 09:49:50,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-02-02 09:49:50,804 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 30 [2018-02-02 09:49:50,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:50,804 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-02-02 09:49:50,804 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:49:50,804 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-02-02 09:49:50,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 09:49:50,805 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:50,805 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] [2018-02-02 09:49:50,805 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:50,805 INFO L82 PathProgramCache]: Analyzing trace with hash -297907922, now seen corresponding path program 1 times [2018-02-02 09:49:50,806 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:50,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:50,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:50,979 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:49:50,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 09:49:50,979 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:50,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:50,979 INFO L182 omatonBuilderFactory]: Interpolants [3648#(and (= (select |#valid| main_~nondetString1~0.base) 1) (<= 1 main_~length~0)), 3649#(and (= main_~length~0 (select |#length| |main_#t~malloc11.base|)) (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|) (<= 1 main_~length~0)), 3650#(and (= 0 main_~nondetString2~0.offset) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (or (= 1 (+ main_~nondetString2~0.offset main_~length~0)) (and (= main_~length~0 (select |#length| main_~nondetString2~0.base)) (<= 1 main_~length~0)))), 3651#(and (= 0 main_~nondetString2~0.offset) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (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))))), 3652#(and (not (= |cstrlcpy_#in~dst.base| |cstrlcpy_#in~src.base|)) (or (<= 2 (select |#length| |cstrlcpy_#in~src.base|)) (= 0 (select (select |#memory_int| |cstrlcpy_#in~src.base|) |cstrlcpy_#in~src.offset|))) (= 0 |cstrlcpy_#in~src.offset|)), 3653#(and (or (= 0 (select (select (store |#memory_int| cstrlcpy_~d~0.base (store (select |#memory_int| cstrlcpy_~d~0.base) cstrlcpy_~d~0.offset 0)) cstrlcpy_~s~0.base) cstrlcpy_~s~0.offset)) (<= 2 (select |#length| cstrlcpy_~s~0.base))) (= 0 cstrlcpy_~s~0.offset)), 3654#(and (or (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) cstrlcpy_~s~0.offset)) (<= 2 (select |#length| cstrlcpy_~s~0.base))) (= 0 cstrlcpy_~s~0.offset)), 3655#(and (= |cstrlcpy_#t~post6.offset| 0) (or (= 0 (select (select |#memory_int| |cstrlcpy_#t~post6.base|) |cstrlcpy_#t~post6.offset|)) (and (<= (+ |cstrlcpy_#t~post6.offset| 1) cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 1) (+ (select |#length| cstrlcpy_~s~0.base) |cstrlcpy_#t~post6.offset|))))), 3656#(or (and (<= 1 cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))) (= |cstrlcpy_#t~mem7| 0)), 3657#(and (<= 1 cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))), 3658#(and (<= 1 |cstrlcpy_#t~post6.offset|) (<= (+ |cstrlcpy_#t~post6.offset| 1) (select |#length| |cstrlcpy_#t~post6.base|))), 3644#true, 3645#false, 3646#(<= 1 main_~length~0), 3647#(and (<= 1 main_~length~0) (= (select |#valid| |main_#t~malloc10.base|) 1))] [2018-02-02 09:49:50,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:50,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 09:49:50,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 09:49:50,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:49:50,980 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 15 states. [2018-02-02 09:49:51,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:51,198 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-02-02 09:49:51,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 09:49:51,198 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2018-02-02 09:49:51,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:51,198 INFO L225 Difference]: With dead ends: 64 [2018-02-02 09:49:51,198 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 09:49:51,199 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:49:51,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 09:49:51,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2018-02-02 09:49:51,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-02 09:49:51,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-02-02 09:49:51,200 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 30 [2018-02-02 09:49:51,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:51,200 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-02-02 09:49:51,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 09:49:51,201 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2018-02-02 09:49:51,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 09:49:51,201 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:51,201 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] [2018-02-02 09:49:51,201 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:51,201 INFO L82 PathProgramCache]: Analyzing trace with hash -119267187, now seen corresponding path program 1 times [2018-02-02 09:49:51,202 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:51,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:51,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:51,355 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:49:51,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 09:49:51,356 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:51,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:51,356 INFO L182 omatonBuilderFactory]: Interpolants [3808#(and (<= 1 cstrlcpy_~s~0.offset) (or (= |cstrlcpy_#t~mem4| 0) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base)))), 3809#(and (<= 1 cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))), 3810#(and (<= 1 |cstrlcpy_#t~post6.offset|) (<= (+ |cstrlcpy_#t~post6.offset| 1) (select |#length| |cstrlcpy_#t~post6.base|))), 3799#true, 3800#false, 3801#(<= 1 main_~length~0), 3802#(and (= main_~length~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|) (<= 1 main_~length~0)), 3803#(and (= 0 main_~nondetString2~0.offset) (= main_~length~0 (select |#length| main_~nondetString2~0.base)) (<= 1 main_~length~0)), 3804#(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))))), 3805#(and (or (<= 2 (select |#length| |cstrlcpy_#in~src.base|)) (= 0 (select (select |#memory_int| |cstrlcpy_#in~src.base|) |cstrlcpy_#in~src.offset|))) (= 0 |cstrlcpy_#in~src.offset|)), 3806#(and (or (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) cstrlcpy_~s~0.offset)) (<= 2 (select |#length| cstrlcpy_~s~0.base))) (= 0 cstrlcpy_~s~0.offset)), 3807#(and (or (= 0 (select (select |#memory_int| |cstrlcpy_#t~post2.base|) |cstrlcpy_#t~post2.offset|)) (<= (+ cstrlcpy_~s~0.offset 1) (+ (select |#length| cstrlcpy_~s~0.base) |cstrlcpy_#t~post2.offset|))) (<= (+ |cstrlcpy_#t~post2.offset| 1) cstrlcpy_~s~0.offset) (= |cstrlcpy_#t~post2.offset| 0))] [2018-02-02 09:49:51,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:51,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:49:51,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:49:51,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:49:51,356 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 12 states. [2018-02-02 09:49:51,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:51,510 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-02-02 09:49:51,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:49:51,511 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-02-02 09:49:51,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:51,511 INFO L225 Difference]: With dead ends: 67 [2018-02-02 09:49:51,511 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 09:49:51,511 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:49:51,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 09:49:51,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2018-02-02 09:49:51,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-02 09:49:51,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-02-02 09:49:51,513 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 32 [2018-02-02 09:49:51,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:51,513 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-02-02 09:49:51,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:49:51,513 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2018-02-02 09:49:51,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 09:49:51,513 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:51,513 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:51,513 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:51,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1093780658, now seen corresponding path program 1 times [2018-02-02 09:49:51,514 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:51,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:51,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:51,664 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:49:51,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 09:49:51,664 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:51,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:51,665 INFO L182 omatonBuilderFactory]: Interpolants [3948#true, 3949#false, 3950#(and (= main_~n~1 (select |#length| |main_#t~malloc10.base|)) (= 0 |main_#t~malloc10.offset|) (= (select |#valid| |main_#t~malloc10.base|) 1)), 3951#(and (= 0 main_~nondetString1~0.offset) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~n~1 (select |#length| main_~nondetString1~0.base))), 3952#(and (= 0 main_~nondetString1~0.offset) (= main_~n~1 (select |#length| main_~nondetString1~0.base))), 3953#(and (<= (select |#length| |cstrlcpy_#in~dst.base|) |cstrlcpy_#in~siz|) (<= |cstrlcpy_#in~siz| (select |#length| |cstrlcpy_#in~dst.base|)) (= 0 |cstrlcpy_#in~dst.offset|)), 3954#(and (<= (select |#length| cstrlcpy_~d~0.base) cstrlcpy_~n~0) (= 0 cstrlcpy_~d~0.offset) (<= cstrlcpy_~n~0 (select |#length| cstrlcpy_~d~0.base))), 3955#(and (<= (+ cstrlcpy_~n~0 1) (select |#length| cstrlcpy_~d~0.base)) (= 0 cstrlcpy_~d~0.offset) (<= (select |#length| cstrlcpy_~d~0.base) (+ cstrlcpy_~n~0 1))), 3956#(and (<= (+ cstrlcpy_~d~0.offset cstrlcpy_~n~0) (+ |cstrlcpy_#t~post1.offset| (select |#length| |cstrlcpy_#t~post1.base|))) (= |cstrlcpy_#t~post1.offset| 0) (= |cstrlcpy_#t~post1.base| cstrlcpy_~d~0.base) (<= (+ |cstrlcpy_#t~post1.offset| (select |#length| |cstrlcpy_#t~post1.base|)) (+ cstrlcpy_~d~0.offset cstrlcpy_~n~0))), 3957#(and (<= (select |#length| cstrlcpy_~d~0.base) (+ cstrlcpy_~d~0.offset cstrlcpy_~n~0)) (<= (+ cstrlcpy_~d~0.offset cstrlcpy_~n~0) (select |#length| cstrlcpy_~d~0.base))), 3958#(and (or (< 0 (+ (div |cstrlcpy_#t~pre0| 4294967296) 1)) (<= (select |#length| cstrlcpy_~d~0.base) (+ cstrlcpy_~d~0.offset |cstrlcpy_#t~pre0| 1))) (or (<= (+ (div |cstrlcpy_#t~pre0| 4294967296) 1) 0) (<= (+ cstrlcpy_~d~0.offset |cstrlcpy_#t~pre0| 1) (select |#length| cstrlcpy_~d~0.base)) (<= |cstrlcpy_#t~pre0| (* 4294967296 (div |cstrlcpy_#t~pre0| 4294967296))))), 3959#(and (or (<= (select |#length| |cstrlcpy_#t~post1.base|) |cstrlcpy_#t~post1.offset|) (<= (+ cstrlcpy_~d~0.offset 1) (select |#length| cstrlcpy_~d~0.base))) (<= (+ |cstrlcpy_#t~post1.offset| 1) cstrlcpy_~d~0.offset)), 3960#(and (<= 1 cstrlcpy_~d~0.offset) (<= (+ cstrlcpy_~d~0.offset 1) (select |#length| cstrlcpy_~d~0.base)))] [2018-02-02 09:49:51,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:51,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:49:51,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:49:51,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:49:51,665 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 13 states. [2018-02-02 09:49:52,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:52,031 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2018-02-02 09:49:52,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 09:49:52,032 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-02-02 09:49:52,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:52,032 INFO L225 Difference]: With dead ends: 78 [2018-02-02 09:49:52,033 INFO L226 Difference]: Without dead ends: 78 [2018-02-02 09:49:52,033 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-02-02 09:49:52,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-02 09:49:52,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2018-02-02 09:49:52,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-02 09:49:52,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2018-02-02 09:49:52,035 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 32 [2018-02-02 09:49:52,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:52,035 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-02-02 09:49:52,035 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:49:52,035 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-02-02 09:49:52,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 09:49:52,036 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:52,036 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:52,036 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:52,036 INFO L82 PathProgramCache]: Analyzing trace with hash -451522982, now seen corresponding path program 2 times [2018-02-02 09:49:52,037 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:52,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:52,261 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:52,261 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:49:52,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 09:49:52,261 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:52,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:52,261 INFO L182 omatonBuilderFactory]: Interpolants [4128#(and (= main_~length~0 (select |#length| |main_#t~malloc11.base|)) (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 4129#(and (= 0 main_~nondetString2~0.offset) (or (not (= (+ main_~nondetString2~0.offset main_~length~0) 2)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (= main_~length~0 (select |#length| main_~nondetString2~0.base))), 4130#(and (= 0 main_~nondetString2~0.offset) (or (and (= 0 (select (select |#memory_int| main_~nondetString2~0.base) 1)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (<= (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base)) 1) (<= 3 (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base))))), 4131#(and (= 0 |cstrlcpy_#in~src.offset|) (or (<= 3 (select |#length| |cstrlcpy_#in~src.base|)) (and (= 0 (select (select |#memory_int| |cstrlcpy_#in~src.base|) 1)) (not (= |cstrlcpy_#in~dst.base| |cstrlcpy_#in~src.base|))) (<= (select |#length| |cstrlcpy_#in~src.base|) 1))), 4132#(and (or (<= 3 (select |#length| cstrlcpy_~s~0.base)) (and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) 1))) (<= (select |#length| cstrlcpy_~s~0.base) 1)) (= 0 cstrlcpy_~s~0.offset)), 4133#(and (= |cstrlcpy_#t~post2.offset| 0) (or (and (<= (+ |cstrlcpy_#t~post2.offset| 1) cstrlcpy_~s~0.offset) (or (<= (+ cstrlcpy_~s~0.offset 2) (+ (select |#length| cstrlcpy_~s~0.base) |cstrlcpy_#t~post2.offset|)) (<= (+ (select |#length| cstrlcpy_~s~0.base) |cstrlcpy_#t~post2.offset|) cstrlcpy_~s~0.offset))) (and (= |cstrlcpy_#t~post2.base| cstrlcpy_~s~0.base) (<= (+ |cstrlcpy_#t~post2.offset| 1) cstrlcpy_~s~0.offset) (= 0 (select (select |#memory_int| |cstrlcpy_#t~post2.base|) 1)) (<= cstrlcpy_~s~0.offset (+ |cstrlcpy_#t~post2.offset| 1)) (not (= |cstrlcpy_#t~post2.base| |cstrlcpy_#t~post1.base|))))), 4134#(or (and (<= 1 cstrlcpy_~s~0.offset) (<= cstrlcpy_~s~0.offset 1) (= 0 (select (select (store |#memory_int| |cstrlcpy_#t~post1.base| (store (select |#memory_int| |cstrlcpy_#t~post1.base|) |cstrlcpy_#t~post1.offset| |cstrlcpy_#t~mem4|)) cstrlcpy_~s~0.base) 1))) (and (<= 1 cstrlcpy_~s~0.offset) (or (<= (select |#length| cstrlcpy_~s~0.base) cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 2) (select |#length| cstrlcpy_~s~0.base))))), 4135#(or (and (<= 1 cstrlcpy_~s~0.offset) (<= cstrlcpy_~s~0.offset 1) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) 1))) (and (<= 1 cstrlcpy_~s~0.offset) (or (<= (select |#length| cstrlcpy_~s~0.base) cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 2) (select |#length| cstrlcpy_~s~0.base))))), 4136#(or (and (= 0 (select (select |#memory_int| |cstrlcpy_#t~post2.base|) |cstrlcpy_#t~post2.offset|)) (= 1 |cstrlcpy_#t~post2.offset|)) (and (<= 2 cstrlcpy_~s~0.offset) (or (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base)) (<= (select |#length| |cstrlcpy_#t~post2.base|) |cstrlcpy_#t~post2.offset|)))), 4137#(or (= |cstrlcpy_#t~mem4| 0) (and (<= 2 cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base)))), 4138#(and (<= 2 cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))), 4139#(and (<= (+ |cstrlcpy_#t~post2.offset| 1) (select |#length| |cstrlcpy_#t~post2.base|)) (<= 2 |cstrlcpy_#t~post2.offset|)), 4124#true, 4125#false, 4126#(= (select |#valid| |main_#t~malloc10.base|) 1), 4127#(= (select |#valid| main_~nondetString1~0.base) 1)] [2018-02-02 09:49:52,261 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:52,262 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:49:52,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:49:52,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:49:52,262 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 16 states. [2018-02-02 09:49:52,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:52,584 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2018-02-02 09:49:52,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 09:49:52,584 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-02-02 09:49:52,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:52,584 INFO L225 Difference]: With dead ends: 82 [2018-02-02 09:49:52,584 INFO L226 Difference]: Without dead ends: 82 [2018-02-02 09:49:52,585 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:49:52,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-02 09:49:52,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 66. [2018-02-02 09:49:52,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-02 09:49:52,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-02-02 09:49:52,586 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 33 [2018-02-02 09:49:52,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:52,586 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-02-02 09:49:52,586 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:49:52,586 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-02-02 09:49:52,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 09:49:52,586 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:52,586 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 09:49:52,586 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:52,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1502086491, now seen corresponding path program 2 times [2018-02-02 09:49:52,587 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:52,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:52,995 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:52,995 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:49:52,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 09:49:52,995 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:52,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:52,996 INFO L182 omatonBuilderFactory]: Interpolants [4320#(and (<= 2 cstrlcpy_~s~0.offset) (or (= 0 (select (select |#memory_int| |cstrlcpy_#t~post6.base|) |cstrlcpy_#t~post6.offset|)) (<= (select |#length| |cstrlcpy_#t~post6.base|) |cstrlcpy_#t~post6.offset|) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base)))), 4321#(and (<= 2 cstrlcpy_~s~0.offset) (or (= |cstrlcpy_#t~mem7| 0) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base)))), 4322#(and (<= 2 cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))), 4323#(and (<= 2 |cstrlcpy_#t~post6.offset|) (<= (+ |cstrlcpy_#t~post6.offset| 1) (select |#length| |cstrlcpy_#t~post6.base|))), 4304#true, 4305#false, 4306#(<= main_~n~1 2147483647), 4307#(and (<= main_~n~1 2147483647) (<= 1 main_~n~1)), 4308#(and (<= main_~n~1 2147483647) (<= 1 main_~n~1) (= (select |#valid| |main_#t~malloc10.base|) 1)), 4309#(and (= (select |#valid| main_~nondetString1~0.base) 1) (<= main_~n~1 2147483647) (<= 1 main_~n~1)), 4310#(and (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (or (= main_~length~0 (select |#length| |main_#t~malloc11.base|)) (not (= main_~n~1 1))) (= 0 |main_#t~malloc11.offset|) (<= main_~n~1 2147483647) (<= 1 main_~n~1)), 4311#(and (= 0 main_~nondetString2~0.offset) (or (not (= main_~n~1 1)) (= main_~length~0 (select |#length| main_~nondetString2~0.base))) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (<= main_~n~1 2147483647) (<= 1 main_~n~1)), 4312#(and (= 0 main_~nondetString2~0.offset) (or (<= (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base)) main_~n~1) (= 0 (select (select |#memory_int| main_~nondetString2~0.base) 1)) (<= 3 (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base)))) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (<= main_~n~1 2147483647) (<= 1 main_~n~1)), 4313#(and (not (= |cstrlcpy_#in~dst.base| |cstrlcpy_#in~src.base|)) (= 0 |cstrlcpy_#in~src.offset|) (or (<= 3 (select |#length| |cstrlcpy_#in~src.base|)) (= 0 (select (select |#memory_int| |cstrlcpy_#in~src.base|) 1)) (and (<= 2 |cstrlcpy_#in~siz|) (<= |cstrlcpy_#in~siz| 2147483647)) (<= (select |#length| |cstrlcpy_#in~src.base|) 1))), 4314#(and (or (and (<= cstrlcpy_~n~0 2147483647) (<= 2 cstrlcpy_~n~0)) (<= 3 (select |#length| cstrlcpy_~s~0.base)) (= 0 (select (select (store |#memory_int| cstrlcpy_~d~0.base (store (select |#memory_int| cstrlcpy_~d~0.base) cstrlcpy_~d~0.offset 0)) cstrlcpy_~s~0.base) 1)) (<= (select |#length| cstrlcpy_~s~0.base) 1)) (= 0 cstrlcpy_~s~0.offset)), 4315#(and (or (<= 3 (select |#length| cstrlcpy_~s~0.base)) (= 0 (select (select (store |#memory_int| cstrlcpy_~d~0.base (store (select |#memory_int| cstrlcpy_~d~0.base) cstrlcpy_~d~0.offset 0)) cstrlcpy_~s~0.base) 1)) (and (<= (div |cstrlcpy_#t~pre0| 4294967296) 0) (<= 1 |cstrlcpy_#t~pre0|)) (<= (select |#length| cstrlcpy_~s~0.base) 1)) (= 0 cstrlcpy_~s~0.offset)), 4316#(and (or (<= 3 (select |#length| cstrlcpy_~s~0.base)) (= 0 (select (select (store |#memory_int| cstrlcpy_~d~0.base (store (select |#memory_int| cstrlcpy_~d~0.base) cstrlcpy_~d~0.offset 0)) cstrlcpy_~s~0.base) 1)) (<= (select |#length| cstrlcpy_~s~0.base) 1)) (= 0 cstrlcpy_~s~0.offset)), 4317#(and (or (<= 3 (select |#length| cstrlcpy_~s~0.base)) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) 1)) (<= (select |#length| cstrlcpy_~s~0.base) 1)) (= 0 cstrlcpy_~s~0.offset)), 4318#(and (<= (+ |cstrlcpy_#t~post6.offset| 1) cstrlcpy_~s~0.offset) (= |cstrlcpy_#t~post6.offset| 0) (or (and (= 0 (select (select |#memory_int| |cstrlcpy_#t~post6.base|) (+ cstrlcpy_~s~0.offset (- |cstrlcpy_#t~post6.offset|)))) (= |cstrlcpy_#t~post6.base| cstrlcpy_~s~0.base)) (<= (+ cstrlcpy_~s~0.offset 2) (+ (select |#length| cstrlcpy_~s~0.base) |cstrlcpy_#t~post6.offset|)) (<= (+ (select |#length| cstrlcpy_~s~0.base) |cstrlcpy_#t~post6.offset|) cstrlcpy_~s~0.offset))), 4319#(and (or (<= (select |#length| cstrlcpy_~s~0.base) cstrlcpy_~s~0.offset) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) cstrlcpy_~s~0.offset)) (<= (+ cstrlcpy_~s~0.offset 2) (select |#length| cstrlcpy_~s~0.base))) (<= 1 cstrlcpy_~s~0.offset))] [2018-02-02 09:49:52,996 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:52,996 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 09:49:52,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 09:49:52,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-02-02 09:49:52,996 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 20 states. [2018-02-02 09:49:53,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:53,470 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-02-02 09:49:53,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 09:49:53,470 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2018-02-02 09:49:53,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:53,471 INFO L225 Difference]: With dead ends: 79 [2018-02-02 09:49:53,471 INFO L226 Difference]: Without dead ends: 79 [2018-02-02 09:49:53,471 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=972, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 09:49:53,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-02 09:49:53,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2018-02-02 09:49:53,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-02 09:49:53,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-02-02 09:49:53,473 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 34 [2018-02-02 09:49:53,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:53,473 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-02-02 09:49:53,473 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 09:49:53,473 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-02-02 09:49:53,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 09:49:53,474 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:53,474 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:53,474 INFO L371 AbstractCegarLoop]: === Iteration 28 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:53,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1112310596, now seen corresponding path program 2 times [2018-02-02 09:49:53,475 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:53,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:53,620 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:53,620 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:49:53,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 09:49:53,621 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:53,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:53,621 INFO L182 omatonBuilderFactory]: Interpolants [4512#(and (or (<= (select |#length| |cstrlcpy_#t~post1.base|) |cstrlcpy_#t~post1.offset|) (<= (+ cstrlcpy_~d~0.offset 1) (select |#length| cstrlcpy_~d~0.base))) (<= 2 cstrlcpy_~d~0.offset)), 4513#(and (<= (+ cstrlcpy_~d~0.offset 1) (select |#length| cstrlcpy_~d~0.base)) (<= 2 cstrlcpy_~d~0.offset)), 4514#(and (<= (+ |cstrlcpy_#t~post1.offset| 1) (select |#length| |cstrlcpy_#t~post1.base|)) (<= 2 |cstrlcpy_#t~post1.offset|)), 4501#true, 4502#false, 4503#(and (= main_~n~1 (select |#length| |main_#t~malloc10.base|)) (= 0 |main_#t~malloc10.offset|) (= (select |#valid| |main_#t~malloc10.base|) 1)), 4504#(and (= 0 main_~nondetString1~0.offset) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~n~1 (select |#length| main_~nondetString1~0.base))), 4505#(and (= 0 main_~nondetString1~0.offset) (= main_~n~1 (select |#length| main_~nondetString1~0.base))), 4506#(and (<= (select |#length| |cstrlcpy_#in~dst.base|) |cstrlcpy_#in~siz|) (<= |cstrlcpy_#in~siz| (select |#length| |cstrlcpy_#in~dst.base|)) (= 0 |cstrlcpy_#in~dst.offset|)), 4507#(and (<= (select |#length| cstrlcpy_~d~0.base) cstrlcpy_~n~0) (= 0 cstrlcpy_~d~0.offset) (<= cstrlcpy_~n~0 (select |#length| cstrlcpy_~d~0.base))), 4508#(and (<= (+ cstrlcpy_~n~0 1) (select |#length| cstrlcpy_~d~0.base)) (= 0 cstrlcpy_~d~0.offset) (<= (select |#length| cstrlcpy_~d~0.base) (+ cstrlcpy_~n~0 1))), 4509#(and (<= (+ cstrlcpy_~d~0.offset cstrlcpy_~n~0) (+ |cstrlcpy_#t~post1.offset| (select |#length| |cstrlcpy_#t~post1.base|))) (= |cstrlcpy_#t~post1.offset| 0) (= |cstrlcpy_#t~post1.base| cstrlcpy_~d~0.base) (<= (+ |cstrlcpy_#t~post1.offset| 1) cstrlcpy_~d~0.offset) (<= (+ |cstrlcpy_#t~post1.offset| (select |#length| |cstrlcpy_#t~post1.base|)) (+ cstrlcpy_~d~0.offset cstrlcpy_~n~0))), 4510#(and (<= 1 cstrlcpy_~d~0.offset) (<= (select |#length| cstrlcpy_~d~0.base) (+ cstrlcpy_~d~0.offset cstrlcpy_~n~0)) (<= (+ cstrlcpy_~d~0.offset cstrlcpy_~n~0) (select |#length| cstrlcpy_~d~0.base))), 4511#(and (<= 1 cstrlcpy_~d~0.offset) (or (< 0 (+ (div |cstrlcpy_#t~pre0| 4294967296) 1)) (<= (select |#length| cstrlcpy_~d~0.base) (+ cstrlcpy_~d~0.offset |cstrlcpy_#t~pre0| 1))) (or (<= (+ (div |cstrlcpy_#t~pre0| 4294967296) 1) 0) (<= (+ cstrlcpy_~d~0.offset |cstrlcpy_#t~pre0| 1) (select |#length| cstrlcpy_~d~0.base)) (<= |cstrlcpy_#t~pre0| (* 4294967296 (div |cstrlcpy_#t~pre0| 4294967296)))))] [2018-02-02 09:49:53,621 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:53,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 09:49:53,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 09:49:53,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:49:53,622 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 14 states. [2018-02-02 09:49:53,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:53,855 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-02-02 09:49:53,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:49:53,855 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-02-02 09:49:53,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:53,855 INFO L225 Difference]: With dead ends: 85 [2018-02-02 09:49:53,856 INFO L226 Difference]: Without dead ends: 85 [2018-02-02 09:49:53,856 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-02-02 09:49:53,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-02 09:49:53,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 71. [2018-02-02 09:49:53,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-02 09:49:53,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2018-02-02 09:49:53,857 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 34 [2018-02-02 09:49:53,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:53,857 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2018-02-02 09:49:53,857 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 09:49:53,857 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2018-02-02 09:49:53,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 09:49:53,857 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:53,857 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:53,858 INFO L371 AbstractCegarLoop]: === Iteration 29 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:53,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1097306111, now seen corresponding path program 1 times [2018-02-02 09:49:53,858 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:53,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:54,021 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:54,022 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:49:54,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 09:49:54,022 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:54,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:54,022 INFO L182 omatonBuilderFactory]: Interpolants [4689#true, 4690#false, 4691#(<= main_~n~1 2147483647), 4692#(and (= main_~n~1 (select |#length| |main_#t~malloc10.base|)) (= 0 |main_#t~malloc10.offset|) (<= main_~n~1 2147483647) (= (select |#valid| |main_#t~malloc10.base|) 1)), 4693#(and (= 0 main_~nondetString1~0.offset) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~n~1 (select |#length| main_~nondetString1~0.base)) (<= main_~n~1 2147483647)), 4694#(and (= 0 main_~nondetString1~0.offset) (= main_~n~1 (select |#length| main_~nondetString1~0.base)) (<= main_~n~1 2147483647)), 4695#(and (<= (select |#length| |cstrlcpy_#in~dst.base|) |cstrlcpy_#in~siz|) (<= |cstrlcpy_#in~siz| 2147483647) (= 0 |cstrlcpy_#in~dst.offset|)), 4696#(and (<= (select |#length| cstrlcpy_~d~0.base) cstrlcpy_~n~0) (<= cstrlcpy_~n~0 2147483647) (= 0 cstrlcpy_~d~0.offset)), 4697#(and (<= cstrlcpy_~n~0 2147483646) (= 0 cstrlcpy_~d~0.offset) (<= (select |#length| cstrlcpy_~d~0.base) (+ cstrlcpy_~n~0 1))), 4698#(and (<= cstrlcpy_~n~0 2147483646) (= |cstrlcpy_#t~post1.offset| 0) (= |cstrlcpy_#t~post1.base| cstrlcpy_~d~0.base) (<= (+ |cstrlcpy_#t~post1.offset| (select |#length| |cstrlcpy_#t~post1.base|)) (+ cstrlcpy_~d~0.offset cstrlcpy_~n~0))), 4699#(and (<= cstrlcpy_~n~0 2147483646) (<= (select |#length| cstrlcpy_~d~0.base) (+ cstrlcpy_~d~0.offset cstrlcpy_~n~0))), 4700#(and (<= (div cstrlcpy_~n~0 4294967296) 0) (<= (select |#length| cstrlcpy_~d~0.base) (+ cstrlcpy_~d~0.offset cstrlcpy_~n~0 1))), 4701#(and (<= (div cstrlcpy_~n~0 4294967296) 0) (<= (select |#length| cstrlcpy_~d~0.base) (+ cstrlcpy_~d~0.offset cstrlcpy_~n~0))), 4702#(<= (select |#length| cstrlcpy_~d~0.base) cstrlcpy_~d~0.offset)] [2018-02-02 09:49:54,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:54,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 09:49:54,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 09:49:54,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:49:54,023 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 14 states. [2018-02-02 09:49:54,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:54,227 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-02-02 09:49:54,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:49:54,228 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-02-02 09:49:54,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:54,228 INFO L225 Difference]: With dead ends: 86 [2018-02-02 09:49:54,228 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 09:49:54,229 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:49:54,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 09:49:54,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2018-02-02 09:49:54,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 09:49:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-02-02 09:49:54,230 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 35 [2018-02-02 09:49:54,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:54,231 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-02-02 09:49:54,231 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 09:49:54,231 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-02-02 09:49:54,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 09:49:54,231 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:54,231 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:54,231 INFO L371 AbstractCegarLoop]: === Iteration 30 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:54,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1315632508, now seen corresponding path program 1 times [2018-02-02 09:49:54,232 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:54,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:54,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:54,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:49:54,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 09:49:54,595 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:54,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:54,596 INFO L182 omatonBuilderFactory]: Interpolants [4879#true, 4880#false, 4881#(= (select |#valid| |main_#t~malloc10.base|) 1), 4882#(= (select |#valid| main_~nondetString1~0.base) 1), 4883#(and (= main_~length~0 (select |#length| |main_#t~malloc11.base|)) (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 4884#(and (= 0 main_~nondetString2~0.offset) (or (not (= (+ main_~nondetString2~0.offset main_~length~0) 2)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (= main_~length~0 (select |#length| main_~nondetString2~0.base))), 4885#(and (= 0 main_~nondetString2~0.offset) (or (and (= 0 (select (select |#memory_int| main_~nondetString2~0.base) 1)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (<= (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base)) 1) (<= 3 (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base))))), 4886#(and (= 0 |cstrlcpy_#in~src.offset|) (or (<= 3 (select |#length| |cstrlcpy_#in~src.base|)) (and (= 0 (select (select |#memory_int| |cstrlcpy_#in~src.base|) 1)) (not (= |cstrlcpy_#in~dst.base| |cstrlcpy_#in~src.base|))) (<= (select |#length| |cstrlcpy_#in~src.base|) 1))), 4887#(and (or (<= 3 (select |#length| cstrlcpy_~s~0.base)) (and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) 1))) (<= (select |#length| cstrlcpy_~s~0.base) 1)) (= 0 cstrlcpy_~s~0.offset)), 4888#(and (<= (+ |cstrlcpy_#t~post2.offset| 1) cstrlcpy_~s~0.offset) (= |cstrlcpy_#t~post2.offset| 0) (or (<= (+ cstrlcpy_~s~0.offset 2) (+ (select |#length| cstrlcpy_~s~0.base) |cstrlcpy_#t~post2.offset|)) (<= (+ (select |#length| cstrlcpy_~s~0.base) |cstrlcpy_#t~post2.offset|) cstrlcpy_~s~0.offset) (and (= |cstrlcpy_#t~post2.base| cstrlcpy_~s~0.base) (= 0 (select (select |#memory_int| |cstrlcpy_#t~post2.base|) 1)) (not (= |cstrlcpy_#t~post2.base| cstrlcpy_~d~0.base)) (<= cstrlcpy_~s~0.offset (+ |cstrlcpy_#t~post2.offset| 1)) (not (= |cstrlcpy_#t~post2.base| |cstrlcpy_#t~post1.base|))))), 4889#(and (<= 1 cstrlcpy_~s~0.offset) (or (and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (<= cstrlcpy_~s~0.offset 1) (= 0 (select (select (store |#memory_int| |cstrlcpy_#t~post1.base| (store (select |#memory_int| |cstrlcpy_#t~post1.base|) |cstrlcpy_#t~post1.offset| |cstrlcpy_#t~mem4|)) cstrlcpy_~s~0.base) 1))) (<= (select |#length| cstrlcpy_~s~0.base) cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 2) (select |#length| cstrlcpy_~s~0.base)))), 4890#(and (or (and (= 0 (select (select (store |#memory_int| cstrlcpy_~d~0.base (store (select |#memory_int| cstrlcpy_~d~0.base) cstrlcpy_~d~0.offset 0)) cstrlcpy_~s~0.base) 1)) (<= cstrlcpy_~s~0.offset 1)) (<= (select |#length| cstrlcpy_~s~0.base) cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 2) (select |#length| cstrlcpy_~s~0.base))) (<= 1 cstrlcpy_~s~0.offset)), 4891#(and (or (<= (select |#length| cstrlcpy_~s~0.base) cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 2) (select |#length| cstrlcpy_~s~0.base)) (and (<= cstrlcpy_~s~0.offset 1) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) 1)))) (<= 1 cstrlcpy_~s~0.offset)), 4892#(and (<= 2 cstrlcpy_~s~0.offset) (or (and (= 0 (select (select |#memory_int| |cstrlcpy_#t~post6.base|) |cstrlcpy_#t~post6.offset|)) (= 1 |cstrlcpy_#t~post6.offset|)) (<= (select |#length| |cstrlcpy_#t~post6.base|) |cstrlcpy_#t~post6.offset|) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base)))), 4893#(and (<= 2 cstrlcpy_~s~0.offset) (or (= |cstrlcpy_#t~mem7| 0) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base)))), 4894#(and (<= 2 cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))), 4895#(and (<= 2 |cstrlcpy_#t~post6.offset|) (<= (+ |cstrlcpy_#t~post6.offset| 1) (select |#length| |cstrlcpy_#t~post6.base|)))] [2018-02-02 09:49:54,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:54,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 09:49:54,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 09:49:54,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:49:54,596 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 17 states. [2018-02-02 09:49:54,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:54,928 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2018-02-02 09:49:54,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 09:49:54,928 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-02-02 09:49:54,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:54,929 INFO L225 Difference]: With dead ends: 88 [2018-02-02 09:49:54,929 INFO L226 Difference]: Without dead ends: 88 [2018-02-02 09:49:54,929 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2018-02-02 09:49:54,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-02 09:49:54,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 74. [2018-02-02 09:49:54,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 09:49:54,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-02-02 09:49:54,931 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 36 [2018-02-02 09:49:54,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:54,931 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-02-02 09:49:54,931 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 09:49:54,931 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-02-02 09:49:54,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 09:49:54,931 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:54,931 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 09:49:54,931 INFO L371 AbstractCegarLoop]: === Iteration 31 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:54,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1593710748, now seen corresponding path program 3 times [2018-02-02 09:49:54,932 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:54,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:55,113 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 09:49:55,113 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:49:55,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 09:49:55,113 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:55,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:55,114 INFO L182 omatonBuilderFactory]: Interpolants [5088#(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))))) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 5089#(and (not (= |cstrlcpy_#in~dst.base| |cstrlcpy_#in~src.base|)) (= 0 (select (select |#memory_int| |cstrlcpy_#in~src.base|) (+ (select |#length| |cstrlcpy_#in~src.base|) (- 1))))), 5090#(= 0 (select (select (store |#memory_int| cstrlcpy_~d~0.base (store (select |#memory_int| cstrlcpy_~d~0.base) cstrlcpy_~d~0.offset 0)) cstrlcpy_~s~0.base) (+ (select |#length| cstrlcpy_~s~0.base) (- 1)))), 5091#(= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ (select |#length| cstrlcpy_~s~0.base) (- 1)))), 5092#(and (= |cstrlcpy_#t~post6.base| cstrlcpy_~s~0.base) (= 0 (select (select |#memory_int| |cstrlcpy_#t~post6.base|) (+ (select |#length| cstrlcpy_~s~0.base) (- 1))))), 5093#(or (= 0 (select (select |#memory_int| |cstrlcpy_#t~post6.base|) |cstrlcpy_#t~post6.offset|)) (<= (select |#length| |cstrlcpy_#t~post6.base|) |cstrlcpy_#t~post6.offset|) (and (<= (+ |cstrlcpy_#t~post6.offset| 1) cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base)))), 5094#(or (and (<= 1 cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))) (= |cstrlcpy_#t~mem7| 0)), 5095#(and (<= 1 cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))), 5096#(and (<= 1 |cstrlcpy_#t~post6.offset|) (<= (+ |cstrlcpy_#t~post6.offset| 1) (select |#length| |cstrlcpy_#t~post6.base|))), 5082#true, 5083#false, 5084#(= (select |#valid| |main_#t~malloc10.base|) 1), 5085#(= (select |#valid| main_~nondetString1~0.base) 1), 5086#(and (= main_~length~0 (select |#length| |main_#t~malloc11.base|)) (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 5087#(and (= main_~nondetString2~0.offset 0) (= main_~length~0 (select |#length| main_~nondetString2~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)))] [2018-02-02 09:49:55,114 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 09:49:55,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 09:49:55,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 09:49:55,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:49:55,115 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 15 states. [2018-02-02 09:49:55,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:55,449 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-02-02 09:49:55,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 09:49:55,449 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2018-02-02 09:49:55,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:55,449 INFO L225 Difference]: With dead ends: 85 [2018-02-02 09:49:55,449 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 09:49:55,450 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2018-02-02 09:49:55,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 09:49:55,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-02-02 09:49:55,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-02 09:49:55,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-02-02 09:49:55,451 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 38 [2018-02-02 09:49:55,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:55,451 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-02-02 09:49:55,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 09:49:55,451 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-02-02 09:49:55,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 09:49:55,451 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:55,451 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 09:49:55,451 INFO L371 AbstractCegarLoop]: === Iteration 32 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:55,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1099949155, now seen corresponding path program 2 times [2018-02-02 09:49:55,452 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:55,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:55,787 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:55,788 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:49:55,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 09:49:55,788 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:55,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:55,789 INFO L182 omatonBuilderFactory]: Interpolants [5280#(and (or (<= (select |#length| cstrlcpy_~s~0.base) cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 2) (select |#length| cstrlcpy_~s~0.base)) (and (<= cstrlcpy_~s~0.offset 1) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) 1)))) (<= 1 cstrlcpy_~s~0.offset)), 5281#(and (<= 2 cstrlcpy_~s~0.offset) (or (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base)) (<= (select |#length| |cstrlcpy_#t~post2.base|) |cstrlcpy_#t~post2.offset|) (and (= 0 (select (select |#memory_int| |cstrlcpy_#t~post2.base|) |cstrlcpy_#t~post2.offset|)) (= 1 |cstrlcpy_#t~post2.offset|)))), 5282#(and (<= 2 cstrlcpy_~s~0.offset) (or (= |cstrlcpy_#t~mem4| 0) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base)))), 5283#(and (<= 2 cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))), 5284#(and (<= 2 |cstrlcpy_#t~post6.offset|) (<= (+ |cstrlcpy_#t~post6.offset| 1) (select |#length| |cstrlcpy_#t~post6.base|))), 5269#true, 5270#false, 5271#(= (select |#valid| |main_#t~malloc10.base|) 1), 5272#(= (select |#valid| main_~nondetString1~0.base) 1), 5273#(and (= main_~length~0 (select |#length| |main_#t~malloc11.base|)) (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 5274#(and (= 0 main_~nondetString2~0.offset) (or (not (= (+ main_~nondetString2~0.offset main_~length~0) 2)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (= main_~length~0 (select |#length| main_~nondetString2~0.base))), 5275#(and (= 0 main_~nondetString2~0.offset) (or (and (= 0 (select (select |#memory_int| main_~nondetString2~0.base) 1)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (<= (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base)) 1) (<= 3 (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base))))), 5276#(and (= 0 |cstrlcpy_#in~src.offset|) (or (<= 3 (select |#length| |cstrlcpy_#in~src.base|)) (and (= 0 (select (select |#memory_int| |cstrlcpy_#in~src.base|) 1)) (not (= |cstrlcpy_#in~dst.base| |cstrlcpy_#in~src.base|))) (<= (select |#length| |cstrlcpy_#in~src.base|) 1))), 5277#(and (or (<= 3 (select |#length| cstrlcpy_~s~0.base)) (and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) 1))) (<= (select |#length| cstrlcpy_~s~0.base) 1)) (= 0 cstrlcpy_~s~0.offset)), 5278#(and (<= (+ |cstrlcpy_#t~post2.offset| 1) cstrlcpy_~s~0.offset) (or (<= (+ cstrlcpy_~s~0.offset 2) (+ (select |#length| cstrlcpy_~s~0.base) |cstrlcpy_#t~post2.offset|)) (<= (+ (select |#length| cstrlcpy_~s~0.base) |cstrlcpy_#t~post2.offset|) cstrlcpy_~s~0.offset) (and (= |cstrlcpy_#t~post2.base| cstrlcpy_~s~0.base) (= 0 (select (select |#memory_int| |cstrlcpy_#t~post2.base|) 1)) (<= cstrlcpy_~s~0.offset (+ |cstrlcpy_#t~post2.offset| 1)) (not (= |cstrlcpy_#t~post2.base| |cstrlcpy_#t~post1.base|)))) (= |cstrlcpy_#t~post2.offset| 0)), 5279#(and (or (<= (select |#length| cstrlcpy_~s~0.base) cstrlcpy_~s~0.offset) (and (<= cstrlcpy_~s~0.offset 1) (= 0 (select (select (store |#memory_int| |cstrlcpy_#t~post1.base| (store (select |#memory_int| |cstrlcpy_#t~post1.base|) |cstrlcpy_#t~post1.offset| |cstrlcpy_#t~mem4|)) cstrlcpy_~s~0.base) 1))) (<= (+ cstrlcpy_~s~0.offset 2) (select |#length| cstrlcpy_~s~0.base))) (<= 1 cstrlcpy_~s~0.offset))] [2018-02-02 09:49:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:55,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:49:55,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:49:55,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:49:55,790 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 16 states. [2018-02-02 09:49:56,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:56,117 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-02-02 09:49:56,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:49:56,117 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2018-02-02 09:49:56,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:56,117 INFO L225 Difference]: With dead ends: 71 [2018-02-02 09:49:56,117 INFO L226 Difference]: Without dead ends: 71 [2018-02-02 09:49:56,118 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2018-02-02 09:49:56,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-02 09:49:56,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2018-02-02 09:49:56,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-02 09:49:56,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-02-02 09:49:56,119 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 38 [2018-02-02 09:49:56,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:56,119 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-02-02 09:49:56,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:49:56,119 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-02-02 09:49:56,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 09:49:56,119 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:56,119 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:56,119 INFO L371 AbstractCegarLoop]: === Iteration 33 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:56,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1981970296, now seen corresponding path program 2 times [2018-02-02 09:49:56,120 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:56,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:56,269 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:49:56,269 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:49:56,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 09:49:56,270 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:56,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:56,270 INFO L182 omatonBuilderFactory]: Interpolants [5440#(and (= 0 main_~nondetString1~0.offset) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~n~1 (select |#length| main_~nondetString1~0.base))), 5441#(and (= 0 main_~nondetString1~0.offset) (= main_~n~1 (select |#length| main_~nondetString1~0.base))), 5442#(and (<= (select |#length| |cstrlcpy_#in~dst.base|) |cstrlcpy_#in~siz|) (<= |cstrlcpy_#in~siz| (select |#length| |cstrlcpy_#in~dst.base|)) (= 0 |cstrlcpy_#in~dst.offset|)), 5443#(and (<= (select |#length| cstrlcpy_~d~0.base) cstrlcpy_~n~0) (= 0 cstrlcpy_~d~0.offset) (<= cstrlcpy_~n~0 (select |#length| cstrlcpy_~d~0.base))), 5444#(and (<= (+ cstrlcpy_~n~0 1) (select |#length| cstrlcpy_~d~0.base)) (= 0 cstrlcpy_~d~0.offset) (<= (select |#length| cstrlcpy_~d~0.base) (+ cstrlcpy_~n~0 1))), 5445#(and (<= (+ cstrlcpy_~d~0.offset cstrlcpy_~n~0) (+ |cstrlcpy_#t~post1.offset| (select |#length| |cstrlcpy_#t~post1.base|))) (= |cstrlcpy_#t~post1.offset| 0) (= |cstrlcpy_#t~post1.base| cstrlcpy_~d~0.base) (<= (+ |cstrlcpy_#t~post1.offset| (select |#length| |cstrlcpy_#t~post1.base|)) (+ cstrlcpy_~d~0.offset cstrlcpy_~n~0))), 5446#(and (<= (select |#length| cstrlcpy_~d~0.base) (+ cstrlcpy_~d~0.offset cstrlcpy_~n~0)) (<= (+ cstrlcpy_~d~0.offset cstrlcpy_~n~0) (select |#length| cstrlcpy_~d~0.base))), 5447#(and (<= (select |#length| cstrlcpy_~d~0.base) (+ cstrlcpy_~d~0.offset cstrlcpy_~n~0 1)) (<= (+ cstrlcpy_~d~0.offset cstrlcpy_~n~0 1) (select |#length| cstrlcpy_~d~0.base))), 5448#(and (or (< 0 (+ (div |cstrlcpy_#t~pre0| 4294967296) 1)) (<= (select |#length| cstrlcpy_~d~0.base) (+ cstrlcpy_~d~0.offset |cstrlcpy_#t~pre0| 1))) (or (<= (+ (div |cstrlcpy_#t~pre0| 4294967296) 1) 0) (<= (+ cstrlcpy_~d~0.offset |cstrlcpy_#t~pre0| 1) (select |#length| cstrlcpy_~d~0.base)) (<= |cstrlcpy_#t~pre0| (* 4294967296 (div |cstrlcpy_#t~pre0| 4294967296))))), 5449#(or (<= (select |#length| |cstrlcpy_#t~post1.base|) |cstrlcpy_#t~post1.offset|) (and (<= (+ cstrlcpy_~d~0.offset 1) (select |#length| cstrlcpy_~d~0.base)) (<= (+ |cstrlcpy_#t~post1.offset| 1) cstrlcpy_~d~0.offset))), 5450#(and (<= 1 cstrlcpy_~d~0.offset) (<= (+ cstrlcpy_~d~0.offset 1) (select |#length| cstrlcpy_~d~0.base))), 5437#true, 5438#false, 5439#(and (= main_~n~1 (select |#length| |main_#t~malloc10.base|)) (= 0 |main_#t~malloc10.offset|) (= (select |#valid| |main_#t~malloc10.base|) 1))] [2018-02-02 09:49:56,270 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:49:56,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 09:49:56,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 09:49:56,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:49:56,271 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 14 states. [2018-02-02 09:49:56,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:56,583 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-02-02 09:49:56,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:49:56,583 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-02-02 09:49:56,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:56,584 INFO L225 Difference]: With dead ends: 66 [2018-02-02 09:49:56,584 INFO L226 Difference]: Without dead ends: 63 [2018-02-02 09:49:56,584 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-02-02 09:49:56,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-02 09:49:56,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-02-02 09:49:56,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 09:49:56,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-02-02 09:49:56,585 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 38 [2018-02-02 09:49:56,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:56,586 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-02-02 09:49:56,586 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 09:49:56,586 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-02-02 09:49:56,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 09:49:56,586 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:56,586 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:56,586 INFO L371 AbstractCegarLoop]: === Iteration 34 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:56,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1310522044, now seen corresponding path program 3 times [2018-02-02 09:49:56,587 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:56,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:56,837 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:49:56,838 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:49:56,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 09:49:56,838 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:56,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:56,839 INFO L182 omatonBuilderFactory]: Interpolants [5600#(= (select |#valid| |main_#t~malloc10.base|) 1), 5601#(= (select |#valid| main_~nondetString1~0.base) 1), 5602#(and (= main_~length~0 (select |#length| |main_#t~malloc11.base|)) (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 5603#(and (= main_~nondetString2~0.offset 0) (= main_~length~0 (select |#length| main_~nondetString2~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 5604#(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))))) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 5605#(and (not (= |cstrlcpy_#in~dst.base| |cstrlcpy_#in~src.base|)) (= 0 (select (select |#memory_int| |cstrlcpy_#in~src.base|) (+ (select |#length| |cstrlcpy_#in~src.base|) (- 1))))), 5606#(and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ (select |#length| cstrlcpy_~s~0.base) (- 1))))), 5607#(and (= |cstrlcpy_#t~post2.base| cstrlcpy_~s~0.base) (not (= cstrlcpy_~d~0.base |cstrlcpy_#t~post2.base|)) (= 0 (select (select |#memory_int| |cstrlcpy_#t~post2.base|) (+ (select |#length| cstrlcpy_~s~0.base) (- 1)))) (not (= |cstrlcpy_#t~post2.base| |cstrlcpy_#t~post1.base|))), 5608#(and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select (store |#memory_int| |cstrlcpy_#t~post1.base| (store (select |#memory_int| |cstrlcpy_#t~post1.base|) |cstrlcpy_#t~post1.offset| |cstrlcpy_#t~mem4|)) cstrlcpy_~s~0.base) (+ (select |#length| cstrlcpy_~s~0.base) (- 1))))), 5609#(and (not (= |cstrlcpy_#t~post1.base| cstrlcpy_~s~0.base)) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ (select |#length| cstrlcpy_~s~0.base) (- 1))))), 5610#(= 0 (select (select (store |#memory_int| |cstrlcpy_#t~post1.base| (store (select |#memory_int| |cstrlcpy_#t~post1.base|) |cstrlcpy_#t~post1.offset| |cstrlcpy_#t~mem4|)) cstrlcpy_~s~0.base) (+ (select |#length| cstrlcpy_~s~0.base) (- 1)))), 5611#(= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ (select |#length| cstrlcpy_~s~0.base) (- 1)))), 5612#(and (<= (+ |cstrlcpy_#t~post2.offset| 1) cstrlcpy_~s~0.offset) (or (= 0 (select (select |#memory_int| |cstrlcpy_#t~post2.base|) |cstrlcpy_#t~post2.offset|)) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base)) (<= (select |#length| |cstrlcpy_#t~post2.base|) |cstrlcpy_#t~post2.offset|))), 5613#(and (<= 1 cstrlcpy_~s~0.offset) (or (= |cstrlcpy_#t~mem4| 0) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base)))), 5614#(and (<= 1 cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))), 5615#(and (<= (+ |cstrlcpy_#t~post2.offset| 1) (select |#length| |cstrlcpy_#t~post2.base|)) (<= 1 |cstrlcpy_#t~post2.offset|)), 5598#true, 5599#false] [2018-02-02 09:49:56,839 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:49:56,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 09:49:56,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 09:49:56,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:49:56,839 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 18 states. [2018-02-02 09:49:57,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:57,211 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-02-02 09:49:57,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:49:57,212 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2018-02-02 09:49:57,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:57,212 INFO L225 Difference]: With dead ends: 66 [2018-02-02 09:49:57,213 INFO L226 Difference]: Without dead ends: 66 [2018-02-02 09:49:57,213 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2018-02-02 09:49:57,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-02 09:49:57,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2018-02-02 09:49:57,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-02 09:49:57,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-02-02 09:49:57,215 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 39 [2018-02-02 09:49:57,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:57,215 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-02-02 09:49:57,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 09:49:57,215 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-02-02 09:49:57,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 09:49:57,215 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:57,216 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 09:49:57,216 INFO L371 AbstractCegarLoop]: === Iteration 35 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:57,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1933713659, now seen corresponding path program 2 times [2018-02-02 09:49:57,216 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:57,228 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:57,761 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:57,761 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:49:57,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 09:49:57,762 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:57,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:57,762 INFO L182 omatonBuilderFactory]: Interpolants [5766#true, 5767#false, 5768#(<= main_~n~1 2147483647), 5769#(and (<= main_~n~1 2147483647) (<= 1 main_~n~1)), 5770#(and (<= main_~n~1 2147483647) (<= 1 main_~n~1) (= (select |#valid| |main_#t~malloc10.base|) 1)), 5771#(and (= (select |#valid| main_~nondetString1~0.base) 1) (<= main_~n~1 2147483647) (<= 1 main_~n~1)), 5772#(and (= main_~length~0 (select |#length| |main_#t~malloc11.base|)) (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|) (<= main_~n~1 2147483647) (<= 1 main_~n~1)), 5773#(and (= 0 main_~nondetString2~0.offset) (or (= main_~length~0 (select |#length| main_~nondetString2~0.base)) (= (+ main_~nondetString2~0.offset main_~length~0) (+ main_~n~1 1))) (or (not (= (+ main_~nondetString2~0.offset main_~length~0) (+ main_~n~1 1))) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (<= main_~n~1 2147483647) (<= 1 main_~n~1)), 5774#(and (= 0 main_~nondetString2~0.offset) (or (<= (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base)) main_~n~1) (and (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= 0 (select (select |#memory_int| main_~nondetString2~0.base) main_~n~1))) (<= (+ main_~n~1 2) (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base)))) (<= main_~n~1 2147483647) (<= 1 main_~n~1)), 5775#(and (<= 1 |cstrlcpy_#in~siz|) (= 0 |cstrlcpy_#in~src.offset|) (<= |cstrlcpy_#in~siz| 2147483647) (or (<= (+ |cstrlcpy_#in~siz| 2) (select |#length| |cstrlcpy_#in~src.base|)) (and (not (= |cstrlcpy_#in~dst.base| |cstrlcpy_#in~src.base|)) (= 0 (select (select |#memory_int| |cstrlcpy_#in~src.base|) |cstrlcpy_#in~siz|))) (<= (select |#length| |cstrlcpy_#in~src.base|) |cstrlcpy_#in~siz|))), 5776#(and (or (<= (+ cstrlcpy_~n~0 2) (select |#length| cstrlcpy_~s~0.base)) (and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) cstrlcpy_~n~0))) (<= (select |#length| cstrlcpy_~s~0.base) cstrlcpy_~n~0)) (<= 1 cstrlcpy_~n~0) (<= cstrlcpy_~n~0 2147483647) (= 0 cstrlcpy_~s~0.offset)), 5777#(and (<= cstrlcpy_~n~0 2147483646) (<= 0 cstrlcpy_~n~0) (or (<= (+ cstrlcpy_~n~0 3) (select |#length| cstrlcpy_~s~0.base)) (<= (select |#length| cstrlcpy_~s~0.base) (+ cstrlcpy_~n~0 1)) (and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ cstrlcpy_~n~0 1))))) (= 0 cstrlcpy_~s~0.offset)), 5778#(and (<= cstrlcpy_~n~0 2147483646) (<= 0 cstrlcpy_~n~0) (= |cstrlcpy_#t~post2.offset| 0) (or (and (= |cstrlcpy_#t~post2.base| cstrlcpy_~s~0.base) (= 0 (select (select |#memory_int| |cstrlcpy_#t~post2.base|) (+ cstrlcpy_~s~0.offset (+ cstrlcpy_~n~0 (- |cstrlcpy_#t~post2.offset|))))) (not (= |cstrlcpy_#t~post2.base| cstrlcpy_~d~0.base)) (not (= |cstrlcpy_#t~post2.base| |cstrlcpy_#t~post1.base|))) (<= (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset 2) (+ (select |#length| cstrlcpy_~s~0.base) |cstrlcpy_#t~post2.offset|)) (<= (+ (select |#length| cstrlcpy_~s~0.base) |cstrlcpy_#t~post2.offset|) (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset)))), 5779#(and (<= cstrlcpy_~n~0 2147483646) (<= 0 cstrlcpy_~n~0) (or (and (= 0 (select (select (store |#memory_int| |cstrlcpy_#t~post1.base| (store (select |#memory_int| |cstrlcpy_#t~post1.base|) |cstrlcpy_#t~post1.offset| |cstrlcpy_#t~mem4|)) cstrlcpy_~s~0.base) (+ cstrlcpy_~s~0.offset cstrlcpy_~n~0))) (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base))) (<= (select |#length| cstrlcpy_~s~0.base) (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset)) (<= (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset 2) (select |#length| cstrlcpy_~s~0.base)))), 5780#(and (<= cstrlcpy_~n~0 2147483646) (<= 0 cstrlcpy_~n~0) (or (<= (select |#length| cstrlcpy_~s~0.base) (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset)) (= 0 (select (select (store |#memory_int| cstrlcpy_~d~0.base (store (select |#memory_int| cstrlcpy_~d~0.base) cstrlcpy_~d~0.offset 0)) cstrlcpy_~s~0.base) (+ cstrlcpy_~s~0.offset cstrlcpy_~n~0))) (<= (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset 2) (select |#length| cstrlcpy_~s~0.base)))), 5781#(and (or (<= (+ cstrlcpy_~s~0.offset |cstrlcpy_#t~pre0| 3) (select |#length| cstrlcpy_~s~0.base)) (<= (+ (div |cstrlcpy_#t~pre0| 4294967296) 1) 0) (= 0 (select (select (store |#memory_int| cstrlcpy_~d~0.base (store (select |#memory_int| cstrlcpy_~d~0.base) cstrlcpy_~d~0.offset 0)) cstrlcpy_~s~0.base) (+ cstrlcpy_~s~0.offset (+ |cstrlcpy_#t~pre0| 1)))) (<= (select |#length| cstrlcpy_~s~0.base) (+ cstrlcpy_~s~0.offset |cstrlcpy_#t~pre0| 1))) (<= 0 (+ |cstrlcpy_#t~pre0| 1)) (<= (div |cstrlcpy_#t~pre0| 4294967296) 0)), 5782#(or (= 0 (select (select (store |#memory_int| cstrlcpy_~d~0.base (store (select |#memory_int| cstrlcpy_~d~0.base) cstrlcpy_~d~0.offset 0)) cstrlcpy_~s~0.base) (+ cstrlcpy_~s~0.offset 1))) (<= (select |#length| cstrlcpy_~s~0.base) (+ cstrlcpy_~s~0.offset 1)) (<= (+ cstrlcpy_~s~0.offset 3) (select |#length| cstrlcpy_~s~0.base))), 5783#(or (<= (select |#length| cstrlcpy_~s~0.base) (+ cstrlcpy_~s~0.offset 1)) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ cstrlcpy_~s~0.offset 1))) (<= (+ cstrlcpy_~s~0.offset 3) (select |#length| cstrlcpy_~s~0.base))), 5784#(or (<= (select |#length| cstrlcpy_~s~0.base) cstrlcpy_~s~0.offset) (and (= 0 (select (select |#memory_int| |cstrlcpy_#t~post6.base|) cstrlcpy_~s~0.offset)) (= |cstrlcpy_#t~post6.base| cstrlcpy_~s~0.base)) (<= (+ cstrlcpy_~s~0.offset 2) (select |#length| cstrlcpy_~s~0.base))), 5785#(or (<= (select |#length| cstrlcpy_~s~0.base) cstrlcpy_~s~0.offset) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) cstrlcpy_~s~0.offset)) (<= (+ cstrlcpy_~s~0.offset 2) (select |#length| cstrlcpy_~s~0.base))), 5786#(or (= 0 (select (select |#memory_int| |cstrlcpy_#t~post6.base|) |cstrlcpy_#t~post6.offset|)) (and (<= (+ |cstrlcpy_#t~post6.offset| 1) cstrlcpy_~s~0.offset) (or (<= (select |#length| |cstrlcpy_#t~post6.base|) |cstrlcpy_#t~post6.offset|) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))))), 5787#(or (and (<= 1 cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))) (= |cstrlcpy_#t~mem7| 0)), 5788#(and (<= 1 cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))), 5789#(and (<= 1 |cstrlcpy_#t~post6.offset|) (<= (+ |cstrlcpy_#t~post6.offset| 1) (select |#length| |cstrlcpy_#t~post6.base|)))] [2018-02-02 09:49:57,763 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:57,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 09:49:57,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 09:49:57,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:49:57,763 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 24 states. [2018-02-02 09:49:58,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:58,223 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-02-02 09:49:58,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 09:49:58,224 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 40 [2018-02-02 09:49:58,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:58,224 INFO L225 Difference]: With dead ends: 70 [2018-02-02 09:49:58,224 INFO L226 Difference]: Without dead ends: 70 [2018-02-02 09:49:58,224 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2018-02-02 09:49:58,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-02 09:49:58,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2018-02-02 09:49:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-02 09:49:58,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-02-02 09:49:58,226 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 40 [2018-02-02 09:49:58,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:58,227 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-02-02 09:49:58,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 09:49:58,227 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-02-02 09:49:58,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 09:49:58,227 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:58,227 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:58,227 INFO L371 AbstractCegarLoop]: === Iteration 36 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:58,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1971477742, now seen corresponding path program 3 times [2018-02-02 09:49:58,228 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:58,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:58,432 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:49:58,432 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:49:58,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 09:49:58,432 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:58,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:58,433 INFO L182 omatonBuilderFactory]: Interpolants [5952#(and (<= (select |#length| cstrlcpy_~d~0.base) (+ cstrlcpy_~d~0.offset cstrlcpy_~n~0 1)) (<= (+ cstrlcpy_~d~0.offset cstrlcpy_~n~0 1) (select |#length| cstrlcpy_~d~0.base))), 5953#(and (or (< 0 (+ (div |cstrlcpy_#t~pre0| 4294967296) 1)) (<= (select |#length| cstrlcpy_~d~0.base) (+ cstrlcpy_~d~0.offset |cstrlcpy_#t~pre0| 1))) (or (<= (+ (div |cstrlcpy_#t~pre0| 4294967296) 1) 0) (<= (+ cstrlcpy_~d~0.offset |cstrlcpy_#t~pre0| 1) (select |#length| cstrlcpy_~d~0.base)) (<= |cstrlcpy_#t~pre0| (* 4294967296 (div |cstrlcpy_#t~pre0| 4294967296))))), 5954#(or (<= (select |#length| |cstrlcpy_#t~post1.base|) |cstrlcpy_#t~post1.offset|) (and (<= (+ cstrlcpy_~d~0.offset 1) (select |#length| cstrlcpy_~d~0.base)) (<= (+ |cstrlcpy_#t~post1.offset| 1) cstrlcpy_~d~0.offset))), 5955#(and (<= 1 cstrlcpy_~d~0.offset) (<= (+ cstrlcpy_~d~0.offset 1) (select |#length| cstrlcpy_~d~0.base))), 5956#(and (<= (+ |cstrlcpy_#t~post1.offset| 1) (select |#length| |cstrlcpy_#t~post1.base|)) (<= 1 |cstrlcpy_#t~post1.offset|)), 5942#true, 5943#false, 5944#(and (= main_~n~1 (select |#length| |main_#t~malloc10.base|)) (= 0 |main_#t~malloc10.offset|) (= (select |#valid| |main_#t~malloc10.base|) 1)), 5945#(and (= 0 main_~nondetString1~0.offset) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~n~1 (select |#length| main_~nondetString1~0.base))), 5946#(and (= 0 main_~nondetString1~0.offset) (= main_~n~1 (select |#length| main_~nondetString1~0.base))), 5947#(and (<= (select |#length| |cstrlcpy_#in~dst.base|) |cstrlcpy_#in~siz|) (<= |cstrlcpy_#in~siz| (select |#length| |cstrlcpy_#in~dst.base|)) (= 0 |cstrlcpy_#in~dst.offset|)), 5948#(and (<= (select |#length| cstrlcpy_~d~0.base) cstrlcpy_~n~0) (= 0 cstrlcpy_~d~0.offset) (<= cstrlcpy_~n~0 (select |#length| cstrlcpy_~d~0.base))), 5949#(and (<= (+ cstrlcpy_~n~0 1) (select |#length| cstrlcpy_~d~0.base)) (= 0 cstrlcpy_~d~0.offset) (<= (select |#length| cstrlcpy_~d~0.base) (+ cstrlcpy_~n~0 1))), 5950#(and (<= (+ cstrlcpy_~d~0.offset cstrlcpy_~n~0) (+ |cstrlcpy_#t~post1.offset| (select |#length| |cstrlcpy_#t~post1.base|))) (= |cstrlcpy_#t~post1.offset| 0) (= |cstrlcpy_#t~post1.base| cstrlcpy_~d~0.base) (<= (+ |cstrlcpy_#t~post1.offset| (select |#length| |cstrlcpy_#t~post1.base|)) (+ cstrlcpy_~d~0.offset cstrlcpy_~n~0))), 5951#(and (<= (select |#length| cstrlcpy_~d~0.base) (+ cstrlcpy_~d~0.offset cstrlcpy_~n~0)) (<= (+ cstrlcpy_~d~0.offset cstrlcpy_~n~0) (select |#length| cstrlcpy_~d~0.base)))] [2018-02-02 09:49:58,433 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:49:58,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 09:49:58,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 09:49:58,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:49:58,433 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 15 states. [2018-02-02 09:49:58,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:58,709 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-02-02 09:49:58,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:49:58,709 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-02-02 09:49:58,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:58,709 INFO L225 Difference]: With dead ends: 65 [2018-02-02 09:49:58,709 INFO L226 Difference]: Without dead ends: 65 [2018-02-02 09:49:58,710 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:49:58,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-02 09:49:58,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-02-02 09:49:58,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 09:49:58,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-02-02 09:49:58,711 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 40 [2018-02-02 09:49:58,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:58,711 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-02-02 09:49:58,711 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 09:49:58,711 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-02-02 09:49:58,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 09:49:58,711 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:58,711 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] [2018-02-02 09:49:58,711 INFO L371 AbstractCegarLoop]: === Iteration 37 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:58,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1953428314, now seen corresponding path program 3 times [2018-02-02 09:49:58,712 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:58,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:59,373 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:59,373 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:49:59,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 09:49:59,373 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:59,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:59,374 INFO L182 omatonBuilderFactory]: Interpolants [6103#true, 6104#false, 6105#(<= main_~n~1 2147483647), 6106#(and (<= main_~n~1 2147483647) (<= 1 main_~n~1)), 6107#(and (= 0 |main_#t~malloc10.offset|) (<= main_~n~1 2147483647) (<= 1 main_~n~1) (= (select |#valid| |main_#t~malloc10.base|) 1)), 6108#(and (= (select |#valid| main_~nondetString1~0.base) 1) (<= main_~n~1 2147483647) (<= 1 main_~n~1) (= main_~nondetString1~0.offset 0)), 6109#(and (= main_~length~0 (select |#length| |main_#t~malloc11.base|)) (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|) (<= main_~n~1 2147483647) (<= 1 main_~n~1) (= main_~nondetString1~0.offset 0)), 6110#(and (= 0 main_~nondetString2~0.offset) (or (= (+ main_~nondetString2~0.offset main_~length~0) (+ main_~n~1 main_~nondetString1~0.offset)) (= main_~length~0 (select |#length| main_~nondetString2~0.base))) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (<= main_~n~1 2147483647) (<= 1 main_~n~1) (= main_~nondetString1~0.offset 0)), 6111#(and (= 0 main_~nondetString2~0.offset) (or (= 0 (select (select |#memory_int| main_~nondetString2~0.base) (+ main_~nondetString1~0.offset main_~n~1 (- 1)))) (<= (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base) 1) (+ main_~n~1 main_~nondetString1~0.offset)) (<= (+ main_~n~1 main_~nondetString1~0.offset 1) (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base)))) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (<= main_~n~1 2147483647) (<= 1 main_~n~1) (= main_~nondetString1~0.offset 0)), 6112#(and (<= 1 |cstrlcpy_#in~siz|) (= 0 |cstrlcpy_#in~src.offset|) (<= |cstrlcpy_#in~siz| 2147483647) (or (<= (+ (select |#length| |cstrlcpy_#in~src.base|) 1) |cstrlcpy_#in~siz|) (and (not (= |cstrlcpy_#in~dst.base| |cstrlcpy_#in~src.base|)) (= 0 (select (select |#memory_int| |cstrlcpy_#in~src.base|) (+ |cstrlcpy_#in~siz| (- 1))))) (<= (+ |cstrlcpy_#in~siz| 1) (select |#length| |cstrlcpy_#in~src.base|)))), 6113#(and (<= 1 cstrlcpy_~n~0) (<= cstrlcpy_~n~0 2147483647) (or (<= (+ cstrlcpy_~n~0 1) (select |#length| cstrlcpy_~s~0.base)) (<= (+ (select |#length| cstrlcpy_~s~0.base) 1) cstrlcpy_~n~0) (and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ cstrlcpy_~n~0 (- 1)))))) (= 0 cstrlcpy_~s~0.offset)), 6114#(and (<= cstrlcpy_~n~0 2147483646) (or (and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ (+ cstrlcpy_~n~0 1) (- 1))))) (<= (+ cstrlcpy_~n~0 2) (select |#length| cstrlcpy_~s~0.base)) (<= (select |#length| cstrlcpy_~s~0.base) cstrlcpy_~n~0)) (<= 0 cstrlcpy_~n~0) (= 0 cstrlcpy_~s~0.offset)), 6115#(and (<= cstrlcpy_~n~0 2147483646) (<= 0 cstrlcpy_~n~0) (= |cstrlcpy_#t~post2.offset| 0) (or (and (= |cstrlcpy_#t~post2.base| cstrlcpy_~s~0.base) (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select |#memory_int| |cstrlcpy_#t~post2.base|) (+ (+ cstrlcpy_~s~0.offset (+ cstrlcpy_~n~0 (- |cstrlcpy_#t~post2.offset|))) (- 1)))) (not (= |cstrlcpy_#t~post2.base| |cstrlcpy_#t~post1.base|))) (<= (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset 1) (+ (select |#length| cstrlcpy_~s~0.base) |cstrlcpy_#t~post2.offset|)) (<= (+ (select |#length| cstrlcpy_~s~0.base) |cstrlcpy_#t~post2.offset| 1) (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset)))), 6116#(and (<= cstrlcpy_~n~0 2147483646) (<= 0 cstrlcpy_~n~0) (or (and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select (store |#memory_int| |cstrlcpy_#t~post1.base| (store (select |#memory_int| |cstrlcpy_#t~post1.base|) |cstrlcpy_#t~post1.offset| |cstrlcpy_#t~mem4|)) cstrlcpy_~s~0.base) (+ (+ cstrlcpy_~s~0.offset cstrlcpy_~n~0) (- 1))))) (<= (+ (select |#length| cstrlcpy_~s~0.base) 1) (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset)) (<= (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base)))), 6117#(and (<= cstrlcpy_~n~0 2147483646) (or (<= (+ (select |#length| cstrlcpy_~s~0.base) 1) (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset)) (and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ (+ cstrlcpy_~s~0.offset cstrlcpy_~n~0) (- 1))))) (<= (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))) (<= 0 cstrlcpy_~n~0)), 6118#(and (or (<= (select |#length| cstrlcpy_~s~0.base) (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset)) (<= (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset 2) (select |#length| cstrlcpy_~s~0.base)) (and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ (+ cstrlcpy_~s~0.offset (+ cstrlcpy_~n~0 1)) (- 1)))))) (<= 0 (+ cstrlcpy_~n~0 1)) (<= cstrlcpy_~n~0 2147483645)), 6119#(and (<= 0 (+ cstrlcpy_~n~0 1)) (or (<= (+ (select |#length| cstrlcpy_~s~0.base) 1) (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset)) (and (= |cstrlcpy_#t~post2.base| cstrlcpy_~s~0.base) (not (= |cstrlcpy_#t~post2.base| cstrlcpy_~d~0.base)) (= 0 (select (select |#memory_int| |cstrlcpy_#t~post2.base|) (+ (+ cstrlcpy_~s~0.offset cstrlcpy_~n~0) (- 1)))) (not (= |cstrlcpy_#t~post2.base| |cstrlcpy_#t~post1.base|))) (<= (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))) (<= cstrlcpy_~n~0 2147483645)), 6120#(and (<= 0 (+ cstrlcpy_~n~0 1)) (or (and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select (store |#memory_int| |cstrlcpy_#t~post1.base| (store (select |#memory_int| |cstrlcpy_#t~post1.base|) |cstrlcpy_#t~post1.offset| |cstrlcpy_#t~mem4|)) cstrlcpy_~s~0.base) (+ (+ cstrlcpy_~s~0.offset cstrlcpy_~n~0) (- 1))))) (<= (+ (select |#length| cstrlcpy_~s~0.base) 1) (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset)) (<= (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))) (<= cstrlcpy_~n~0 2147483645)), 6121#(and (or (= 0 (select (select (store |#memory_int| cstrlcpy_~d~0.base (store (select |#memory_int| cstrlcpy_~d~0.base) cstrlcpy_~d~0.offset 0)) cstrlcpy_~s~0.base) (+ (+ cstrlcpy_~s~0.offset cstrlcpy_~n~0) (- 1)))) (<= (+ (select |#length| cstrlcpy_~s~0.base) 1) (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset)) (<= (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))) (<= 0 (+ cstrlcpy_~n~0 1)) (<= cstrlcpy_~n~0 2147483645)), 6122#(and (or (<= (+ (div |cstrlcpy_#t~pre0| 4294967296) 1) 0) (= 0 (select (select (store |#memory_int| cstrlcpy_~d~0.base (store (select |#memory_int| cstrlcpy_~d~0.base) cstrlcpy_~d~0.offset 0)) cstrlcpy_~s~0.base) (+ (+ cstrlcpy_~s~0.offset (+ |cstrlcpy_#t~pre0| 1)) (- 1)))) (<= (select |#length| cstrlcpy_~s~0.base) (+ cstrlcpy_~s~0.offset |cstrlcpy_#t~pre0|)) (<= (+ cstrlcpy_~s~0.offset |cstrlcpy_#t~pre0| 2) (select |#length| cstrlcpy_~s~0.base))) (<= 0 (+ |cstrlcpy_#t~pre0| 2)) (<= (div |cstrlcpy_#t~pre0| 4294967296) 0)), 6123#(or (<= (select |#length| cstrlcpy_~s~0.base) cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 2) (select |#length| cstrlcpy_~s~0.base)) (= 0 (select (select (store |#memory_int| cstrlcpy_~d~0.base (store (select |#memory_int| cstrlcpy_~d~0.base) cstrlcpy_~d~0.offset 0)) cstrlcpy_~s~0.base) (+ (+ cstrlcpy_~s~0.offset 1) (- 1))))), 6124#(or (<= (select |#length| cstrlcpy_~s~0.base) cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 2) (select |#length| cstrlcpy_~s~0.base)) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ (+ cstrlcpy_~s~0.offset 1) (- 1))))), 6125#(or (= 0 (select (select |#memory_int| |cstrlcpy_#t~post6.base|) |cstrlcpy_#t~post6.offset|)) (and (<= (+ |cstrlcpy_#t~post6.offset| 1) cstrlcpy_~s~0.offset) (or (<= (select |#length| |cstrlcpy_#t~post6.base|) |cstrlcpy_#t~post6.offset|) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))))), 6126#(or (and (<= 1 cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))) (= |cstrlcpy_#t~mem7| 0)), 6127#(and (<= 1 cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))), 6128#(and (<= 1 |cstrlcpy_#t~post6.offset|) (<= (+ |cstrlcpy_#t~post6.offset| 1) (select |#length| |cstrlcpy_#t~post6.base|)))] [2018-02-02 09:49:59,374 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:59,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 09:49:59,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 09:49:59,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2018-02-02 09:49:59,374 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 26 states. [2018-02-02 09:49:59,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:59,952 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-02-02 09:49:59,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 09:49:59,953 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 42 [2018-02-02 09:49:59,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:59,953 INFO L225 Difference]: With dead ends: 71 [2018-02-02 09:49:59,953 INFO L226 Difference]: Without dead ends: 71 [2018-02-02 09:49:59,953 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=151, Invalid=1409, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 09:49:59,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-02 09:49:59,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 63. [2018-02-02 09:49:59,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 09:49:59,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-02-02 09:49:59,955 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 42 [2018-02-02 09:49:59,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:59,955 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-02-02 09:49:59,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 09:49:59,955 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-02-02 09:49:59,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 09:49:59,955 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:59,955 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-02-02 09:49:59,955 INFO L371 AbstractCegarLoop]: === Iteration 38 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:59,955 INFO L82 PathProgramCache]: Analyzing trace with hash -754899982, now seen corresponding path program 4 times [2018-02-02 09:49:59,956 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:59,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:00,208 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:00,208 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:00,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 09:50:00,208 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:00,209 INFO L182 omatonBuilderFactory]: Interpolants [6304#(and (<= 2 cstrlcpy_~s~0.offset) (= |cstrlcpy_#t~post6.base| cstrlcpy_~s~0.base) (= 0 (select (select |#memory_int| |cstrlcpy_#t~post6.base|) (+ (select |#length| cstrlcpy_~s~0.base) (- 1))))), 6305#(and (<= 2 cstrlcpy_~s~0.offset) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ (select |#length| cstrlcpy_~s~0.base) (- 1))))), 6306#(and (<= 3 cstrlcpy_~s~0.offset) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ (select |#length| cstrlcpy_~s~0.base) (- 1))))), 6307#(or (= 0 (select (select |#memory_int| |cstrlcpy_#t~post6.base|) |cstrlcpy_#t~post6.offset|)) (<= (select |#length| |cstrlcpy_#t~post6.base|) |cstrlcpy_#t~post6.offset|) (and (<= 4 cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base)))), 6308#(or (= |cstrlcpy_#t~mem7| 0) (and (<= 4 cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base)))), 6309#(and (<= 4 cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))), 6310#(and (<= 4 |cstrlcpy_#t~post6.offset|) (<= (+ |cstrlcpy_#t~post6.offset| 1) (select |#length| |cstrlcpy_#t~post6.base|))), 6291#true, 6292#false, 6293#(= (select |#valid| |main_#t~malloc10.base|) 1), 6294#(= (select |#valid| main_~nondetString1~0.base) 1), 6295#(and (= main_~length~0 (select |#length| |main_#t~malloc11.base|)) (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 6296#(and (= 0 main_~nondetString2~0.offset) (= main_~length~0 (select |#length| main_~nondetString2~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 6297#(and (= 0 main_~nondetString2~0.offset) (= 0 (select (select |#memory_int| main_~nondetString2~0.base) (+ (select |#length| main_~nondetString2~0.base) (+ main_~nondetString2~0.offset (- 1))))) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 6298#(and (not (= |cstrlcpy_#in~dst.base| |cstrlcpy_#in~src.base|)) (= 0 |cstrlcpy_#in~src.offset|) (= 0 (select (select |#memory_int| |cstrlcpy_#in~src.base|) (+ (select |#length| |cstrlcpy_#in~src.base|) (- 1))))), 6299#(and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ (select |#length| cstrlcpy_~s~0.base) (- 1)))) (= 0 cstrlcpy_~s~0.offset)), 6300#(and (= |cstrlcpy_#t~post2.base| cstrlcpy_~s~0.base) (<= (+ |cstrlcpy_#t~post2.offset| 1) cstrlcpy_~s~0.offset) (not (= |cstrlcpy_#t~post2.base| cstrlcpy_~d~0.base)) (= 0 (select (select |#memory_int| |cstrlcpy_#t~post2.base|) (+ (select |#length| cstrlcpy_~s~0.base) (- 1)))) (= |cstrlcpy_#t~post2.offset| 0) (not (= |cstrlcpy_#t~post2.base| |cstrlcpy_#t~post1.base|))), 6301#(and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (<= 1 cstrlcpy_~s~0.offset) (= 0 (select (select (store |#memory_int| |cstrlcpy_#t~post1.base| (store (select |#memory_int| |cstrlcpy_#t~post1.base|) |cstrlcpy_#t~post1.offset| |cstrlcpy_#t~mem4|)) cstrlcpy_~s~0.base) (+ (select |#length| cstrlcpy_~s~0.base) (- 1))))), 6302#(and (<= 1 cstrlcpy_~s~0.offset) (= 0 (select (select (store |#memory_int| cstrlcpy_~d~0.base (store (select |#memory_int| cstrlcpy_~d~0.base) cstrlcpy_~d~0.offset 0)) cstrlcpy_~s~0.base) (+ (select |#length| cstrlcpy_~s~0.base) (- 1))))), 6303#(and (<= 1 cstrlcpy_~s~0.offset) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ (select |#length| cstrlcpy_~s~0.base) (- 1)))))] [2018-02-02 09:50:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:00,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 09:50:00,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 09:50:00,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-02-02 09:50:00,209 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 20 states. [2018-02-02 09:50:00,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:00,582 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-02-02 09:50:00,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 09:50:00,586 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2018-02-02 09:50:00,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:00,586 INFO L225 Difference]: With dead ends: 75 [2018-02-02 09:50:00,587 INFO L226 Difference]: Without dead ends: 56 [2018-02-02 09:50:00,587 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=841, Unknown=0, NotChecked=0, Total=992 [2018-02-02 09:50:00,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-02 09:50:00,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-02 09:50:00,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 09:50:00,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-02-02 09:50:00,588 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2018-02-02 09:50:00,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:00,588 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-02-02 09:50:00,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 09:50:00,588 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-02-02 09:50:00,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 09:50:00,588 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:00,588 INFO L351 BasicCegarLoop]: trace histogram [4, 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] [2018-02-02 09:50:00,588 INFO L371 AbstractCegarLoop]: === Iteration 39 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:50:00,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1248661575, now seen corresponding path program 3 times [2018-02-02 09:50:00,589 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:00,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:00,872 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:50:00,872 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:00,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 09:50:00,872 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:00,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:00,873 INFO L182 omatonBuilderFactory]: Interpolants [6466#true, 6467#false, 6468#(= (select |#valid| |main_#t~malloc10.base|) 1), 6469#(= (select |#valid| main_~nondetString1~0.base) 1), 6470#(and (= main_~length~0 (select |#length| |main_#t~malloc11.base|)) (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 6471#(and (= main_~nondetString2~0.offset 0) (= main_~length~0 (select |#length| main_~nondetString2~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 6472#(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))))) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 6473#(and (not (= |cstrlcpy_#in~dst.base| |cstrlcpy_#in~src.base|)) (= 0 (select (select |#memory_int| |cstrlcpy_#in~src.base|) (+ (select |#length| |cstrlcpy_#in~src.base|) (- 1))))), 6474#(and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ (select |#length| cstrlcpy_~s~0.base) (- 1))))), 6475#(and (= |cstrlcpy_#t~post2.base| cstrlcpy_~s~0.base) (not (= cstrlcpy_~d~0.base |cstrlcpy_#t~post2.base|)) (= 0 (select (select |#memory_int| |cstrlcpy_#t~post2.base|) (+ (select |#length| cstrlcpy_~s~0.base) (- 1)))) (not (= |cstrlcpy_#t~post2.base| |cstrlcpy_#t~post1.base|))), 6476#(and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select (store |#memory_int| |cstrlcpy_#t~post1.base| (store (select |#memory_int| |cstrlcpy_#t~post1.base|) |cstrlcpy_#t~post1.offset| |cstrlcpy_#t~mem4|)) cstrlcpy_~s~0.base) (+ (select |#length| cstrlcpy_~s~0.base) (- 1))))), 6477#(and (not (= |cstrlcpy_#t~post1.base| cstrlcpy_~s~0.base)) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ (select |#length| cstrlcpy_~s~0.base) (- 1))))), 6478#(= 0 (select (select (store |#memory_int| |cstrlcpy_#t~post1.base| (store (select |#memory_int| |cstrlcpy_#t~post1.base|) |cstrlcpy_#t~post1.offset| |cstrlcpy_#t~mem4|)) cstrlcpy_~s~0.base) (+ (select |#length| cstrlcpy_~s~0.base) (- 1)))), 6479#(= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ (select |#length| cstrlcpy_~s~0.base) (- 1)))), 6480#(and (<= (+ |cstrlcpy_#t~post2.offset| 1) cstrlcpy_~s~0.offset) (or (= 0 (select (select |#memory_int| |cstrlcpy_#t~post2.base|) |cstrlcpy_#t~post2.offset|)) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base)) (<= (select |#length| |cstrlcpy_#t~post2.base|) |cstrlcpy_#t~post2.offset|))), 6481#(and (<= 1 cstrlcpy_~s~0.offset) (or (= |cstrlcpy_#t~mem4| 0) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base)))), 6482#(and (<= 1 cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))), 6483#(and (<= 1 |cstrlcpy_#t~post6.offset|) (<= (+ |cstrlcpy_#t~post6.offset| 1) (select |#length| |cstrlcpy_#t~post6.base|)))] [2018-02-02 09:50:00,873 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:50:00,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 09:50:00,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 09:50:00,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:50:00,874 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 18 states. [2018-02-02 09:50:01,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:01,171 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-02-02 09:50:01,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:50:01,171 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 44 [2018-02-02 09:50:01,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:01,171 INFO L225 Difference]: With dead ends: 60 [2018-02-02 09:50:01,171 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 09:50:01,172 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2018-02-02 09:50:01,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 09:50:01,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2018-02-02 09:50:01,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 09:50:01,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-02-02 09:50:01,173 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2018-02-02 09:50:01,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:01,173 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-02-02 09:50:01,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 09:50:01,173 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-02-02 09:50:01,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 09:50:01,174 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:01,174 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:01,174 INFO L371 AbstractCegarLoop]: === Iteration 40 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:50:01,174 INFO L82 PathProgramCache]: Analyzing trace with hash -223367471, now seen corresponding path program 5 times [2018-02-02 09:50:01,175 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:01,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:01,964 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:01,965 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:01,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 09:50:01,965 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:01,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:01,965 INFO L182 omatonBuilderFactory]: Interpolants [6622#true, 6623#false, 6624#(<= main_~n~1 2147483647), 6625#(and (<= main_~n~1 2147483647) (<= 1 main_~n~1)), 6626#(and (<= main_~n~1 2147483647) (<= 1 main_~n~1) (= (select |#valid| |main_#t~malloc10.base|) 1)), 6627#(and (= (select |#valid| main_~nondetString1~0.base) 1) (<= main_~n~1 2147483647) (<= 1 main_~n~1)), 6628#(and (= main_~length~0 (select |#length| |main_#t~malloc11.base|)) (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|) (<= main_~n~1 2147483647) (<= 1 main_~n~1)), 6629#(and (= 0 main_~nondetString2~0.offset) (or (= main_~length~0 (select |#length| main_~nondetString2~0.base)) (= (+ main_~nondetString2~0.offset main_~length~0) (+ main_~n~1 1))) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (<= main_~n~1 2147483647) (<= 1 main_~n~1)), 6630#(and (= 0 main_~nondetString2~0.offset) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (<= main_~n~1 2147483647) (or (<= (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base)) main_~n~1) (<= (+ main_~n~1 2) (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base))) (= 0 (select (select |#memory_int| main_~nondetString2~0.base) main_~n~1))) (<= 1 main_~n~1)), 6631#(and (<= 1 |cstrlcpy_#in~siz|) (= 0 |cstrlcpy_#in~src.offset|) (<= |cstrlcpy_#in~siz| 2147483647) (or (<= (+ |cstrlcpy_#in~siz| 2) (select |#length| |cstrlcpy_#in~src.base|)) (and (not (= |cstrlcpy_#in~dst.base| |cstrlcpy_#in~src.base|)) (= 0 (select (select |#memory_int| |cstrlcpy_#in~src.base|) |cstrlcpy_#in~siz|))) (<= (select |#length| |cstrlcpy_#in~src.base|) |cstrlcpy_#in~siz|))), 6632#(and (or (<= (+ cstrlcpy_~n~0 2) (select |#length| cstrlcpy_~s~0.base)) (and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) cstrlcpy_~n~0))) (<= (select |#length| cstrlcpy_~s~0.base) cstrlcpy_~n~0)) (<= 1 cstrlcpy_~n~0) (<= cstrlcpy_~n~0 2147483647) (= 0 cstrlcpy_~s~0.offset)), 6633#(and (<= cstrlcpy_~n~0 2147483646) (<= 0 cstrlcpy_~n~0) (or (<= (+ cstrlcpy_~n~0 3) (select |#length| cstrlcpy_~s~0.base)) (<= (select |#length| cstrlcpy_~s~0.base) (+ cstrlcpy_~n~0 1)) (and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ cstrlcpy_~n~0 1))))) (= 0 cstrlcpy_~s~0.offset)), 6634#(and (<= cstrlcpy_~n~0 2147483646) (<= 0 cstrlcpy_~n~0) (= |cstrlcpy_#t~post2.offset| 0) (or (and (<= (+ |cstrlcpy_#t~post2.offset| 1) cstrlcpy_~s~0.offset) (or (<= (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset 2) (+ (select |#length| cstrlcpy_~s~0.base) |cstrlcpy_#t~post2.offset|)) (<= (+ (select |#length| cstrlcpy_~s~0.base) |cstrlcpy_#t~post2.offset|) (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset)))) (and (= |cstrlcpy_#t~post2.base| cstrlcpy_~s~0.base) (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select |#memory_int| |cstrlcpy_#t~post2.base|) (+ cstrlcpy_~s~0.offset (+ cstrlcpy_~n~0 (- |cstrlcpy_#t~post2.offset|))))) (not (= |cstrlcpy_#t~post2.base| |cstrlcpy_#t~post1.base|))))), 6635#(and (<= cstrlcpy_~n~0 2147483646) (<= 0 cstrlcpy_~n~0) (or (and (= 0 (select (select (store |#memory_int| |cstrlcpy_#t~post1.base| (store (select |#memory_int| |cstrlcpy_#t~post1.base|) |cstrlcpy_#t~post1.offset| |cstrlcpy_#t~mem4|)) cstrlcpy_~s~0.base) (+ cstrlcpy_~s~0.offset cstrlcpy_~n~0))) (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base))) (and (<= 1 cstrlcpy_~s~0.offset) (or (<= (select |#length| cstrlcpy_~s~0.base) (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset)) (<= (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset 2) (select |#length| cstrlcpy_~s~0.base)))))), 6636#(and (<= cstrlcpy_~n~0 2147483646) (<= 0 cstrlcpy_~n~0) (or (and (<= 1 cstrlcpy_~s~0.offset) (or (<= (select |#length| cstrlcpy_~s~0.base) (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset)) (<= (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset 2) (select |#length| cstrlcpy_~s~0.base)))) (and (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ cstrlcpy_~s~0.offset cstrlcpy_~n~0))) (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base))))), 6637#(and (<= 0 (+ cstrlcpy_~n~0 1)) (or (and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ cstrlcpy_~s~0.offset (+ cstrlcpy_~n~0 1))))) (and (<= 1 cstrlcpy_~s~0.offset) (or (<= (select |#length| cstrlcpy_~s~0.base) (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset 1)) (<= (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset 3) (select |#length| cstrlcpy_~s~0.base))))) (<= cstrlcpy_~n~0 2147483645)), 6638#(and (<= 0 (+ cstrlcpy_~n~0 1)) (<= cstrlcpy_~n~0 2147483645) (or (and (= |cstrlcpy_#t~post2.base| cstrlcpy_~s~0.base) (not (= |cstrlcpy_#t~post2.base| cstrlcpy_~d~0.base)) (= 0 (select (select |#memory_int| |cstrlcpy_#t~post2.base|) (+ cstrlcpy_~s~0.offset cstrlcpy_~n~0))) (not (= |cstrlcpy_#t~post2.base| |cstrlcpy_#t~post1.base|))) (and (<= 2 cstrlcpy_~s~0.offset) (or (<= (select |#length| cstrlcpy_~s~0.base) (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset)) (<= (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset 2) (select |#length| cstrlcpy_~s~0.base)))))), 6639#(and (<= 0 (+ cstrlcpy_~n~0 1)) (or (and (= 0 (select (select (store |#memory_int| |cstrlcpy_#t~post1.base| (store (select |#memory_int| |cstrlcpy_#t~post1.base|) |cstrlcpy_#t~post1.offset| |cstrlcpy_#t~mem4|)) cstrlcpy_~s~0.base) (+ cstrlcpy_~s~0.offset cstrlcpy_~n~0))) (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base))) (and (<= 2 cstrlcpy_~s~0.offset) (or (<= (select |#length| cstrlcpy_~s~0.base) (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset)) (<= (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset 2) (select |#length| cstrlcpy_~s~0.base))))) (<= cstrlcpy_~n~0 2147483645)), 6640#(and (or (= 0 (select (select (store |#memory_int| cstrlcpy_~d~0.base (store (select |#memory_int| cstrlcpy_~d~0.base) cstrlcpy_~d~0.offset 0)) cstrlcpy_~s~0.base) (+ cstrlcpy_~s~0.offset cstrlcpy_~n~0))) (and (<= 2 cstrlcpy_~s~0.offset) (or (<= (select |#length| cstrlcpy_~s~0.base) (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset)) (<= (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset 2) (select |#length| cstrlcpy_~s~0.base))))) (<= 0 (+ cstrlcpy_~n~0 1)) (<= cstrlcpy_~n~0 2147483645)), 6641#(and (or (<= (+ (div |cstrlcpy_#t~pre0| 4294967296) 1) 0) (= 0 (select (select (store |#memory_int| cstrlcpy_~d~0.base (store (select |#memory_int| cstrlcpy_~d~0.base) cstrlcpy_~d~0.offset 0)) cstrlcpy_~s~0.base) (+ cstrlcpy_~s~0.offset (+ |cstrlcpy_#t~pre0| 1)))) (and (or (<= (+ cstrlcpy_~s~0.offset |cstrlcpy_#t~pre0| 3) (select |#length| cstrlcpy_~s~0.base)) (<= (select |#length| cstrlcpy_~s~0.base) (+ cstrlcpy_~s~0.offset |cstrlcpy_#t~pre0| 1))) (<= 2 cstrlcpy_~s~0.offset))) (<= 0 (+ |cstrlcpy_#t~pre0| 2)) (<= (div |cstrlcpy_#t~pre0| 4294967296) 0)), 6642#(or (and (<= 2 cstrlcpy_~s~0.offset) (or (<= (select |#length| cstrlcpy_~s~0.base) (+ cstrlcpy_~s~0.offset 1)) (<= (+ cstrlcpy_~s~0.offset 3) (select |#length| cstrlcpy_~s~0.base)))) (= 0 (select (select (store |#memory_int| cstrlcpy_~d~0.base (store (select |#memory_int| cstrlcpy_~d~0.base) cstrlcpy_~d~0.offset 0)) cstrlcpy_~s~0.base) (+ cstrlcpy_~s~0.offset 1)))), 6643#(or (and (<= 2 cstrlcpy_~s~0.offset) (or (<= (select |#length| cstrlcpy_~s~0.base) (+ cstrlcpy_~s~0.offset 1)) (<= (+ cstrlcpy_~s~0.offset 3) (select |#length| cstrlcpy_~s~0.base)))) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ cstrlcpy_~s~0.offset 1)))), 6644#(or (and (= 0 (select (select |#memory_int| |cstrlcpy_#t~post6.base|) cstrlcpy_~s~0.offset)) (= |cstrlcpy_#t~post6.base| cstrlcpy_~s~0.base)) (and (<= 3 cstrlcpy_~s~0.offset) (or (<= (select |#length| cstrlcpy_~s~0.base) cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 2) (select |#length| cstrlcpy_~s~0.base))))), 6645#(or (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) cstrlcpy_~s~0.offset)) (and (<= 3 cstrlcpy_~s~0.offset) (or (<= (select |#length| cstrlcpy_~s~0.base) cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 2) (select |#length| cstrlcpy_~s~0.base))))), 6646#(or (= 0 (select (select |#memory_int| |cstrlcpy_#t~post6.base|) |cstrlcpy_#t~post6.offset|)) (and (<= 4 cstrlcpy_~s~0.offset) (or (<= (select |#length| |cstrlcpy_#t~post6.base|) |cstrlcpy_#t~post6.offset|) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))))), 6647#(or (= |cstrlcpy_#t~mem7| 0) (and (<= 4 cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base)))), 6648#(and (<= 4 cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))), 6649#(and (<= 4 |cstrlcpy_#t~post6.offset|) (<= (+ |cstrlcpy_#t~post6.offset| 1) (select |#length| |cstrlcpy_#t~post6.base|)))] [2018-02-02 09:50:01,966 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:01,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 09:50:01,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 09:50:01,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2018-02-02 09:50:01,966 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 28 states. [2018-02-02 09:50:02,659 WARN L143 SmtUtils]: Spent 152ms on a formula simplification that was a NOOP. DAG size: 46 [2018-02-02 09:50:02,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:02,991 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-02-02 09:50:02,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 09:50:02,991 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 46 [2018-02-02 09:50:02,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:02,991 INFO L225 Difference]: With dead ends: 64 [2018-02-02 09:50:02,992 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 09:50:02,992 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=127, Invalid=1133, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 09:50:02,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 09:50:02,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-02-02 09:50:02,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 09:50:02,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-02-02 09:50:02,993 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 46 [2018-02-02 09:50:02,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:02,993 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-02-02 09:50:02,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 09:50:02,993 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-02-02 09:50:02,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 09:50:02,994 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:02,994 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-02-02 09:50:02,994 INFO L371 AbstractCegarLoop]: === Iteration 41 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:50:02,994 INFO L82 PathProgramCache]: Analyzing trace with hash -827300944, now seen corresponding path program 6 times [2018-02-02 09:50:02,994 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:03,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:03,447 WARN L143 SmtUtils]: Spent 123ms on a formula simplification that was a NOOP. DAG size: 27 [2018-02-02 09:50:04,153 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:04,154 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:04,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 09:50:04,154 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:04,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:04,155 INFO L182 omatonBuilderFactory]: Interpolants [6790#true, 6791#false, 6792#(<= main_~n~1 2147483647), 6793#(and (<= main_~n~1 2147483647) (<= 1 main_~n~1)), 6794#(and (= 0 |main_#t~malloc10.offset|) (<= main_~n~1 2147483647) (<= 1 main_~n~1) (= (select |#valid| |main_#t~malloc10.base|) 1)), 6795#(and (= (select |#valid| main_~nondetString1~0.base) 1) (<= main_~n~1 2147483647) (<= 1 main_~n~1) (= main_~nondetString1~0.offset 0)), 6796#(and (= main_~length~0 (select |#length| |main_#t~malloc11.base|)) (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|) (<= main_~n~1 2147483647) (<= 1 main_~n~1) (= main_~nondetString1~0.offset 0)), 6797#(and (= 0 main_~nondetString2~0.offset) (or (= (+ main_~nondetString2~0.offset main_~length~0) (+ main_~n~1 main_~nondetString1~0.offset)) (= main_~length~0 (select |#length| main_~nondetString2~0.base))) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (<= main_~n~1 2147483647) (<= 1 main_~n~1) (= main_~nondetString1~0.offset 0)), 6798#(and (= 0 main_~nondetString2~0.offset) (or (= 0 (select (select |#memory_int| main_~nondetString2~0.base) (+ main_~nondetString1~0.offset main_~n~1 (- 1)))) (<= (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base) 1) (+ main_~n~1 main_~nondetString1~0.offset)) (<= (+ main_~n~1 main_~nondetString1~0.offset 1) (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base)))) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (<= main_~n~1 2147483647) (<= 1 main_~n~1) (= main_~nondetString1~0.offset 0)), 6799#(and (<= 1 |cstrlcpy_#in~siz|) (= 0 |cstrlcpy_#in~src.offset|) (<= |cstrlcpy_#in~siz| 2147483647) (or (<= (+ (select |#length| |cstrlcpy_#in~src.base|) 1) |cstrlcpy_#in~siz|) (and (not (= |cstrlcpy_#in~dst.base| |cstrlcpy_#in~src.base|)) (= 0 (select (select |#memory_int| |cstrlcpy_#in~src.base|) (+ |cstrlcpy_#in~siz| (- 1))))) (<= (+ |cstrlcpy_#in~siz| 1) (select |#length| |cstrlcpy_#in~src.base|)))), 6800#(and (<= 1 cstrlcpy_~n~0) (<= cstrlcpy_~n~0 2147483647) (or (<= (+ cstrlcpy_~n~0 1) (select |#length| cstrlcpy_~s~0.base)) (<= (+ (select |#length| cstrlcpy_~s~0.base) 1) cstrlcpy_~n~0) (and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ cstrlcpy_~n~0 (- 1)))))) (= 0 cstrlcpy_~s~0.offset)), 6801#(and (<= cstrlcpy_~n~0 2147483646) (or (and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ (+ cstrlcpy_~n~0 1) (- 1))))) (<= (+ cstrlcpy_~n~0 2) (select |#length| cstrlcpy_~s~0.base)) (<= (select |#length| cstrlcpy_~s~0.base) cstrlcpy_~n~0)) (<= 0 cstrlcpy_~n~0) (= 0 cstrlcpy_~s~0.offset)), 6802#(and (<= cstrlcpy_~n~0 2147483646) (<= 0 cstrlcpy_~n~0) (= |cstrlcpy_#t~post2.offset| 0) (or (and (= |cstrlcpy_#t~post2.base| cstrlcpy_~s~0.base) (= 0 (select (select |#memory_int| |cstrlcpy_#t~post2.base|) (+ (+ cstrlcpy_~s~0.offset (+ cstrlcpy_~n~0 (- |cstrlcpy_#t~post2.offset|))) (- 1)))) (not (= cstrlcpy_~d~0.base |cstrlcpy_#t~post2.base|)) (not (= |cstrlcpy_#t~post2.base| |cstrlcpy_#t~post1.base|))) (and (<= (+ |cstrlcpy_#t~post2.offset| 1) cstrlcpy_~s~0.offset) (or (<= (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset 1) (+ (select |#length| cstrlcpy_~s~0.base) |cstrlcpy_#t~post2.offset|)) (<= (+ (select |#length| cstrlcpy_~s~0.base) |cstrlcpy_#t~post2.offset| 1) (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset)))))), 6803#(and (<= cstrlcpy_~n~0 2147483646) (or (and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select (store |#memory_int| |cstrlcpy_#t~post1.base| (store (select |#memory_int| |cstrlcpy_#t~post1.base|) |cstrlcpy_#t~post1.offset| |cstrlcpy_#t~mem4|)) cstrlcpy_~s~0.base) (+ (+ cstrlcpy_~s~0.offset cstrlcpy_~n~0) (- 1))))) (and (<= 1 cstrlcpy_~s~0.offset) (or (<= (+ (select |#length| cstrlcpy_~s~0.base) 1) (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset)) (<= (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))))) (<= 0 cstrlcpy_~n~0)), 6804#(and (<= cstrlcpy_~n~0 2147483646) (<= 0 cstrlcpy_~n~0) (or (and (<= 1 cstrlcpy_~s~0.offset) (or (<= (+ (select |#length| cstrlcpy_~s~0.base) 1) (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset)) (<= (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base)))) (and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ (+ cstrlcpy_~s~0.offset cstrlcpy_~n~0) (- 1))))))), 6805#(and (<= 0 (+ cstrlcpy_~n~0 1)) (<= cstrlcpy_~n~0 2147483645) (or (and (<= 1 cstrlcpy_~s~0.offset) (or (<= (select |#length| cstrlcpy_~s~0.base) (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset)) (<= (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset 2) (select |#length| cstrlcpy_~s~0.base)))) (and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ (+ cstrlcpy_~s~0.offset (+ cstrlcpy_~n~0 1)) (- 1))))))), 6806#(and (<= 0 (+ cstrlcpy_~n~0 1)) (or (and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (not (= |cstrlcpy_#t~post1.base| cstrlcpy_~s~0.base)) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ (+ cstrlcpy_~s~0.offset cstrlcpy_~n~0) (- 1))))) (and (<= 2 cstrlcpy_~s~0.offset) (or (<= (+ (select |#length| cstrlcpy_~s~0.base) 1) (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset)) (<= (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))))) (<= cstrlcpy_~n~0 2147483645)), 6807#(and (or (and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select (store |#memory_int| |cstrlcpy_#t~post1.base| (store (select |#memory_int| |cstrlcpy_#t~post1.base|) |cstrlcpy_#t~post1.offset| |cstrlcpy_#t~mem4|)) cstrlcpy_~s~0.base) (+ (+ cstrlcpy_~s~0.offset cstrlcpy_~n~0) (- 1))))) (and (<= 2 cstrlcpy_~s~0.offset) (or (<= (+ (select |#length| cstrlcpy_~s~0.base) 1) (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset)) (<= (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))))) (<= 0 (+ cstrlcpy_~n~0 1)) (<= cstrlcpy_~n~0 2147483645)), 6808#(and (or (and (<= 2 cstrlcpy_~s~0.offset) (or (<= (+ (select |#length| cstrlcpy_~s~0.base) 1) (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset)) (<= (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base)))) (and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ (+ cstrlcpy_~s~0.offset cstrlcpy_~n~0) (- 1)))))) (<= 0 (+ cstrlcpy_~n~0 1)) (<= cstrlcpy_~n~0 2147483645)), 6809#(and (<= cstrlcpy_~n~0 2147483644) (or (and (<= 2 cstrlcpy_~s~0.offset) (or (<= (select |#length| cstrlcpy_~s~0.base) (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset)) (<= (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset 2) (select |#length| cstrlcpy_~s~0.base)))) (and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ (+ cstrlcpy_~s~0.offset (+ cstrlcpy_~n~0 1)) (- 1)))))) (<= 0 (+ cstrlcpy_~n~0 2))), 6810#(and (or (and (= |cstrlcpy_#t~post2.base| cstrlcpy_~s~0.base) (not (= |cstrlcpy_#t~post2.base| cstrlcpy_~d~0.base)) (= 0 (select (select |#memory_int| |cstrlcpy_#t~post2.base|) (+ (+ cstrlcpy_~s~0.offset cstrlcpy_~n~0) (- 1)))) (not (= |cstrlcpy_#t~post2.base| |cstrlcpy_#t~post1.base|))) (and (or (<= (+ (select |#length| cstrlcpy_~s~0.base) 1) (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset)) (<= (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))) (<= 3 cstrlcpy_~s~0.offset))) (<= cstrlcpy_~n~0 2147483644) (<= 0 (+ cstrlcpy_~n~0 2))), 6811#(and (<= cstrlcpy_~n~0 2147483644) (<= 0 (+ cstrlcpy_~n~0 2)) (or (and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select (store |#memory_int| |cstrlcpy_#t~post1.base| (store (select |#memory_int| |cstrlcpy_#t~post1.base|) |cstrlcpy_#t~post1.offset| |cstrlcpy_#t~mem4|)) cstrlcpy_~s~0.base) (+ (+ cstrlcpy_~s~0.offset cstrlcpy_~n~0) (- 1))))) (and (or (<= (+ (select |#length| cstrlcpy_~s~0.base) 1) (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset)) (<= (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))) (<= 3 cstrlcpy_~s~0.offset)))), 6812#(and (<= cstrlcpy_~n~0 2147483644) (<= 0 (+ cstrlcpy_~n~0 2)) (or (= 0 (select (select (store |#memory_int| cstrlcpy_~d~0.base (store (select |#memory_int| cstrlcpy_~d~0.base) cstrlcpy_~d~0.offset 0)) cstrlcpy_~s~0.base) (+ (+ cstrlcpy_~s~0.offset cstrlcpy_~n~0) (- 1)))) (and (or (<= (+ (select |#length| cstrlcpy_~s~0.base) 1) (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset)) (<= (+ cstrlcpy_~n~0 cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))) (<= 3 cstrlcpy_~s~0.offset)))), 6813#(and (or (= 0 (select (select (store |#memory_int| cstrlcpy_~d~0.base (store (select |#memory_int| cstrlcpy_~d~0.base) cstrlcpy_~d~0.offset 0)) cstrlcpy_~s~0.base) (+ (+ |cstrlcpy_#t~pre0| (+ cstrlcpy_~s~0.offset 1)) (- 1)))) (<= (+ (div |cstrlcpy_#t~pre0| 4294967296) 1) 0) (and (or (<= (select |#length| cstrlcpy_~s~0.base) (+ cstrlcpy_~s~0.offset |cstrlcpy_#t~pre0|)) (<= (+ cstrlcpy_~s~0.offset |cstrlcpy_#t~pre0| 2) (select |#length| cstrlcpy_~s~0.base))) (<= 3 cstrlcpy_~s~0.offset))) (<= (div |cstrlcpy_#t~pre0| 4294967296) 0) (<= 0 (+ |cstrlcpy_#t~pre0| 3))), 6814#(or (and (<= 3 cstrlcpy_~s~0.offset) (or (<= (select |#length| cstrlcpy_~s~0.base) cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 2) (select |#length| cstrlcpy_~s~0.base)))) (= 0 (select (select (store |#memory_int| cstrlcpy_~d~0.base (store (select |#memory_int| cstrlcpy_~d~0.base) cstrlcpy_~d~0.offset 0)) cstrlcpy_~s~0.base) (+ (+ cstrlcpy_~s~0.offset 1) (- 1))))), 6815#(or (and (<= 3 cstrlcpy_~s~0.offset) (or (<= (select |#length| cstrlcpy_~s~0.base) cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 2) (select |#length| cstrlcpy_~s~0.base)))) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ (+ cstrlcpy_~s~0.offset 1) (- 1))))), 6816#(or (= 0 (select (select |#memory_int| |cstrlcpy_#t~post6.base|) |cstrlcpy_#t~post6.offset|)) (and (<= 4 cstrlcpy_~s~0.offset) (or (<= (select |#length| |cstrlcpy_#t~post6.base|) |cstrlcpy_#t~post6.offset|) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))))), 6817#(or (= |cstrlcpy_#t~mem7| 0) (and (<= 4 cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base)))), 6818#(and (<= 4 cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))), 6819#(and (<= 4 |cstrlcpy_#t~post6.offset|) (<= (+ |cstrlcpy_#t~post6.offset| 1) (select |#length| |cstrlcpy_#t~post6.base|)))] [2018-02-02 09:50:04,155 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:04,155 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 09:50:04,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 09:50:04,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=793, Unknown=0, NotChecked=0, Total=870 [2018-02-02 09:50:04,156 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 30 states. [2018-02-02 09:50:05,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:05,021 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-02-02 09:50:05,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 09:50:05,022 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 48 [2018-02-02 09:50:05,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:05,022 INFO L225 Difference]: With dead ends: 77 [2018-02-02 09:50:05,022 INFO L226 Difference]: Without dead ends: 77 [2018-02-02 09:50:05,023 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=140, Invalid=1420, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 09:50:05,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-02 09:50:05,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2018-02-02 09:50:05,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-02 09:50:05,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-02-02 09:50:05,024 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 48 [2018-02-02 09:50:05,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:05,024 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-02-02 09:50:05,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 09:50:05,024 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-02-02 09:50:05,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 09:50:05,024 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:05,024 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2018-02-02 09:50:05,025 INFO L371 AbstractCegarLoop]: === Iteration 42 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:50:05,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1566058808, now seen corresponding path program 7 times [2018-02-02 09:50:05,025 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:05,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:05,488 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 09:50:05,489 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:05,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 09:50:05,489 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:05,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:05,489 INFO L182 omatonBuilderFactory]: Interpolants [6986#true, 6987#false, 6988#(= (select |#valid| |main_#t~malloc10.base|) 1), 6989#(= (select |#valid| main_~nondetString1~0.base) 1), 6990#(and (= main_~length~0 (select |#length| |main_#t~malloc11.base|)) (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 6991#(and (= main_~nondetString2~0.offset 0) (= main_~length~0 (select |#length| main_~nondetString2~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 6992#(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))))) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 6993#(and (not (= |cstrlcpy_#in~dst.base| |cstrlcpy_#in~src.base|)) (= 0 (select (select |#memory_int| |cstrlcpy_#in~src.base|) (+ (select |#length| |cstrlcpy_#in~src.base|) (- 1))))), 6994#(and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ (select |#length| cstrlcpy_~s~0.base) (- 1))))), 6995#(and (= |cstrlcpy_#t~post2.base| cstrlcpy_~s~0.base) (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select |#memory_int| |cstrlcpy_#t~post2.base|) (+ (select |#length| cstrlcpy_~s~0.base) (- 1)))) (not (= |cstrlcpy_#t~post2.base| |cstrlcpy_#t~post1.base|))), 6996#(and (not (= cstrlcpy_~d~0.base cstrlcpy_~s~0.base)) (= 0 (select (select (store |#memory_int| |cstrlcpy_#t~post1.base| (store (select |#memory_int| |cstrlcpy_#t~post1.base|) |cstrlcpy_#t~post1.offset| |cstrlcpy_#t~mem4|)) cstrlcpy_~s~0.base) (+ (select |#length| cstrlcpy_~s~0.base) (- 1))))), 6997#(= 0 (select (select (store |#memory_int| cstrlcpy_~d~0.base (store (select |#memory_int| cstrlcpy_~d~0.base) cstrlcpy_~d~0.offset 0)) cstrlcpy_~s~0.base) (+ (select |#length| cstrlcpy_~s~0.base) (- 1)))), 6998#(= 0 (select (select |#memory_int| cstrlcpy_~s~0.base) (+ (select |#length| cstrlcpy_~s~0.base) (- 1)))), 6999#(and (= |cstrlcpy_#t~post6.base| cstrlcpy_~s~0.base) (= 0 (select (select |#memory_int| |cstrlcpy_#t~post6.base|) (+ (select |#length| cstrlcpy_~s~0.base) (- 1))))), 7000#(and (<= (+ |cstrlcpy_#t~post6.offset| 1) cstrlcpy_~s~0.offset) (or (= 0 (select (select |#memory_int| |cstrlcpy_#t~post6.base|) |cstrlcpy_#t~post6.offset|)) (<= (select |#length| |cstrlcpy_#t~post6.base|) |cstrlcpy_#t~post6.offset|) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base)))), 7001#(and (<= 1 cstrlcpy_~s~0.offset) (or (= |cstrlcpy_#t~mem7| 0) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base)))), 7002#(and (<= 1 cstrlcpy_~s~0.offset) (<= (+ cstrlcpy_~s~0.offset 1) (select |#length| cstrlcpy_~s~0.base))), 7003#(and (<= 1 |cstrlcpy_#t~post6.offset|) (<= (+ |cstrlcpy_#t~post6.offset| 1) (select |#length| |cstrlcpy_#t~post6.base|)))] [2018-02-02 09:50:05,490 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 09:50:05,490 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 09:50:05,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 09:50:05,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:50:05,490 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 18 states. [2018-02-02 09:50:05,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:05,732 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-02-02 09:50:05,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 09:50:05,732 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2018-02-02 09:50:05,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:05,732 INFO L225 Difference]: With dead ends: 76 [2018-02-02 09:50:05,732 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 09:50:05,732 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2018-02-02 09:50:05,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 09:50:05,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 09:50:05,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 09:50:05,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 09:50:05,733 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2018-02-02 09:50:05,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:05,733 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 09:50:05,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 09:50:05,733 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 09:50:05,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 09:50:05,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:50:05 BoogieIcfgContainer [2018-02-02 09:50:05,736 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:50:05,737 INFO L168 Benchmark]: Toolchain (without parser) took 20031.13 ms. Allocated memory was 394.3 MB in the beginning and 996.7 MB in the end (delta: 602.4 MB). Free memory was 352.3 MB in the beginning and 709.5 MB in the end (delta: -357.2 MB). Peak memory consumption was 245.2 MB. Max. memory is 5.3 GB. [2018-02-02 09:50:05,738 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 394.3 MB. Free memory is still 357.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:50:05,738 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.45 ms. Allocated memory is still 394.3 MB. Free memory was 351.0 MB in the beginning and 340.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:50:05,738 INFO L168 Benchmark]: Boogie Preprocessor took 22.47 ms. Allocated memory is still 394.3 MB. Free memory was 340.4 MB in the beginning and 339.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 09:50:05,738 INFO L168 Benchmark]: RCFGBuilder took 182.46 ms. Allocated memory is still 394.3 MB. Free memory was 339.1 MB in the beginning and 317.8 MB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 5.3 GB. [2018-02-02 09:50:05,738 INFO L168 Benchmark]: TraceAbstraction took 19663.50 ms. Allocated memory was 394.3 MB in the beginning and 996.7 MB in the end (delta: 602.4 MB). Free memory was 317.8 MB in the beginning and 709.5 MB in the end (delta: -391.7 MB). Peak memory consumption was 210.7 MB. Max. memory is 5.3 GB. [2018-02-02 09:50:05,739 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 394.3 MB. Free memory is still 357.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 160.45 ms. Allocated memory is still 394.3 MB. Free memory was 351.0 MB in the beginning and 340.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.47 ms. Allocated memory is still 394.3 MB. Free memory was 340.4 MB in the beginning and 339.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 182.46 ms. Allocated memory is still 394.3 MB. Free memory was 339.1 MB in the beginning and 317.8 MB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 19663.50 ms. Allocated memory was 394.3 MB in the beginning and 996.7 MB in the end (delta: 602.4 MB). Free memory was 317.8 MB in the beginning and 709.5 MB in the end (delta: -391.7 MB). Peak memory consumption was 210.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 55 locations, 13 error locations. SAFE Result, 19.6s OverallTime, 42 OverallIterations, 4 TraceHistogramMax, 10.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1405 SDtfs, 2323 SDslu, 7843 SDs, 0 SdLazy, 8648 SolverSat, 509 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 793 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 726 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2757 ImplicationChecksByTransitivity, 11.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 48/361 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 42 MinimizatonAttempts, 352 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 1274 NumberOfCodeBlocks, 1274 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1232 ConstructedInterpolants, 0 QuantifiedInterpolants, 575057 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 20 PerfectInterpolantSequences, 48/361 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-50-05-743.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-50-05-743.csv Received shutdown request...