java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 19:53:44,204 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 19:53:44,205 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 19:53:44,215 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 19:53:44,215 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 19:53:44,216 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 19:53:44,217 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 19:53:44,218 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 19:53:44,219 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 19:53:44,220 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 19:53:44,221 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 19:53:44,221 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 19:53:44,222 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 19:53:44,223 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 19:53:44,224 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 19:53:44,226 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 19:53:44,227 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 19:53:44,229 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 19:53:44,230 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 19:53:44,231 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 19:53:44,232 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 19:53:44,233 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 19:53:44,233 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 19:53:44,234 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 19:53:44,234 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 19:53:44,235 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 19:53:44,236 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 19:53:44,236 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 19:53:44,236 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 19:53:44,237 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 19:53:44,237 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 19:53:44,237 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 19:53:44,247 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 19:53:44,247 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 19:53:44,248 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 19:53:44,248 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 19:53:44,248 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 19:53:44,248 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 19:53:44,249 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 19:53:44,249 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 19:53:44,249 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 19:53:44,249 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 19:53:44,249 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 19:53:44,249 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 19:53:44,249 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 19:53:44,250 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 19:53:44,250 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 19:53:44,250 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 19:53:44,250 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 19:53:44,250 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 19:53:44,250 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 19:53:44,251 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 19:53:44,251 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:53:44,251 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 19:53:44,251 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 19:53:44,282 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 19:53:44,293 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 19:53:44,296 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 19:53:44,297 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 19:53:44,298 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 19:53:44,298 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 19:53:44,421 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 19:53:44,422 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 19:53:44,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 19:53:44,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 19:53:44,426 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 19:53:44,427 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:53:44" (1/1) ... [2018-02-02 19:53:44,429 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@309783a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:53:44, skipping insertion in model container [2018-02-02 19:53:44,429 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:53:44" (1/1) ... [2018-02-02 19:53:44,438 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:53:44,465 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:53:44,557 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:53:44,574 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:53:44,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:53:44 WrapperNode [2018-02-02 19:53:44,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 19:53:44,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 19:53:44,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 19:53:44,580 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 19:53:44,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:53:44" (1/1) ... [2018-02-02 19:53:44,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:53:44" (1/1) ... [2018-02-02 19:53:44,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:53:44" (1/1) ... [2018-02-02 19:53:44,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:53:44" (1/1) ... [2018-02-02 19:53:44,598 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:53:44" (1/1) ... [2018-02-02 19:53:44,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:53:44" (1/1) ... [2018-02-02 19:53:44,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:53:44" (1/1) ... [2018-02-02 19:53:44,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 19:53:44,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 19:53:44,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 19:53:44,604 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 19:53:44,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:53:44" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:53:44,641 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 19:53:44,641 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 19:53:44,641 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlcpy [2018-02-02 19:53:44,641 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 19:53:44,642 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 19:53:44,642 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 19:53:44,642 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 19:53:44,642 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 19:53:44,642 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 19:53:44,642 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 19:53:44,642 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlcpy [2018-02-02 19:53:44,642 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 19:53:44,642 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 19:53:44,642 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 19:53:44,827 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 19:53:44,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:53:44 BoogieIcfgContainer [2018-02-02 19:53:44,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 19:53:44,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 19:53:44,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 19:53:44,830 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 19:53:44,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 07:53:44" (1/3) ... [2018-02-02 19:53:44,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fec6cdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:53:44, skipping insertion in model container [2018-02-02 19:53:44,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:53:44" (2/3) ... [2018-02-02 19:53:44,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fec6cdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:53:44, skipping insertion in model container [2018-02-02 19:53:44,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:53:44" (3/3) ... [2018-02-02 19:53:44,833 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-02-02 19:53:44,839 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 19:53:44,844 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-02 19:53:44,874 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 19:53:44,874 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 19:53:44,874 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 19:53:44,875 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 19:53:44,875 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 19:53:44,875 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 19:53:44,875 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 19:53:44,875 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 19:53:44,875 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 19:53:44,884 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-02-02 19:53:44,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 19:53:44,891 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:44,892 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:53:44,892 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:44,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1536619982, now seen corresponding path program 1 times [2018-02-02 19:53:44,931 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:44,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:45,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:53:45,080 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:53:45,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:53:45,081 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:45,081 INFO 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 19:53:45,081 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 19:53:45,081 INFO 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 19:53:45,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:53:45,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:53:45,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:53:45,092 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 4 states. [2018-02-02 19:53:45,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:45,203 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-02-02 19:53:45,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 19:53:45,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 19:53:45,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:45,210 INFO L225 Difference]: With dead ends: 54 [2018-02-02 19:53:45,210 INFO L226 Difference]: Without dead ends: 51 [2018-02-02 19:53:45,211 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 19:53:45,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-02 19:53:45,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-02 19:53:45,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 19:53:45,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-02-02 19:53:45,236 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 13 [2018-02-02 19:53:45,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:45,236 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-02-02 19:53:45,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:53:45,236 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-02-02 19:53:45,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 19:53:45,237 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:45,237 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:53:45,237 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:45,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1536619983, now seen corresponding path program 1 times [2018-02-02 19:53:45,238 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:45,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:45,325 INFO 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 19:53:45,325 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:53:45,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:53:45,325 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:45,325 INFO 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 19:53:45,326 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 19:53:45,326 INFO 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 19:53:45,327 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:53:45,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:53:45,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:53:45,328 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2018-02-02 19:53:45,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:45,372 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-02-02 19:53:45,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:53:45,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-02 19:53:45,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:45,373 INFO L225 Difference]: With dead ends: 50 [2018-02-02 19:53:45,373 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 19:53:45,374 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 19:53:45,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 19:53:45,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-02 19:53:45,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 19:53:45,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-02-02 19:53:45,377 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 13 [2018-02-02 19:53:45,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:45,377 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-02-02 19:53:45,377 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:53:45,377 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-02-02 19:53:45,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 19:53:45,377 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:45,377 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:53:45,377 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:45,378 INFO L82 PathProgramCache]: Analyzing trace with hash 390579246, now seen corresponding path program 1 times [2018-02-02 19:53:45,378 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:45,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:45,423 INFO 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 19:53:45,424 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:53:45,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:53:45,424 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:53:45,425 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 19:53:45,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:53:45,425 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:53:45,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:53:45,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:53:45,426 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 4 states. [2018-02-02 19:53:45,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:45,474 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-02-02 19:53:45,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 19:53:45,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 19:53:45,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:45,475 INFO L225 Difference]: With dead ends: 49 [2018-02-02 19:53:45,475 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 19:53:45,475 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 19:53:45,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 19:53:45,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-02 19:53:45,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 19:53:45,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-02-02 19:53:45,480 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 14 [2018-02-02 19:53:45,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:45,480 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-02-02 19:53:45,480 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:53:45,480 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-02-02 19:53:45,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 19:53:45,481 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:45,481 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:53:45,481 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:45,481 INFO L82 PathProgramCache]: Analyzing trace with hash 390579247, now seen corresponding path program 1 times [2018-02-02 19:53:45,482 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:45,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:45,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:53:45,546 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:53:45,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 19:53:45,546 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:45,546 INFO 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 19:53:45,547 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 19:53:45,547 INFO 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 19:53:45,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:53:45,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:53:45,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:53:45,548 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 5 states. [2018-02-02 19:53:45,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:45,599 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-02-02 19:53:45,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:53:45,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 19:53:45,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:45,600 INFO L225 Difference]: With dead ends: 48 [2018-02-02 19:53:45,601 INFO L226 Difference]: Without dead ends: 48 [2018-02-02 19:53:45,601 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 19:53:45,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-02 19:53:45,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-02 19:53:45,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-02 19:53:45,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-02-02 19:53:45,604 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 14 [2018-02-02 19:53:45,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:45,605 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-02-02 19:53:45,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:53:45,605 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-02-02 19:53:45,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 19:53:45,605 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:45,605 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 19:53:45,606 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:45,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1961349366, now seen corresponding path program 1 times [2018-02-02 19:53:45,607 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:45,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:45,647 INFO 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 19:53:45,647 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:53:45,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 19:53:45,648 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:45,648 INFO 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 19:53:45,648 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 19:53:45,648 INFO 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 19:53:45,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:53:45,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:53:45,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:53:45,649 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 5 states. [2018-02-02 19:53:45,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:45,695 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-02-02 19:53:45,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:53:45,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-02 19:53:45,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:45,696 INFO L225 Difference]: With dead ends: 47 [2018-02-02 19:53:45,696 INFO L226 Difference]: Without dead ends: 47 [2018-02-02 19:53:45,696 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 19:53:45,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-02 19:53:45,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-02 19:53:45,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-02 19:53:45,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-02-02 19:53:45,700 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 20 [2018-02-02 19:53:45,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:45,700 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-02-02 19:53:45,700 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:53:45,700 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-02-02 19:53:45,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 19:53:45,700 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:45,701 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 19:53:45,701 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:45,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1961349365, now seen corresponding path program 1 times [2018-02-02 19:53:45,701 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:45,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:45,798 INFO 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 19:53:45,798 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:53:45,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 19:53:45,799 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:45,799 INFO 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 19:53:45,799 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 19:53:45,799 INFO 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 19:53:45,799 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:53:45,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:53:45,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:53:45,800 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 8 states. [2018-02-02 19:53:45,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:45,881 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-02-02 19:53:45,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 19:53:45,881 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-02 19:53:45,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:45,883 INFO L225 Difference]: With dead ends: 62 [2018-02-02 19:53:45,883 INFO L226 Difference]: Without dead ends: 62 [2018-02-02 19:53:45,884 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 19:53:45,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-02 19:53:45,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2018-02-02 19:53:45,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 19:53:45,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-02-02 19:53:45,888 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 20 [2018-02-02 19:53:45,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:45,888 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-02-02 19:53:45,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:53:45,888 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-02-02 19:53:45,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 19:53:45,889 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:45,889 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 19:53:45,889 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:45,889 INFO L82 PathProgramCache]: Analyzing trace with hash -698055293, now seen corresponding path program 1 times [2018-02-02 19:53:45,890 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:45,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:45,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:53:45,929 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:53:45,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:53:45,929 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:45,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:53:45,930 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 19:53:45,930 INFO 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 19:53:45,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:53:45,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:53:45,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:53:45,930 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-02-02 19:53:45,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:45,988 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-02-02 19:53:45,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:53:45,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-02-02 19:53:45,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:45,990 INFO L225 Difference]: With dead ends: 52 [2018-02-02 19:53:45,990 INFO L226 Difference]: Without dead ends: 52 [2018-02-02 19:53:45,990 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 19:53:45,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-02 19:53:45,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-02 19:53:45,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 19:53:45,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-02-02 19:53:45,992 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 21 [2018-02-02 19:53:45,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:45,993 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-02-02 19:53:45,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:53:45,993 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-02-02 19:53:45,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 19:53:45,993 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:45,993 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 19:53:45,993 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:45,993 INFO L82 PathProgramCache]: Analyzing trace with hash -698055292, now seen corresponding path program 1 times [2018-02-02 19:53:45,994 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:46,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:46,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:53:46,086 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:53:46,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 19:53:46,086 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:46,086 INFO 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 19:53:46,086 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 19:53:46,086 INFO 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 19:53:46,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 19:53:46,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 19:53:46,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:53:46,087 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-02-02 19:53:46,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:46,177 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-02-02 19:53:46,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 19:53:46,177 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-02-02 19:53:46,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:46,178 INFO L225 Difference]: With dead ends: 62 [2018-02-02 19:53:46,178 INFO L226 Difference]: Without dead ends: 62 [2018-02-02 19:53:46,179 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 19:53:46,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-02 19:53:46,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2018-02-02 19:53:46,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 19:53:46,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-02-02 19:53:46,182 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 21 [2018-02-02 19:53:46,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:46,182 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-02-02 19:53:46,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 19:53:46,182 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-02-02 19:53:46,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 19:53:46,183 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:46,183 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 19:53:46,183 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:46,183 INFO L82 PathProgramCache]: Analyzing trace with hash -164877615, now seen corresponding path program 1 times [2018-02-02 19:53:46,184 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:46,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:46,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:53:46,226 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:53:46,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:53:46,226 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:46,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:53:46,227 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 19:53:46,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:53:46,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:53:46,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:53:46,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:53:46,227 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-02-02 19:53:46,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:46,281 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-02-02 19:53:46,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:53:46,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-02 19:53:46,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:46,282 INFO L225 Difference]: With dead ends: 52 [2018-02-02 19:53:46,283 INFO L226 Difference]: Without dead ends: 52 [2018-02-02 19:53:46,283 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 19:53:46,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-02 19:53:46,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-02 19:53:46,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 19:53:46,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-02-02 19:53:46,285 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 22 [2018-02-02 19:53:46,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:46,286 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-02-02 19:53:46,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:53:46,286 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-02-02 19:53:46,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 19:53:46,286 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:46,286 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 19:53:46,286 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:46,287 INFO L82 PathProgramCache]: Analyzing trace with hash -164877614, now seen corresponding path program 1 times [2018-02-02 19:53:46,287 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:46,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:46,361 INFO 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 19:53:46,361 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:53:46,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 19:53:46,362 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:46,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:53:46,362 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 19:53:46,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:53:46,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 19:53:46,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 19:53:46,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:53:46,363 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-02-02 19:53:46,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:46,483 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2018-02-02 19:53:46,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:53:46,484 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-02 19:53:46,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:46,484 INFO L225 Difference]: With dead ends: 63 [2018-02-02 19:53:46,485 INFO L226 Difference]: Without dead ends: 63 [2018-02-02 19:53:46,485 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 19:53:46,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-02 19:53:46,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2018-02-02 19:53:46,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 19:53:46,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-02-02 19:53:46,488 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 22 [2018-02-02 19:53:46,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:46,488 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-02-02 19:53:46,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 19:53:46,489 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-02-02 19:53:46,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 19:53:46,489 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:46,489 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 19:53:46,489 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:46,489 INFO L82 PathProgramCache]: Analyzing trace with hash 634059438, now seen corresponding path program 1 times [2018-02-02 19:53:46,490 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:46,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:46,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:53:46,538 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:53:46,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:53:46,538 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:46,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:53:46,538 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 19:53:46,539 INFO 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 19:53:46,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:53:46,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:53:46,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:53:46,539 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-02-02 19:53:46,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:46,586 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-02-02 19:53:46,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:53:46,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-02 19:53:46,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:46,587 INFO L225 Difference]: With dead ends: 52 [2018-02-02 19:53:46,587 INFO L226 Difference]: Without dead ends: 52 [2018-02-02 19:53:46,587 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 19:53:46,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-02 19:53:46,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-02 19:53:46,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 19:53:46,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-02-02 19:53:46,589 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 22 [2018-02-02 19:53:46,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:46,589 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-02-02 19:53:46,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:53:46,589 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-02-02 19:53:46,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 19:53:46,589 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:46,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] [2018-02-02 19:53:46,589 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:46,590 INFO L82 PathProgramCache]: Analyzing trace with hash 634059439, now seen corresponding path program 1 times [2018-02-02 19:53:46,590 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:46,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:46,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:53:46,654 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:53:46,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 19:53:46,655 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:46,655 INFO 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 19:53:46,655 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 19:53:46,655 INFO 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 19:53:46,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 19:53:46,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 19:53:46,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:53:46,655 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-02-02 19:53:46,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:46,737 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-02-02 19:53:46,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 19:53:46,737 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-02 19:53:46,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:46,738 INFO L225 Difference]: With dead ends: 59 [2018-02-02 19:53:46,738 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 19:53:46,738 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 19:53:46,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 19:53:46,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-02-02 19:53:46,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 19:53:46,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2018-02-02 19:53:46,740 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 22 [2018-02-02 19:53:46,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:46,740 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2018-02-02 19:53:46,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 19:53:46,740 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2018-02-02 19:53:46,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 19:53:46,740 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:46,740 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 19:53:46,740 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:46,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1535458206, now seen corresponding path program 1 times [2018-02-02 19:53:46,741 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:46,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:46,905 INFO 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 19:53:46,905 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:53:46,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 19:53:46,905 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:46,905 INFO 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 19:53:46,906 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 19:53:46,906 INFO 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 19:53:46,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 19:53:46,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 19:53:46,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-02 19:53:46,906 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 12 states. [2018-02-02 19:53:47,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:47,152 INFO L93 Difference]: Finished difference Result 132 states and 159 transitions. [2018-02-02 19:53:47,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 19:53:47,153 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-02-02 19:53:47,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:47,154 INFO L225 Difference]: With dead ends: 132 [2018-02-02 19:53:47,154 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 19:53:47,154 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 19:53:47,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 19:53:47,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 99. [2018-02-02 19:53:47,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 19:53:47,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 127 transitions. [2018-02-02 19:53:47,159 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 127 transitions. Word has length 26 [2018-02-02 19:53:47,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:47,159 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 127 transitions. [2018-02-02 19:53:47,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 19:53:47,159 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 127 transitions. [2018-02-02 19:53:47,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 19:53:47,160 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:47,160 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 19:53:47,163 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:47,163 INFO L82 PathProgramCache]: Analyzing trace with hash -44170330, now seen corresponding path program 1 times [2018-02-02 19:53:47,164 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:47,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:47,218 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 19:53:47,218 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:53:47,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:53:47,218 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:47,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 19:53:47,219 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 19:53:47,219 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 19:53:47,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:53:47,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:53:47,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:53:47,219 INFO L87 Difference]: Start difference. First operand 99 states and 127 transitions. Second operand 6 states. [2018-02-02 19:53:47,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:47,247 INFO L93 Difference]: Finished difference Result 99 states and 125 transitions. [2018-02-02 19:53:47,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:53:47,247 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-02 19:53:47,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:47,251 INFO L225 Difference]: With dead ends: 99 [2018-02-02 19:53:47,252 INFO L226 Difference]: Without dead ends: 99 [2018-02-02 19:53:47,252 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 19:53:47,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-02 19:53:47,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-02-02 19:53:47,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 19:53:47,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 125 transitions. [2018-02-02 19:53:47,256 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 125 transitions. Word has length 26 [2018-02-02 19:53:47,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:47,256 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 125 transitions. [2018-02-02 19:53:47,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:53:47,256 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 125 transitions. [2018-02-02 19:53:47,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 19:53:47,257 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:47,257 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 19:53:47,257 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:47,257 INFO L82 PathProgramCache]: Analyzing trace with hash 717809756, now seen corresponding path program 1 times [2018-02-02 19:53:47,258 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:47,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:47,404 INFO 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 19:53:47,404 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:53:47,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 19:53:47,405 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:47,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:53:47,405 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 19:53:47,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:53:47,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 19:53:47,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 19:53:47,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-02 19:53:47,406 INFO L87 Difference]: Start difference. First operand 99 states and 125 transitions. Second operand 11 states. [2018-02-02 19:53:47,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:47,561 INFO L93 Difference]: Finished difference Result 121 states and 154 transitions. [2018-02-02 19:53:47,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 19:53:47,561 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-02-02 19:53:47,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:47,562 INFO L225 Difference]: With dead ends: 121 [2018-02-02 19:53:47,562 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 19:53:47,562 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 19:53:47,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 19:53:47,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 62. [2018-02-02 19:53:47,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-02 19:53:47,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2018-02-02 19:53:47,565 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 26 [2018-02-02 19:53:47,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:47,565 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2018-02-02 19:53:47,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 19:53:47,565 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2018-02-02 19:53:47,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 19:53:47,566 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:47,566 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 19:53:47,566 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:47,566 INFO L82 PathProgramCache]: Analyzing trace with hash 355579118, now seen corresponding path program 1 times [2018-02-02 19:53:47,567 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53: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 19:53:47,695 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 19:53:47,696 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:53:47,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 19:53:47,696 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:47,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:53:47,696 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 19:53:47,696 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 19:53:47,696 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:53:47,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:53:47,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:53:47,697 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand 10 states. [2018-02-02 19:53:47,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:47,802 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2018-02-02 19:53:47,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 19:53:47,802 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-02-02 19:53:47,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:47,803 INFO L225 Difference]: With dead ends: 105 [2018-02-02 19:53:47,803 INFO L226 Difference]: Without dead ends: 105 [2018-02-02 19:53:47,803 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:53:47,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-02 19:53:47,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 94. [2018-02-02 19:53:47,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 19:53:47,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 115 transitions. [2018-02-02 19:53:47,806 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 115 transitions. Word has length 27 [2018-02-02 19:53:47,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:47,806 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 115 transitions. [2018-02-02 19:53:47,806 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:53:47,806 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2018-02-02 19:53:47,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 19:53:47,807 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:47,807 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 19:53:47,807 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:47,808 INFO L82 PathProgramCache]: Analyzing trace with hash 778280944, now seen corresponding path program 1 times [2018-02-02 19:53:47,808 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:47,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:47,970 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 19:53:47,970 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:53:47,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 19:53:47,970 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:47,970 INFO 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 19:53:47,971 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 19:53:47,971 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 19:53:47,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 19:53:47,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 19:53:47,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-02 19:53:47,971 INFO L87 Difference]: Start difference. First operand 94 states and 115 transitions. Second operand 12 states. [2018-02-02 19:53:48,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:48,206 INFO L93 Difference]: Finished difference Result 134 states and 160 transitions. [2018-02-02 19:53:48,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 19:53:48,206 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-02-02 19:53:48,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:48,207 INFO L225 Difference]: With dead ends: 134 [2018-02-02 19:53:48,207 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 19:53:48,207 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 19:53:48,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 19:53:48,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 95. [2018-02-02 19:53:48,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 19:53:48,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2018-02-02 19:53:48,209 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 27 [2018-02-02 19:53:48,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:48,209 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2018-02-02 19:53:48,209 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 19:53:48,209 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2018-02-02 19:53:48,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 19:53:48,210 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:48,210 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 19:53:48,210 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:48,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1893257598, now seen corresponding path program 1 times [2018-02-02 19:53:48,210 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:48,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:48,259 INFO 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 19:53:48,259 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:53:48,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:53:48,260 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:48,260 INFO 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 19:53:48,260 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 19:53:48,260 INFO 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 19:53:48,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:53:48,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:53:48,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:53:48,261 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 5 states. [2018-02-02 19:53:48,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:48,271 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2018-02-02 19:53:48,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:53:48,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-02 19:53:48,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:48,272 INFO L225 Difference]: With dead ends: 95 [2018-02-02 19:53:48,272 INFO L226 Difference]: Without dead ends: 95 [2018-02-02 19:53:48,273 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 19:53:48,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-02 19:53:48,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-02-02 19:53:48,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 19:53:48,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2018-02-02 19:53:48,275 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 28 [2018-02-02 19:53:48,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:48,276 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2018-02-02 19:53:48,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:53:48,276 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2018-02-02 19:53:48,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 19:53:48,276 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:48,277 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 19:53:48,277 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:48,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1643094554, now seen corresponding path program 1 times [2018-02-02 19:53:48,278 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:48,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:48,416 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 19:53:48,416 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:53:48,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 19:53:48,416 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:48,416 INFO 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 19:53:48,416 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 19:53:48,417 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 19:53:48,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 19:53:48,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 19:53:48,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-02 19:53:48,417 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand 12 states. [2018-02-02 19:53:48,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:48,557 INFO L93 Difference]: Finished difference Result 112 states and 132 transitions. [2018-02-02 19:53:48,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 19:53:48,557 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-02-02 19:53:48,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:48,557 INFO L225 Difference]: With dead ends: 112 [2018-02-02 19:53:48,558 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 19:53:48,558 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 19:53:48,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 19:53:48,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2018-02-02 19:53:48,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 19:53:48,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2018-02-02 19:53:48,561 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 28 [2018-02-02 19:53:48,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:48,561 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2018-02-02 19:53:48,561 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 19:53:48,561 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2018-02-02 19:53:48,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 19:53:48,562 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:48,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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:53:48,562 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:48,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1433698709, now seen corresponding path program 1 times [2018-02-02 19:53:48,563 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:48,572 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:48,707 INFO 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 19:53:48,707 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:53:48,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 19:53:48,707 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:48,707 INFO 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 19:53:48,707 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 19:53:48,707 INFO 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 19:53:48,708 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 19:53:48,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 19:53:48,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-02-02 19:53:48,708 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand 12 states. [2018-02-02 19:53:48,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:48,873 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2018-02-02 19:53:48,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 19:53:48,873 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-02-02 19:53:48,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:48,874 INFO L225 Difference]: With dead ends: 113 [2018-02-02 19:53:48,874 INFO L226 Difference]: Without dead ends: 109 [2018-02-02 19:53:48,874 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 19:53:48,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-02 19:53:48,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 95. [2018-02-02 19:53:48,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 19:53:48,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2018-02-02 19:53:48,877 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 29 [2018-02-02 19:53:48,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:48,877 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2018-02-02 19:53:48,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 19:53:48,877 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2018-02-02 19:53:48,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 19:53:48,878 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:48,878 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 19:53:48,878 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:48,878 INFO L82 PathProgramCache]: Analyzing trace with hash -163894416, now seen corresponding path program 1 times [2018-02-02 19:53:48,879 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:48,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:48,983 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 19:53:48,984 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:53:48,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 19:53:48,984 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:48,984 INFO 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 19:53:48,984 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 19:53:48,984 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 19:53:48,984 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 19:53:48,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 19:53:48,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-02 19:53:48,984 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand 13 states. [2018-02-02 19:53:49,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:49,145 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2018-02-02 19:53:49,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 19:53:49,145 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-02-02 19:53:49,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:49,145 INFO L225 Difference]: With dead ends: 112 [2018-02-02 19:53:49,145 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 19:53:49,146 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2018-02-02 19:53:49,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 19:53:49,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 92. [2018-02-02 19:53:49,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-02 19:53:49,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2018-02-02 19:53:49,147 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 30 [2018-02-02 19:53:49,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:49,147 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2018-02-02 19:53:49,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 19:53:49,147 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2018-02-02 19:53:49,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 19:53:49,148 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:49,148 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 19:53:49,148 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:49,148 INFO L82 PathProgramCache]: Analyzing trace with hash 215739387, now seen corresponding path program 1 times [2018-02-02 19:53:49,148 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:49,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:49,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:53:49,192 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:53:49,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:53:49,192 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:49,193 INFO 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 19:53:49,193 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 19:53:49,193 INFO 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 19:53:49,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:53:49,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:53:49,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:53:49,193 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand 6 states. [2018-02-02 19:53:49,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:49,308 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2018-02-02 19:53:49,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:53:49,308 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-02 19:53:49,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:49,309 INFO L225 Difference]: With dead ends: 91 [2018-02-02 19:53:49,309 INFO L226 Difference]: Without dead ends: 54 [2018-02-02 19:53:49,309 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 19:53:49,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-02 19:53:49,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-02 19:53:49,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 19:53:49,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-02-02 19:53:49,311 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 30 [2018-02-02 19:53:49,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:49,311 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-02-02 19:53:49,311 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:53:49,311 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-02-02 19:53:49,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 19:53:49,311 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:49,311 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 19:53:49,312 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:49,312 INFO L82 PathProgramCache]: Analyzing trace with hash -297907922, now seen corresponding path program 1 times [2018-02-02 19:53:49,312 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:49,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:49,533 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 19:53:49,534 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:53:49,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 19:53:49,534 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:49,534 INFO 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 19:53:49,534 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 19:53:49,534 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 19:53:49,535 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 19:53:49,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 19:53:49,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-02 19:53:49,535 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 15 states. [2018-02-02 19:53:49,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:49,755 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-02-02 19:53:49,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 19:53:49,755 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2018-02-02 19:53:49,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:49,756 INFO L225 Difference]: With dead ends: 64 [2018-02-02 19:53:49,756 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 19:53:49,756 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2018-02-02 19:53:49,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 19:53:49,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2018-02-02 19:53:49,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-02 19:53:49,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-02-02 19:53:49,757 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 30 [2018-02-02 19:53:49,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:49,757 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-02-02 19:53:49,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 19:53:49,757 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2018-02-02 19:53:49,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 19:53:49,758 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:49,758 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 19:53:49,758 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:49,758 INFO L82 PathProgramCache]: Analyzing trace with hash -119267187, now seen corresponding path program 1 times [2018-02-02 19:53:49,758 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:49,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:49,870 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 19:53:49,871 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:53:49,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 19:53:49,871 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:49,871 INFO 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 19:53:49,871 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 19:53:49,871 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 19:53:49,871 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 19:53:49,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 19:53:49,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-02 19:53:49,872 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 12 states. [2018-02-02 19:53:50,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:50,033 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-02-02 19:53:50,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 19:53:50,033 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-02-02 19:53:50,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:50,033 INFO L225 Difference]: With dead ends: 67 [2018-02-02 19:53:50,034 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 19:53:50,034 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 19:53:50,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 19:53:50,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2018-02-02 19:53:50,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-02 19:53:50,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-02-02 19:53:50,035 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 32 [2018-02-02 19:53:50,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:50,035 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-02-02 19:53:50,035 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 19:53:50,035 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2018-02-02 19:53:50,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 19:53:50,035 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:50,035 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 19:53:50,036 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:50,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1093780658, now seen corresponding path program 1 times [2018-02-02 19:53:50,036 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:50,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:50,185 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 19:53:50,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:53:50,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 19:53:50,185 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:50,185 INFO 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 19:53:50,185 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 19:53:50,185 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 19:53:50,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 19:53:50,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 19:53:50,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-02 19:53:50,186 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 13 states. [2018-02-02 19:53:50,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:50,467 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2018-02-02 19:53:50,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 19:53:50,468 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-02-02 19:53:50,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:50,468 INFO L225 Difference]: With dead ends: 78 [2018-02-02 19:53:50,468 INFO L226 Difference]: Without dead ends: 78 [2018-02-02 19:53:50,469 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 19:53:50,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-02 19:53:50,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2018-02-02 19:53:50,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-02 19:53:50,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2018-02-02 19:53:50,470 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 32 [2018-02-02 19:53:50,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:50,471 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-02-02 19:53:50,471 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 19:53:50,471 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-02-02 19:53:50,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 19:53:50,471 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:50,471 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 19:53:50,471 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:50,472 INFO L82 PathProgramCache]: Analyzing trace with hash -451522982, now seen corresponding path program 2 times [2018-02-02 19:53:50,472 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:50,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:50,848 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 19:53:50,848 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:53:50,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 19:53:50,849 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:50,849 INFO 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 19:53:50,849 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 19:53:50,849 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 19:53:50,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 19:53:50,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 19:53:50,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:53:50,850 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 16 states. [2018-02-02 19:53:51,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:51,255 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2018-02-02 19:53:51,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 19:53:51,255 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-02-02 19:53:51,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:51,255 INFO L225 Difference]: With dead ends: 82 [2018-02-02 19:53:51,256 INFO L226 Difference]: Without dead ends: 82 [2018-02-02 19:53:51,256 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2018-02-02 19:53:51,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-02 19:53:51,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 66. [2018-02-02 19:53:51,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-02 19:53:51,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-02-02 19:53:51,257 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 33 [2018-02-02 19:53:51,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:51,257 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-02-02 19:53:51,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 19:53:51,258 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-02-02 19:53:51,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 19:53:51,258 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:51,258 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 19:53:51,258 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:51,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1502086491, now seen corresponding path program 2 times [2018-02-02 19:53:51,259 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:51,279 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:51,499 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 7 DAG size of output 3 [2018-02-02 19:53:51,731 WARN L146 SmtUtils]: Spent 183ms on a formula simplification. DAG size of input: 20 DAG size of output 6 [2018-02-02 19:53:52,048 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 19:53:52,048 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:53:52,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 19:53:52,049 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:52,049 INFO 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 19:53:52,049 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 19:53:52,049 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 19:53:52,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 19:53:52,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 19:53:52,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-02-02 19:53:52,050 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 20 states. [2018-02-02 19:53:52,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:52,425 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-02-02 19:53:52,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 19:53:52,425 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2018-02-02 19:53:52,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:52,426 INFO L225 Difference]: With dead ends: 79 [2018-02-02 19:53:52,426 INFO L226 Difference]: Without dead ends: 79 [2018-02-02 19:53:52,426 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=150, Invalid=972, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 19:53:52,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-02 19:53:52,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2018-02-02 19:53:52,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-02 19:53:52,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-02-02 19:53:52,428 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 34 [2018-02-02 19:53:52,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:52,428 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-02-02 19:53:52,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 19:53:52,428 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-02-02 19:53:52,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 19:53:52,429 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:52,429 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 19:53:52,429 INFO L371 AbstractCegarLoop]: === Iteration 28 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:52,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1112310596, now seen corresponding path program 2 times [2018-02-02 19:53:52,430 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:52,439 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:52,672 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 19:53:52,672 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:53:52,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 19:53:52,672 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:52,672 INFO 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 19:53:52,672 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 19:53:52,672 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 19:53:52,673 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 19:53:52,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 19:53:52,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:53:52,673 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 14 states. [2018-02-02 19:53:52,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:52,931 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-02-02 19:53:52,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 19:53:52,931 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-02-02 19:53:52,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:52,932 INFO L225 Difference]: With dead ends: 85 [2018-02-02 19:53:52,932 INFO L226 Difference]: Without dead ends: 85 [2018-02-02 19:53:52,932 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-02-02 19:53:52,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-02 19:53:52,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 71. [2018-02-02 19:53:52,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-02 19:53:52,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2018-02-02 19:53:52,933 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 34 [2018-02-02 19:53:52,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:52,933 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2018-02-02 19:53:52,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 19:53:52,934 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2018-02-02 19:53:52,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 19:53:52,934 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:52,934 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 19:53:52,934 INFO L371 AbstractCegarLoop]: === Iteration 29 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:52,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1097306111, now seen corresponding path program 1 times [2018-02-02 19:53:52,935 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:52,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:53,095 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 19:53:53,096 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:53:53,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 19:53:53,096 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:53,096 INFO 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 19:53:53,096 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 19:53:53,096 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 19:53:53,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 19:53:53,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 19:53:53,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:53:53,097 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 14 states. [2018-02-02 19:53:53,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:53,270 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-02-02 19:53:53,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 19:53:53,271 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-02-02 19:53:53,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:53,271 INFO L225 Difference]: With dead ends: 86 [2018-02-02 19:53:53,271 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 19:53:53,272 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2018-02-02 19:53:53,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 19:53:53,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2018-02-02 19:53:53,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 19:53:53,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-02-02 19:53:53,273 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 35 [2018-02-02 19:53:53,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:53,274 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-02-02 19:53:53,274 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 19:53:53,274 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-02-02 19:53:53,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 19:53:53,274 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:53,274 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 19:53:53,274 INFO L371 AbstractCegarLoop]: === Iteration 30 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:53,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1315632508, now seen corresponding path program 1 times [2018-02-02 19:53:53,275 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:53,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:53,670 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 19:53:53,670 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:53:53,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 19:53:53,671 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:53,671 INFO 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 19:53:53,671 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 19:53:53,671 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 19:53:53,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 19:53:53,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 19:53:53,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-02-02 19:53:53,672 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 17 states. [2018-02-02 19:53:54,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:54,042 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2018-02-02 19:53:54,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 19:53:54,042 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-02-02 19:53:54,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:54,042 INFO L225 Difference]: With dead ends: 88 [2018-02-02 19:53:54,042 INFO L226 Difference]: Without dead ends: 88 [2018-02-02 19:53:54,043 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2018-02-02 19:53:54,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-02 19:53:54,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 74. [2018-02-02 19:53:54,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 19:53:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-02-02 19:53:54,044 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 36 [2018-02-02 19:53:54,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:54,044 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-02-02 19:53:54,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 19:53:54,045 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-02-02 19:53:54,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 19:53:54,045 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:54,045 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 19:53:54,045 INFO L371 AbstractCegarLoop]: === Iteration 31 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:54,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1593710748, now seen corresponding path program 3 times [2018-02-02 19:53:54,045 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:54,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:54,201 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 19:53:54,201 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:53:54,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 19:53:54,202 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:54,202 INFO 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 19:53:54,202 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 19:53:54,202 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 19:53:54,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 19:53:54,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 19:53:54,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-02 19:53:54,203 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 15 states. [2018-02-02 19:53:54,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:54,506 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-02-02 19:53:54,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 19:53:54,506 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2018-02-02 19:53:54,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:54,507 INFO L225 Difference]: With dead ends: 85 [2018-02-02 19:53:54,507 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 19:53:54,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2018-02-02 19:53:54,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 19:53:54,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-02-02 19:53:54,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-02 19:53:54,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-02-02 19:53:54,509 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 38 [2018-02-02 19:53:54,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:54,509 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-02-02 19:53:54,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 19:53:54,509 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-02-02 19:53:54,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 19:53:54,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:54,510 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 19:53:54,510 INFO L371 AbstractCegarLoop]: === Iteration 32 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:54,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1099949155, now seen corresponding path program 2 times [2018-02-02 19:53:54,511 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:54,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:54,845 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 19:53:54,845 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:53:54,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 19:53:54,846 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:54,846 INFO 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 19:53:54,846 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 19:53:54,846 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 19:53:54,846 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 19:53:54,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 19:53:54,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:53:54,847 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 16 states. [2018-02-02 19:53:55,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:55,133 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-02-02 19:53:55,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 19:53:55,134 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2018-02-02 19:53:55,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:55,134 INFO L225 Difference]: With dead ends: 71 [2018-02-02 19:53:55,134 INFO L226 Difference]: Without dead ends: 71 [2018-02-02 19:53:55,135 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2018-02-02 19:53:55,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-02 19:53:55,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2018-02-02 19:53:55,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-02 19:53:55,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-02-02 19:53:55,137 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 38 [2018-02-02 19:53:55,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:55,137 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-02-02 19:53:55,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 19:53:55,137 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-02-02 19:53:55,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 19:53:55,137 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:55,137 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 19:53:55,137 INFO L371 AbstractCegarLoop]: === Iteration 33 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:55,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1981970296, now seen corresponding path program 2 times [2018-02-02 19:53:55,138 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:55,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:55,330 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 19:53:55,330 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:53:55,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 19:53:55,331 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:55,331 INFO 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 19:53:55,331 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 19:53:55,331 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 19:53:55,331 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 19:53:55,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 19:53:55,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:53:55,332 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 14 states. [2018-02-02 19:53:55,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:55,688 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-02-02 19:53:55,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 19:53:55,688 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-02-02 19:53:55,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:55,688 INFO L225 Difference]: With dead ends: 66 [2018-02-02 19:53:55,688 INFO L226 Difference]: Without dead ends: 63 [2018-02-02 19:53:55,689 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-02-02 19:53:55,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-02 19:53:55,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-02-02 19:53:55,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 19:53:55,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-02-02 19:53:55,690 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 38 [2018-02-02 19:53:55,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:55,690 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-02-02 19:53:55,690 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 19:53:55,690 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-02-02 19:53:55,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 19:53:55,690 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:55,690 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 19:53:55,690 INFO L371 AbstractCegarLoop]: === Iteration 34 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:55,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1310522044, now seen corresponding path program 3 times [2018-02-02 19:53:55,691 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:55,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:55,927 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 19:53:55,928 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:53:55,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 19:53:55,928 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:55,928 INFO 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 19:53:55,929 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 19:53:55,929 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 19:53:55,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 19:53:55,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 19:53:55,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-02-02 19:53:55,929 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 18 states. [2018-02-02 19:53:56,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:56,220 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-02-02 19:53:56,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 19:53:56,220 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2018-02-02 19:53:56,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:56,220 INFO L225 Difference]: With dead ends: 66 [2018-02-02 19:53:56,220 INFO L226 Difference]: Without dead ends: 66 [2018-02-02 19:53:56,221 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2018-02-02 19:53:56,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-02 19:53:56,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2018-02-02 19:53:56,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-02 19:53:56,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-02-02 19:53:56,222 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 39 [2018-02-02 19:53:56,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:56,222 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-02-02 19:53:56,222 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 19:53:56,222 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-02-02 19:53:56,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 19:53:56,222 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:56,222 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 19:53:56,222 INFO L371 AbstractCegarLoop]: === Iteration 35 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:56,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1933713659, now seen corresponding path program 2 times [2018-02-02 19:53:56,223 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:56,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:56,724 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 19:53:56,725 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:53:56,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 19:53:56,725 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:56,725 INFO 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 19:53:56,725 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 19:53:56,725 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 19:53:56,725 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 19:53:56,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 19:53:56,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2018-02-02 19:53:56,726 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 24 states. [2018-02-02 19:53:57,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:57,163 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-02-02 19:53:57,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 19:53:57,163 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 40 [2018-02-02 19:53:57,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:57,164 INFO L225 Difference]: With dead ends: 70 [2018-02-02 19:53:57,164 INFO L226 Difference]: Without dead ends: 70 [2018-02-02 19:53:57,164 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 19:53:57,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-02 19:53:57,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2018-02-02 19:53:57,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-02 19:53:57,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-02-02 19:53:57,166 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 40 [2018-02-02 19:53:57,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:57,166 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-02-02 19:53:57,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 19:53:57,166 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-02-02 19:53:57,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 19:53:57,166 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:57,166 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 19:53:57,166 INFO L371 AbstractCegarLoop]: === Iteration 36 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:57,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1971477742, now seen corresponding path program 3 times [2018-02-02 19:53:57,167 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:57,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:57,367 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 19:53:57,367 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:53:57,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 19:53:57,367 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:57,368 INFO 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 19:53:57,368 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 19:53:57,368 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 19:53:57,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 19:53:57,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 19:53:57,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-02 19:53:57,368 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 15 states. [2018-02-02 19:53:57,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:57,617 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-02-02 19:53:57,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 19:53:57,618 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-02-02 19:53:57,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:57,618 INFO L225 Difference]: With dead ends: 65 [2018-02-02 19:53:57,618 INFO L226 Difference]: Without dead ends: 65 [2018-02-02 19:53:57,618 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2018-02-02 19:53:57,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-02 19:53:57,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-02-02 19:53:57,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 19:53:57,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-02-02 19:53:57,620 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 40 [2018-02-02 19:53:57,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:57,620 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-02-02 19:53:57,620 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 19:53:57,620 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-02-02 19:53:57,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 19:53:57,621 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:57,621 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 19:53:57,621 INFO L371 AbstractCegarLoop]: === Iteration 37 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:57,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1953428314, now seen corresponding path program 3 times [2018-02-02 19:53:57,622 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:57,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:58,139 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 19:53:58,139 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:53:58,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 19:53:58,140 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:58,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:53:58,140 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 19:53:58,140 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 19:53:58,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 19:53:58,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 19:53:58,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2018-02-02 19:53:58,140 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 26 states. [2018-02-02 19:53:58,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:58,746 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-02-02 19:53:58,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 19:53:58,747 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 42 [2018-02-02 19:53:58,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:58,747 INFO L225 Difference]: With dead ends: 71 [2018-02-02 19:53:58,747 INFO L226 Difference]: Without dead ends: 71 [2018-02-02 19:53:58,747 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=151, Invalid=1409, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 19:53:58,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-02 19:53:58,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 63. [2018-02-02 19:53:58,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 19:53:58,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-02-02 19:53:58,749 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 42 [2018-02-02 19:53:58,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:58,749 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-02-02 19:53:58,749 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 19:53:58,749 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-02-02 19:53:58,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 19:53:58,749 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:58,750 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 19:53:58,750 INFO L371 AbstractCegarLoop]: === Iteration 38 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:58,750 INFO L82 PathProgramCache]: Analyzing trace with hash -754899982, now seen corresponding path program 4 times [2018-02-02 19:53:58,750 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:58,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:59,069 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 19:53:59,069 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:53:59,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 19:53:59,069 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:59,070 INFO 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 19:53:59,070 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 19:53:59,070 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 19:53:59,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 19:53:59,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 19:53:59,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-02-02 19:53:59,071 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 20 states. [2018-02-02 19:53:59,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:59,430 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-02-02 19:53:59,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 19:53:59,430 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2018-02-02 19:53:59,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:59,430 INFO L225 Difference]: With dead ends: 75 [2018-02-02 19:53:59,430 INFO L226 Difference]: Without dead ends: 56 [2018-02-02 19:53:59,431 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 19:53:59,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-02 19:53:59,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-02 19:53:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 19:53:59,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-02-02 19:53:59,432 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2018-02-02 19:53:59,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:59,432 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-02-02 19:53:59,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 19:53:59,432 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-02-02 19:53:59,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 19:53:59,432 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:59,432 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 19:53:59,432 INFO L371 AbstractCegarLoop]: === Iteration 39 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:59,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1248661575, now seen corresponding path program 3 times [2018-02-02 19:53:59,433 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:59,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:53:59,614 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 19:53:59,615 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:53:59,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 19:53:59,615 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:53:59,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:53:59,615 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 19:53:59,615 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 19:53:59,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 19:53:59,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 19:53:59,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-02-02 19:53:59,616 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 18 states. [2018-02-02 19:53:59,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:53:59,865 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-02-02 19:53:59,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 19:53:59,865 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 44 [2018-02-02 19:53:59,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:53:59,866 INFO L225 Difference]: With dead ends: 60 [2018-02-02 19:53:59,866 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 19:53:59,866 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2018-02-02 19:53:59,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 19:53:59,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2018-02-02 19:53:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 19:53:59,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-02-02 19:53:59,867 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2018-02-02 19:53:59,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:53:59,867 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-02-02 19:53:59,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 19:53:59,867 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-02-02 19:53:59,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 19:53:59,867 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:53:59,868 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 19:53:59,868 INFO L371 AbstractCegarLoop]: === Iteration 40 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:53:59,868 INFO L82 PathProgramCache]: Analyzing trace with hash -223367471, now seen corresponding path program 5 times [2018-02-02 19:53:59,868 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:53:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:53:59,876 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:54:00,599 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 19:54:00,599 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:54:00,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 19:54:00,600 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:54:00,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:54:00,600 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 19:54:00,600 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 19:54:00,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 19:54:00,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 19:54:00,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2018-02-02 19:54:00,601 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 28 states. [2018-02-02 19:54:01,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:54:01,683 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-02-02 19:54:01,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 19:54:01,683 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 46 [2018-02-02 19:54:01,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:54:01,683 INFO L225 Difference]: With dead ends: 64 [2018-02-02 19:54:01,683 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 19:54:01,684 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 19:54:01,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 19:54:01,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-02-02 19:54:01,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 19:54:01,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-02-02 19:54:01,685 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 46 [2018-02-02 19:54:01,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:54:01,685 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-02-02 19:54:01,685 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 19:54:01,685 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-02-02 19:54:01,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 19:54:01,686 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:54:01,686 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 19:54:01,686 INFO L371 AbstractCegarLoop]: === Iteration 41 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:54:01,686 INFO L82 PathProgramCache]: Analyzing trace with hash -827300944, now seen corresponding path program 6 times [2018-02-02 19:54:01,687 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:54:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:54:01,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:54:02,629 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 19:54:02,629 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:54:02,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 19:54:02,630 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:54:02,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:54:02,630 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 19:54:02,630 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 19:54:02,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 19:54:02,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 19:54:02,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=793, Unknown=0, NotChecked=0, Total=870 [2018-02-02 19:54:02,631 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 30 states. [2018-02-02 19:54:03,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:54:03,440 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-02-02 19:54:03,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 19:54:03,440 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 48 [2018-02-02 19:54:03,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:54:03,440 INFO L225 Difference]: With dead ends: 77 [2018-02-02 19:54:03,440 INFO L226 Difference]: Without dead ends: 77 [2018-02-02 19:54:03,441 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=140, Invalid=1420, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 19:54:03,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-02 19:54:03,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2018-02-02 19:54:03,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-02 19:54:03,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-02-02 19:54:03,442 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 48 [2018-02-02 19:54:03,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:54:03,442 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-02-02 19:54:03,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 19:54:03,442 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-02-02 19:54:03,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 19:54:03,442 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:54:03,443 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 19:54:03,443 INFO L371 AbstractCegarLoop]: === Iteration 42 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 19:54:03,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1566058808, now seen corresponding path program 7 times [2018-02-02 19:54:03,443 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:54:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:54:03,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:54:03,703 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 19:54:03,703 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:54:03,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 19:54:03,703 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:54:03,704 INFO 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 19:54:03,704 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 19:54:03,704 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 19:54:03,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 19:54:03,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 19:54:03,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-02-02 19:54:03,704 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 18 states. [2018-02-02 19:54:03,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:54:03,958 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-02-02 19:54:03,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 19:54:03,958 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2018-02-02 19:54:03,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:54:03,958 INFO L225 Difference]: With dead ends: 76 [2018-02-02 19:54:03,958 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 19:54:03,959 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2018-02-02 19:54:03,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 19:54:03,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 19:54:03,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 19:54:03,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 19:54:03,959 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2018-02-02 19:54:03,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:54:03,959 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 19:54:03,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 19:54:03,959 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 19:54:03,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 19:54:03,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 07:54:03 BoogieIcfgContainer [2018-02-02 19:54:03,963 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 19:54:03,963 INFO L168 Benchmark]: Toolchain (without parser) took 19541.91 ms. Allocated memory was 396.4 MB in the beginning and 945.3 MB in the end (delta: 548.9 MB). Free memory was 351.7 MB in the beginning and 848.2 MB in the end (delta: -496.5 MB). Peak memory consumption was 52.4 MB. Max. memory is 5.3 GB. [2018-02-02 19:54:03,964 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 396.4 MB. Free memory is still 357.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 19:54:03,964 INFO L168 Benchmark]: CACSL2BoogieTranslator took 157.72 ms. Allocated memory is still 396.4 MB. Free memory was 350.4 MB in the beginning and 339.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 19:54:03,964 INFO L168 Benchmark]: Boogie Preprocessor took 23.84 ms. Allocated memory is still 396.4 MB. Free memory was 339.8 MB in the beginning and 338.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 19:54:03,964 INFO L168 Benchmark]: RCFGBuilder took 223.32 ms. Allocated memory is still 396.4 MB. Free memory was 338.5 MB in the beginning and 317.2 MB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 5.3 GB. [2018-02-02 19:54:03,964 INFO L168 Benchmark]: TraceAbstraction took 19134.68 ms. Allocated memory was 396.4 MB in the beginning and 945.3 MB in the end (delta: 548.9 MB). Free memory was 317.2 MB in the beginning and 848.2 MB in the end (delta: -531.0 MB). Peak memory consumption was 17.9 MB. Max. memory is 5.3 GB. [2018-02-02 19:54:03,965 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.15 ms. Allocated memory is still 396.4 MB. Free memory is still 357.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 157.72 ms. Allocated memory is still 396.4 MB. Free memory was 350.4 MB in the beginning and 339.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.84 ms. Allocated memory is still 396.4 MB. Free memory was 339.8 MB in the beginning and 338.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 223.32 ms. Allocated memory is still 396.4 MB. Free memory was 338.5 MB in the beginning and 317.2 MB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 19134.68 ms. Allocated memory was 396.4 MB in the beginning and 945.3 MB in the end (delta: 548.9 MB). Free memory was 317.2 MB in the beginning and 848.2 MB in the end (delta: -531.0 MB). Peak memory consumption was 17.9 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.0s OverallTime, 42 OverallIterations, 4 TraceHistogramMax, 9.7s 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.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 793 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 726 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2757 ImplicationChecksByTransitivity, 11.1s 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.0s AutomataMinimizationTime, 42 MinimizatonAttempts, 352 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.4s 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_19-54-03-969.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_19-54-03-969.csv Received shutdown request...