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_cstpncpy-alloca_true-valid-memsafety_true-termination.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-ccafca9-m
[2018-02-04 01:46:01,569 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-02-04 01:46:01,570 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-02-04 01:46:01,580 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-02-04 01:46:01,581 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-02-04 01:46:01,581 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-02-04 01:46:01,582 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-02-04 01:46:01,584 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-02-04 01:46:01,585 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-02-04 01:46:01,586 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-02-04 01:46:01,587 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-02-04 01:46:01,587 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-02-04 01:46:01,588 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-02-04 01:46:01,589 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-02-04 01:46:01,589 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-02-04 01:46:01,591 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-02-04 01:46:01,593 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-02-04 01:46:01,594 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-02-04 01:46:01,595 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-02-04 01:46:01,596 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-02-04 01:46:01,598 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-02-04 01:46:01,598 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-02-04 01:46:01,598 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-02-04 01:46:01,599 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-02-04 01:46:01,600 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-02-04 01:46:01,601 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-02-04 01:46:01,601 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-02-04 01:46:01,601 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-02-04 01:46:01,602 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-02-04 01:46:01,602 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-02-04 01:46:01,602 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-02-04 01:46:01,602 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf
[2018-02-04 01:46:01,613 INFO L110 SettingsManager]: Loading preferences was successful
[2018-02-04 01:46:01,613 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-02-04 01:46:01,614 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-02-04 01:46:01,614 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2018-02-04 01:46:01,614 INFO L133 SettingsManager]: * Use SBE=true
[2018-02-04 01:46:01,614 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-02-04 01:46:01,615 INFO L133 SettingsManager]: * sizeof long=4
[2018-02-04 01:46:01,615 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-02-04 01:46:01,615 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-02-04 01:46:01,615 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-02-04 01:46:01,615 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-02-04 01:46:01,615 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-02-04 01:46:01,616 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-02-04 01:46:01,616 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-02-04 01:46:01,616 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-02-04 01:46:01,616 INFO L133 SettingsManager]: * sizeof long double=12
[2018-02-04 01:46:01,616 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-02-04 01:46:01,616 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2018-02-04 01:46:01,616 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-02-04 01:46:01,617 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-02-04 01:46:01,617 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-04 01:46:01,617 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-02-04 01:46:01,617 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation
[2018-02-04 01:46:01,646 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-02-04 01:46:01,657 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-02-04 01:46:01,662 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-02-04 01:46:01,664 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-02-04 01:46:01,664 INFO L276 PluginConnector]: CDTParser initialized
[2018-02-04 01:46:01,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i
[2018-02-04 01:46:01,812 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-02-04 01:46:01,813 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-02-04 01:46:01,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-02-04 01:46:01,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-02-04 01:46:01,820 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-02-04 01:46:01,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:46:01" (1/1) ...
[2018-02-04 01:46:01,823 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5822695f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:46:01, skipping insertion in model container
[2018-02-04 01:46:01,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:46:01" (1/1) ...
[2018-02-04 01:46:01,835 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-04 01:46:01,864 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-04 01:46:01,973 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-04 01:46:01,993 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-04 01:46:01,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:46:01 WrapperNode
[2018-02-04 01:46:01,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-02-04 01:46:01,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-02-04 01:46:02,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-02-04 01:46:02,000 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-02-04 01:46:02,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:46:01" (1/1) ...
[2018-02-04 01:46:02,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:46:01" (1/1) ...
[2018-02-04 01:46:02,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:46:01" (1/1) ...
[2018-02-04 01:46:02,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:46:01" (1/1) ...
[2018-02-04 01:46:02,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:46:01" (1/1) ...
[2018-02-04 01:46:02,031 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:46:01" (1/1) ...
[2018-02-04 01:46:02,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:46:01" (1/1) ...
[2018-02-04 01:46:02,035 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-02-04 01:46:02,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-02-04 01:46:02,036 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-02-04 01:46:02,036 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-02-04 01:46:02,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:46:01" (1/1) ...
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-04 01:46:02,076 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-02-04 01:46:02,076 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-02-04 01:46:02,076 INFO L136 BoogieDeclarations]: Found implementation of procedure cstpncpy
[2018-02-04 01:46:02,077 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-02-04 01:46:02,077 INFO L128 BoogieDeclarations]: Found specification of procedure write~int
[2018-02-04 01:46:02,077 INFO L128 BoogieDeclarations]: Found specification of procedure read~int
[2018-02-04 01:46:02,077 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2018-02-04 01:46:02,077 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2018-02-04 01:46:02,077 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-02-04 01:46:02,077 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-02-04 01:46:02,078 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-02-04 01:46:02,078 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-02-04 01:46:02,078 INFO L128 BoogieDeclarations]: Found specification of procedure cstpncpy
[2018-02-04 01:46:02,078 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-02-04 01:46:02,078 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-02-04 01:46:02,078 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-02-04 01:46:02,382 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-02-04 01:46:02,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:46:02 BoogieIcfgContainer
[2018-02-04 01:46:02,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-02-04 01:46:02,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-02-04 01:46:02,384 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-02-04 01:46:02,386 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-02-04 01:46:02,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:46:01" (1/3) ...
[2018-02-04 01:46:02,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56cbf422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:46:02, skipping insertion in model container
[2018-02-04 01:46:02,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:46:01" (2/3) ...
[2018-02-04 01:46:02,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56cbf422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:46:02, skipping insertion in model container
[2018-02-04 01:46:02,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:46:02" (3/3) ...
[2018-02-04 01:46:02,389 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i
[2018-02-04 01:46:02,394 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION
[2018-02-04 01:46:02,402 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations.
[2018-02-04 01:46:02,427 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-02-04 01:46:02,427 INFO L323 AbstractCegarLoop]: Hoare is false
[2018-02-04 01:46:02,427 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation
[2018-02-04 01:46:02,427 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL
[2018-02-04 01:46:02,427 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-02-04 01:46:02,427 INFO L327 AbstractCegarLoop]: Difference is false
[2018-02-04 01:46:02,427 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-02-04 01:46:02,428 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-02-04 01:46:02,428 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-02-04 01:46:02,437 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states.
[2018-02-04 01:46:02,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2018-02-04 01:46:02,446 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:46:02,447 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 01:46:02,447 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:46:02,451 INFO L82 PathProgramCache]: Analyzing trace with hash 149116887, now seen corresponding path program 1 times
[2018-02-04 01:46:02,484 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:46:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:46:02,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:46:02,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:02,584 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 01:46:02,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-04 01:46:02,585 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:46:02,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:02,585 INFO L182 omatonBuilderFactory]: Interpolants [74#true, 75#false, 76#(= 1 (select |#valid| |main_#t~malloc16.base|)), 77#(= 1 (select |#valid| main_~nondetString~0.base))]
[2018-02-04 01:46:02,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:02,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-04 01:46:02,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-04 01:46:02,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-04 01:46:02,597 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 4 states.
[2018-02-04 01:46:02,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:46:02,833 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions.
[2018-02-04 01:46:02,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-04 01:46:02,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2018-02-04 01:46:02,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:46:02,841 INFO L225 Difference]: With dead ends: 70
[2018-02-04 01:46:02,841 INFO L226 Difference]: Without dead ends: 67
[2018-02-04 01:46:02,843 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-04 01:46:02,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states.
[2018-02-04 01:46:02,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67.
[2018-02-04 01:46:02,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states.
[2018-02-04 01:46:02,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions.
[2018-02-04 01:46:02,869 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 13
[2018-02-04 01:46:02,869 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:46:02,869 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions.
[2018-02-04 01:46:02,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-04 01:46:02,870 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions.
[2018-02-04 01:46:02,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2018-02-04 01:46:02,870 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:46:02,870 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 01:46:02,870 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:46:02,870 INFO L82 PathProgramCache]: Analyzing trace with hash 149116888, now seen corresponding path program 1 times
[2018-02-04 01:46:02,871 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:46:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:46:02,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:46:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:02,940 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 01:46:02,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-04 01:46:02,941 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:46:02,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:02,941 INFO L182 omatonBuilderFactory]: Interpolants [217#true, 218#false, 219#(<= 1 main_~length~0), 220#(and (= 0 |main_#t~malloc16.offset|) (= main_~length~0 (select |#length| |main_#t~malloc16.base|)) (<= 1 main_~length~0)), 221#(and (= main_~length~0 (select |#length| main_~nondetString~0.base)) (= main_~nondetString~0.offset 0) (<= 1 main_~length~0))]
[2018-02-04 01:46:02,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:02,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-04 01:46:02,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-04 01:46:02,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-04 01:46:02,946 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 5 states.
[2018-02-04 01:46:02,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:46:02,978 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions.
[2018-02-04 01:46:02,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-04 01:46:02,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13
[2018-02-04 01:46:02,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:46:02,979 INFO L225 Difference]: With dead ends: 66
[2018-02-04 01:46:02,980 INFO L226 Difference]: Without dead ends: 66
[2018-02-04 01:46:02,980 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2018-02-04 01:46:02,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states.
[2018-02-04 01:46:02,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66.
[2018-02-04 01:46:02,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states.
[2018-02-04 01:46:02,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions.
[2018-02-04 01:46:02,984 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 13
[2018-02-04 01:46:02,984 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:46:02,984 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions.
[2018-02-04 01:46:02,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-04 01:46:02,984 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions.
[2018-02-04 01:46:02,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-02-04 01:46:02,984 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:46:02,984 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 01:46:02,985 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:46:02,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1345074556, now seen corresponding path program 1 times
[2018-02-04 01:46:02,985 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:46:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:46:03,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:46:03,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:03,057 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 01:46:03,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-02-04 01:46:03,058 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:46:03,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:03,058 INFO L182 omatonBuilderFactory]: Interpolants [356#true, 357#false, 358#(= 1 (select |#valid| |cstpncpy_~#dst.base|))]
[2018-02-04 01:46:03,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:03,058 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-02-04 01:46:03,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-02-04 01:46:03,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-04 01:46:03,059 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 3 states.
[2018-02-04 01:46:03,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:46:03,130 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions.
[2018-02-04 01:46:03,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-02-04 01:46:03,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16
[2018-02-04 01:46:03,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:46:03,131 INFO L225 Difference]: With dead ends: 60
[2018-02-04 01:46:03,131 INFO L226 Difference]: Without dead ends: 60
[2018-02-04 01:46:03,131 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-04 01:46:03,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states.
[2018-02-04 01:46:03,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60.
[2018-02-04 01:46:03,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states.
[2018-02-04 01:46:03,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions.
[2018-02-04 01:46:03,134 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 16
[2018-02-04 01:46:03,135 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:46:03,135 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions.
[2018-02-04 01:46:03,135 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-02-04 01:46:03,135 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions.
[2018-02-04 01:46:03,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-02-04 01:46:03,135 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:46:03,136 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 01:46:03,136 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:46:03,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1345074557, now seen corresponding path program 1 times
[2018-02-04 01:46:03,137 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:46:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:46:03,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:46:03,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:03,183 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 01:46:03,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-02-04 01:46:03,184 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:46:03,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:03,184 INFO L182 omatonBuilderFactory]: Interpolants [480#false, 481#(and (= |cstpncpy_~#dst.offset| 0) (= (select |#length| |cstpncpy_~#dst.base|) 4)), 479#true]
[2018-02-04 01:46:03,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:03,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-02-04 01:46:03,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-02-04 01:46:03,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-04 01:46:03,185 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 3 states.
[2018-02-04 01:46:03,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:46:03,220 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions.
[2018-02-04 01:46:03,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-02-04 01:46:03,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16
[2018-02-04 01:46:03,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:46:03,221 INFO L225 Difference]: With dead ends: 54
[2018-02-04 01:46:03,221 INFO L226 Difference]: Without dead ends: 54
[2018-02-04 01:46:03,221 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-04 01:46:03,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states.
[2018-02-04 01:46:03,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54.
[2018-02-04 01:46:03,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states.
[2018-02-04 01:46:03,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions.
[2018-02-04 01:46:03,224 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 16
[2018-02-04 01:46:03,224 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:46:03,224 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions.
[2018-02-04 01:46:03,224 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-02-04 01:46:03,224 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions.
[2018-02-04 01:46:03,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2018-02-04 01:46:03,224 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:46:03,225 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]
[2018-02-04 01:46:03,225 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:46:03,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1779018923, now seen corresponding path program 1 times
[2018-02-04 01:46:03,225 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:46:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:46:03,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:46:03,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:03,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 01:46:03,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-02-04 01:46:03,349 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:46:03,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:03,349 INFO L182 omatonBuilderFactory]: Interpolants [592#(= 1 (select |#valid| |main_#t~malloc16.base|)), 593#(= 1 (select |#valid| main_~nondetString~0.base)), 594#(= 1 (select |#valid| |cstpncpy_#in~src.base|)), 595#(or (= |cstpncpy_~#dst.base| |cstpncpy_#in~src.base|) (= 1 (select |#valid| |cstpncpy_#in~src.base|))), 596#(= 1 (select |#valid| cstpncpy_~src.base)), 597#(= 1 (select |#valid| cstpncpy_~s~0.base)), 598#(= (select |#valid| |cstpncpy_#t~post5.base|) 1), 590#true, 591#false]
[2018-02-04 01:46:03,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:03,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-02-04 01:46:03,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-02-04 01:46:03,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2018-02-04 01:46:03,350 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 9 states.
[2018-02-04 01:46:03,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:46:03,542 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions.
[2018-02-04 01:46:03,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-02-04 01:46:03,543 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25
[2018-02-04 01:46:03,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:46:03,543 INFO L225 Difference]: With dead ends: 56
[2018-02-04 01:46:03,544 INFO L226 Difference]: Without dead ends: 56
[2018-02-04 01:46:03,544 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156
[2018-02-04 01:46:03,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states.
[2018-02-04 01:46:03,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53.
[2018-02-04 01:46:03,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states.
[2018-02-04 01:46:03,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions.
[2018-02-04 01:46:03,549 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 25
[2018-02-04 01:46:03,549 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:46:03,549 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions.
[2018-02-04 01:46:03,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-02-04 01:46:03,549 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions.
[2018-02-04 01:46:03,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2018-02-04 01:46:03,550 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:46:03,550 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]
[2018-02-04 01:46:03,550 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:46:03,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1779018922, now seen corresponding path program 1 times
[2018-02-04 01:46:03,554 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:46:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:46:03,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:46: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-04 01:46:03,704 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 01:46:03,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2018-02-04 01:46:03,704 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:46: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-04 01:46:03,704 INFO L182 omatonBuilderFactory]: Interpolants [720#(and (= main_~length~0 (select |#length| main_~nondetString~0.base)) (= 0 main_~nondetString~0.offset) (<= 1 main_~length~0)), 721#(and (<= 1 (select |#length| main_~nondetString~0.base)) (= (select |#valid| main_~nondetString~0.base) 1) (= 0 main_~nondetString~0.offset)), 722#(and (= (select |#valid| |cstpncpy_#in~src.base|) 1) (<= 1 (select |#length| |cstpncpy_#in~src.base|)) (= 0 |cstpncpy_#in~src.offset|)), 723#(and (<= 1 (select |#length| |cstpncpy_#in~src.base|)) (= 0 |cstpncpy_#in~src.offset|)), 724#(and (<= 1 (select |#length| cstpncpy_~src.base)) (= 0 cstpncpy_~src.offset)), 725#(and (<= 1 (select |#length| cstpncpy_~s~0.base)) (= 0 cstpncpy_~s~0.offset)), 726#(and (<= 1 (select |#length| |cstpncpy_#t~post5.base|)) (= |cstpncpy_#t~post5.offset| 0)), 716#true, 717#false, 718#(<= 1 main_~length~0), 719#(and (= 0 |main_#t~malloc16.offset|) (= main_~length~0 (select |#length| |main_#t~malloc16.base|)) (<= 1 main_~length~0))]
[2018-02-04 01:46: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-04 01:46:03,705 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-02-04 01:46:03,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-02-04 01:46:03,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2018-02-04 01:46:03,705 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 11 states.
[2018-02-04 01:46:03,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:46:03,923 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions.
[2018-02-04 01:46:03,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-02-04 01:46:03,924 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25
[2018-02-04 01:46:03,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:46:03,925 INFO L225 Difference]: With dead ends: 59
[2018-02-04 01:46:03,925 INFO L226 Difference]: Without dead ends: 59
[2018-02-04 01:46:03,925 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272
[2018-02-04 01:46:03,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states.
[2018-02-04 01:46:03,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55.
[2018-02-04 01:46:03,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states.
[2018-02-04 01:46:03,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions.
[2018-02-04 01:46:03,928 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 25
[2018-02-04 01:46:03,929 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:46:03,929 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions.
[2018-02-04 01:46:03,929 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-02-04 01:46:03,929 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions.
[2018-02-04 01:46:03,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2018-02-04 01:46:03,933 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:46:03,933 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-04 01:46:03,933 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:46:03,933 INFO L82 PathProgramCache]: Analyzing trace with hash 684988236, now seen corresponding path program 1 times
[2018-02-04 01:46:03,934 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:46:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:46:03,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:46:04,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:04,131 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 01:46:04,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2018-02-04 01:46:04,131 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:46:04,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:04,131 INFO L182 omatonBuilderFactory]: Interpolants [864#(or (= 1 (select |#valid| cstpncpy_~d~0.base)) (= cstpncpy_~s~0.base cstpncpy_~d~0.base)), 865#(or (= |cstpncpy_#t~post4.base| |cstpncpy_#t~post5.base|) (= 1 (select |#valid| |cstpncpy_#t~post4.base|))), 866#(= 1 (select |#valid| |cstpncpy_#t~post4.base|)), 853#true, 854#false, 855#(= 1 (select |#valid| |main_#t~malloc15.base|)), 856#(= 1 (select |#valid| main_~nondetArea~0.base)), 857#(or (= |main_#t~malloc16.base| main_~nondetArea~0.base) (= 1 (select |#valid| main_~nondetArea~0.base))), 858#(or (= main_~nondetString~0.base main_~nondetArea~0.base) (= 1 (select |#valid| main_~nondetArea~0.base))), 859#(or (= |cstpncpy_#in~src.base| |cstpncpy_#in~dst.base|) (= 1 (select |#valid| |cstpncpy_#in~dst.base|))), 860#(or (= |cstpncpy_#in~src.base| |cstpncpy_#in~dst.base|) (= |cstpncpy_~#dst.base| |cstpncpy_#in~dst.base|) (= 1 (select |#valid| |cstpncpy_#in~dst.base|))), 861#(and (= (select |#valid| |cstpncpy_~#dst.base|) 1) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (= |cstpncpy_#in~src.base| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)))), 862#(and (= (select |#valid| |cstpncpy_~#dst.base|) 1) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (= cstpncpy_~src.base (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)))), 863#(or (= cstpncpy_~src.base |cstpncpy_#t~mem0.base|) (= 1 (select |#valid| |cstpncpy_#t~mem0.base|)))]
[2018-02-04 01:46:04,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:04,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states
[2018-02-04 01:46:04,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2018-02-04 01:46:04,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182
[2018-02-04 01:46:04,132 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 14 states.
[2018-02-04 01:46:04,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:46:04,388 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions.
[2018-02-04 01:46:04,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-02-04 01:46:04,388 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26
[2018-02-04 01:46:04,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:46:04,389 INFO L225 Difference]: With dead ends: 57
[2018-02-04 01:46:04,389 INFO L226 Difference]: Without dead ends: 57
[2018-02-04 01:46:04,389 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462
[2018-02-04 01:46:04,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states.
[2018-02-04 01:46:04,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54.
[2018-02-04 01:46:04,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states.
[2018-02-04 01:46:04,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions.
[2018-02-04 01:46:04,391 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 26
[2018-02-04 01:46:04,391 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:46:04,391 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions.
[2018-02-04 01:46:04,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states.
[2018-02-04 01:46:04,392 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions.
[2018-02-04 01:46:04,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2018-02-04 01:46:04,392 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:46:04,392 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-04 01:46:04,392 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:46:04,392 INFO L82 PathProgramCache]: Analyzing trace with hash 684988237, now seen corresponding path program 1 times
[2018-02-04 01:46:04,393 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:46:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:46:04,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:46:04,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:04,598 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 01:46:04,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2018-02-04 01:46:04,598 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:46:04,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:04,598 INFO L182 omatonBuilderFactory]: Interpolants [994#true, 995#false, 996#(<= 1 main_~n~0), 997#(and (= main_~n~0 (select |#length| |main_#t~malloc15.base|)) (<= 1 main_~n~0) (= (select |#valid| |main_#t~malloc15.base|) 1) (= 0 |main_#t~malloc15.offset|)), 998#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= (select |#valid| main_~nondetArea~0.base) 1) (<= 1 main_~n~0) (= 0 main_~nondetArea~0.offset)), 999#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (<= 1 main_~n~0) (= 0 main_~nondetArea~0.offset)), 1000#(and (<= 1 (select |#length| |cstpncpy_#in~dst.base|)) (= 0 |cstpncpy_#in~dst.offset|)), 1001#(and (<= 1 (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))), 1002#(and (= (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) |cstpncpy_#t~mem0.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (<= 1 (select |#length| |cstpncpy_#t~mem0.base|))), 1003#(and (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (<= 1 (select |#length| cstpncpy_~d~0.base)) (= (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) cstpncpy_~d~0.offset)), 1004#(and (= |cstpncpy_#t~mem1.offset| 0) (= |cstpncpy_#t~mem1.offset| cstpncpy_~d~0.offset) (<= 1 (select |#length| cstpncpy_~d~0.base))), 1005#(and (<= 0 cstpncpy_~d~0.offset) (<= (+ cstpncpy_~d~0.offset 1) (select |#length| cstpncpy_~d~0.base))), 1006#(and (<= (+ |cstpncpy_#t~post4.offset| 1) (select |#length| |cstpncpy_#t~post4.base|)) (<= 0 |cstpncpy_#t~post4.offset|))]
[2018-02-04 01:46:04,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:04,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-02-04 01:46:04,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-02-04 01:46:04,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156
[2018-02-04 01:46:04,599 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 13 states.
[2018-02-04 01:46:04,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:46:04,809 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions.
[2018-02-04 01:46:04,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-02-04 01:46:04,810 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26
[2018-02-04 01:46:04,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:46:04,810 INFO L225 Difference]: With dead ends: 59
[2018-02-04 01:46:04,810 INFO L226 Difference]: Without dead ends: 59
[2018-02-04 01:46:04,811 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420
[2018-02-04 01:46:04,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states.
[2018-02-04 01:46:04,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55.
[2018-02-04 01:46:04,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states.
[2018-02-04 01:46:04,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions.
[2018-02-04 01:46:04,814 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 26
[2018-02-04 01:46:04,815 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:46:04,815 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions.
[2018-02-04 01:46:04,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-02-04 01:46:04,818 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions.
[2018-02-04 01:46:04,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2018-02-04 01:46:04,818 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:46:04,819 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-04 01:46:04,819 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:46:04,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1786557187, now seen corresponding path program 1 times
[2018-02-04 01:46:04,820 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:46:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:46:04,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:46:04,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:04,874 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 01:46:04,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-04 01:46:04,874 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:46:04,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:04,875 INFO L182 omatonBuilderFactory]: Interpolants [1137#true, 1138#false, 1139#(and (<= 1 main_~n~0) (<= main_~n~0 1)), 1140#(= cstpncpy_~n |cstpncpy_#in~n|), 1141#(or (<= 4294967296 |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| 0))]
[2018-02-04 01:46:04,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:04,875 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-04 01:46:04,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-04 01:46:04,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-04 01:46:04,876 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 5 states.
[2018-02-04 01:46:04,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:46:04,918 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions.
[2018-02-04 01:46:04,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-04 01:46:04,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30
[2018-02-04 01:46:04,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:46:04,921 INFO L225 Difference]: With dead ends: 79
[2018-02-04 01:46:04,921 INFO L226 Difference]: Without dead ends: 79
[2018-02-04 01:46:04,921 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-02-04 01:46:04,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states.
[2018-02-04 01:46:04,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67.
[2018-02-04 01:46:04,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states.
[2018-02-04 01:46:04,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions.
[2018-02-04 01:46:04,929 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 30
[2018-02-04 01:46:04,929 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:46:04,929 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions.
[2018-02-04 01:46:04,930 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-04 01:46:04,930 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions.
[2018-02-04 01:46:04,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2018-02-04 01:46:04,933 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:46:04,933 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-04 01:46:04,933 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:46:04,933 INFO L82 PathProgramCache]: Analyzing trace with hash -18881147, now seen corresponding path program 1 times
[2018-02-04 01:46:04,934 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:46:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:46:04,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:46:05,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:05,000 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 01:46:05,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-02-04 01:46:05,000 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:46:05,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:05,004 INFO L182 omatonBuilderFactory]: Interpolants [1290#true, 1291#false, 1292#(<= main_~n~0 2147483647), 1293#(and (<= main_~n~0 2147483647) (<= 1 main_~n~0)), 1294#(= cstpncpy_~n |cstpncpy_#in~n|), 1295#(or (<= 4294967296 |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| 0))]
[2018-02-04 01:46:05,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:05,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-04 01:46:05,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-04 01:46:05,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2018-02-04 01:46:05,005 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 6 states.
[2018-02-04 01:46:05,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:46:05,043 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions.
[2018-02-04 01:46:05,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-04 01:46:05,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30
[2018-02-04 01:46:05,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:46:05,057 INFO L225 Difference]: With dead ends: 72
[2018-02-04 01:46:05,057 INFO L226 Difference]: Without dead ends: 66
[2018-02-04 01:46:05,058 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-04 01:46:05,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states.
[2018-02-04 01:46:05,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55.
[2018-02-04 01:46:05,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states.
[2018-02-04 01:46:05,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions.
[2018-02-04 01:46:05,061 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 30
[2018-02-04 01:46:05,061 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:46:05,062 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions.
[2018-02-04 01:46:05,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-04 01:46:05,062 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions.
[2018-02-04 01:46:05,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2018-02-04 01:46:05,063 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:46:05,063 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 01:46:05,063 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:46:05,063 INFO L82 PathProgramCache]: Analyzing trace with hash -25567208, now seen corresponding path program 1 times
[2018-02-04 01:46:05,064 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:46:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:46:05,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:46:05,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:05,155 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 01:46:05,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-02-04 01:46:05,155 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:46:05,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:05,156 INFO L182 omatonBuilderFactory]: Interpolants [1425#true, 1426#false, 1427#(and (<= 1 main_~n~0) (<= main_~n~0 1)), 1428#(and (<= 1 |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| 1)), 1429#(and (<= 1 cstpncpy_~n) (<= cstpncpy_~n 1)), 1430#(and (<= |cstpncpy_#t~pre3| (* 4294967296 (div |cstpncpy_#t~pre3| 4294967296))) (< 0 (+ (div |cstpncpy_#t~pre3| 4294967296) 1)))]
[2018-02-04 01:46:05,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:05,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-04 01:46:05,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-04 01:46:05,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-04 01:46:05,157 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 6 states.
[2018-02-04 01:46:05,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:46:05,199 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions.
[2018-02-04 01:46:05,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-04 01:46:05,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31
[2018-02-04 01:46:05,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:46:05,200 INFO L225 Difference]: With dead ends: 99
[2018-02-04 01:46:05,200 INFO L226 Difference]: Without dead ends: 99
[2018-02-04 01:46:05,200 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2018-02-04 01:46:05,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states.
[2018-02-04 01:46:05,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88.
[2018-02-04 01:46:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states.
[2018-02-04 01:46:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions.
[2018-02-04 01:46:05,203 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 31
[2018-02-04 01:46:05,204 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:46:05,204 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions.
[2018-02-04 01:46:05,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-04 01:46:05,204 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions.
[2018-02-04 01:46:05,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2018-02-04 01:46:05,204 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:46:05,204 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 01:46:05,204 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:46:05,205 INFO L82 PathProgramCache]: Analyzing trace with hash -159580714, now seen corresponding path program 1 times
[2018-02-04 01:46:05,205 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:46:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:46:05,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:46:05,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:05,343 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 01:46:05,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2018-02-04 01:46:05,344 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:46:05,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:05,344 INFO L182 omatonBuilderFactory]: Interpolants [1632#(= 0 (select (select |#memory_int| cstpncpy_~s~0.base) cstpncpy_~s~0.offset)), 1633#(= 0 (select (select |#memory_int| |cstpncpy_#t~post5.base|) |cstpncpy_#t~post5.offset|)), 1634#(= |cstpncpy_#t~mem7| 0), 1622#true, 1623#false, 1624#(and (<= main_~length~0 1) (<= 1 main_~length~0)), 1625#(and (<= main_~length~0 1) (= 0 |main_#t~malloc16.offset|) (<= 1 main_~length~0)), 1626#(and (<= (+ main_~nondetString~0.offset main_~length~0) 1) (= main_~nondetString~0.offset 0) (<= 1 main_~length~0)), 1627#(and (= (select |#valid| main_~nondetString~0.base) 1) (= main_~nondetString~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString~0.base) main_~nondetString~0.offset))), 1628#(and (= (select |#valid| |cstpncpy_#in~src.base|) 1) (= 0 (select (select |#memory_int| |cstpncpy_#in~src.base|) |cstpncpy_#in~src.offset|))), 1629#(and (not (= |cstpncpy_~#dst.base| |cstpncpy_#in~src.base|)) (= 0 (select (select |#memory_int| |cstpncpy_#in~src.base|) |cstpncpy_#in~src.offset|))), 1630#(and (= 0 (select (select |#memory_int| cstpncpy_~src.base) cstpncpy_~src.offset)) (not (= |cstpncpy_~#dst.base| cstpncpy_~src.base))), 1631#(and (not (= |cstpncpy_~#dst.base| cstpncpy_~s~0.base)) (= 0 (select (select |#memory_int| cstpncpy_~s~0.base) cstpncpy_~s~0.offset)))]
[2018-02-04 01:46:05,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:05,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-02-04 01:46:05,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-02-04 01:46:05,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156
[2018-02-04 01:46:05,345 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 13 states.
[2018-02-04 01:46:05,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:46:05,584 INFO L93 Difference]: Finished difference Result 160 states and 172 transitions.
[2018-02-04 01:46:05,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-02-04 01:46:05,584 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31
[2018-02-04 01:46:05,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:46:05,585 INFO L225 Difference]: With dead ends: 160
[2018-02-04 01:46:05,585 INFO L226 Difference]: Without dead ends: 160
[2018-02-04 01:46:05,585 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380
[2018-02-04 01:46:05,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states.
[2018-02-04 01:46:05,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 120.
[2018-02-04 01:46:05,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states.
[2018-02-04 01:46:05,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions.
[2018-02-04 01:46:05,589 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 31
[2018-02-04 01:46:05,590 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:46:05,590 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions.
[2018-02-04 01:46:05,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-02-04 01:46:05,590 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions.
[2018-02-04 01:46:05,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2018-02-04 01:46:05,591 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:46:05,591 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 01:46:05,591 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:46:05,591 INFO L82 PathProgramCache]: Analyzing trace with hash -19032104, now seen corresponding path program 1 times
[2018-02-04 01:46:05,592 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:46:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:46:05,610 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:46:05,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:05,857 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-04 01:46:05,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14
[2018-02-04 01:46:05,858 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:46:05,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:05,858 INFO L182 omatonBuilderFactory]: Interpolants [1929#true, 1930#false, 1931#(<= 1 main_~length~0), 1932#(and (= 0 |main_#t~malloc16.offset|) (= main_~length~0 (select |#length| |main_#t~malloc16.base|)) (<= 1 main_~length~0)), 1933#(and (or (and (= main_~length~0 (select |#length| main_~nondetString~0.base)) (<= 1 main_~length~0)) (= (+ main_~nondetString~0.offset main_~length~0) 1)) (= main_~nondetString~0.offset 0)), 1934#(and (= (select |#valid| main_~nondetString~0.base) 1) (or (<= 2 (+ main_~nondetString~0.offset (select |#length| main_~nondetString~0.base))) (= 0 (select (select |#memory_int| main_~nondetString~0.base) main_~nondetString~0.offset))) (= main_~nondetString~0.offset 0)), 1935#(and (or (and (= (select |#valid| |cstpncpy_#in~src.base|) 1) (<= 2 (select |#length| |cstpncpy_#in~src.base|))) (and (= (select |#valid| |cstpncpy_#in~src.base|) 1) (= 0 (select (select |#memory_int| |cstpncpy_#in~src.base|) |cstpncpy_#in~src.offset|)))) (= 0 |cstpncpy_#in~src.offset|)), 1936#(and (or (and (not (= |cstpncpy_~#dst.base| |cstpncpy_#in~src.base|)) (= 0 (select (select |#memory_int| |cstpncpy_#in~src.base|) |cstpncpy_#in~src.offset|))) (<= 2 (select |#length| |cstpncpy_#in~src.base|))) (= 0 |cstpncpy_#in~src.offset|)), 1937#(and (= 0 cstpncpy_~src.offset) (or (and (= 0 (select (select |#memory_int| cstpncpy_~src.base) cstpncpy_~src.offset)) (not (= |cstpncpy_~#dst.base| cstpncpy_~src.base))) (<= 2 (select |#length| cstpncpy_~src.base)))), 1938#(and (or (<= 2 (select |#length| cstpncpy_~s~0.base)) (and (not (= |cstpncpy_~#dst.base| cstpncpy_~s~0.base)) (= 0 (select (select |#memory_int| cstpncpy_~s~0.base) cstpncpy_~s~0.offset)))) (= 0 cstpncpy_~s~0.offset)), 1939#(and (or (<= 2 (select |#length| cstpncpy_~s~0.base)) (= 0 (select (select |#memory_int| cstpncpy_~s~0.base) cstpncpy_~s~0.offset))) (= 0 cstpncpy_~s~0.offset)), 1940#(and (<= (+ |cstpncpy_#t~post5.offset| 1) cstpncpy_~s~0.offset) (or (= 0 (select (select |#memory_int| |cstpncpy_#t~post5.base|) |cstpncpy_#t~post5.offset|)) (and (= |cstpncpy_#t~post5.base| cstpncpy_~s~0.base) (<= (+ cstpncpy_~s~0.offset 1) (+ (select |#length| |cstpncpy_#t~post5.base|) |cstpncpy_#t~post5.offset|)))) (= |cstpncpy_#t~post5.offset| 0)), 1941#(and (or (= |cstpncpy_#t~mem7| 0) (<= (+ cstpncpy_~s~0.offset 1) (select |#length| cstpncpy_~s~0.base))) (<= 1 cstpncpy_~s~0.offset)), 1942#(and (<= (+ cstpncpy_~s~0.offset 1) (select |#length| cstpncpy_~s~0.base)) (<= 1 cstpncpy_~s~0.offset)), 1943#(and (<= 1 |cstpncpy_#t~post5.offset|) (<= (+ |cstpncpy_#t~post5.offset| 1) (select |#length| |cstpncpy_#t~post5.base|)))]
[2018-02-04 01:46:05,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:05,858 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-02-04 01:46:05,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-02-04 01:46:05,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210
[2018-02-04 01:46:05,859 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 15 states.
[2018-02-04 01:46:06,178 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 49 DAG size of output 46
[2018-02-04 01:46:06,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:46:06,426 INFO L93 Difference]: Finished difference Result 140 states and 155 transitions.
[2018-02-04 01:46:06,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-02-04 01:46:06,427 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 31
[2018-02-04 01:46:06,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:46:06,428 INFO L225 Difference]: With dead ends: 140
[2018-02-04 01:46:06,428 INFO L226 Difference]: Without dead ends: 140
[2018-02-04 01:46:06,428 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462
[2018-02-04 01:46:06,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states.
[2018-02-04 01:46:06,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 125.
[2018-02-04 01:46:06,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states.
[2018-02-04 01:46:06,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 139 transitions.
[2018-02-04 01:46:06,432 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 139 transitions. Word has length 31
[2018-02-04 01:46:06,433 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:46:06,433 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 139 transitions.
[2018-02-04 01:46:06,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-02-04 01:46:06,433 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 139 transitions.
[2018-02-04 01:46:06,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2018-02-04 01:46:06,434 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:46:06,434 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 01:46:06,434 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:46:06,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1473885648, now seen corresponding path program 1 times
[2018-02-04 01:46:06,435 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:46:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:46:06,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:46:06,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:06,464 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 01:46:06,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-04 01:46:06,464 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:46:06,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:06,465 INFO L182 omatonBuilderFactory]: Interpolants [2224#false, 2225#(= |cstpncpy_#t~post4.base| cstpncpy_~d~0.base), 2226#(= 1 (select |#valid| cstpncpy_~d~0.base)), 2227#(= 1 (select |#valid| |cstpncpy_#t~post10.base|)), 2223#true]
[2018-02-04 01:46:06,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:06,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-04 01:46:06,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-04 01:46:06,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-04 01:46:06,465 INFO L87 Difference]: Start difference. First operand 125 states and 139 transitions. Second operand 5 states.
[2018-02-04 01:46:06,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:46:06,520 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions.
[2018-02-04 01:46:06,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-04 01:46:06,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32
[2018-02-04 01:46:06,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:46:06,521 INFO L225 Difference]: With dead ends: 124
[2018-02-04 01:46:06,521 INFO L226 Difference]: Without dead ends: 124
[2018-02-04 01:46:06,522 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2018-02-04 01:46:06,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states.
[2018-02-04 01:46:06,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124.
[2018-02-04 01:46:06,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states.
[2018-02-04 01:46:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions.
[2018-02-04 01:46:06,525 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 32
[2018-02-04 01:46:06,526 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:46:06,526 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions.
[2018-02-04 01:46:06,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-04 01:46:06,526 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions.
[2018-02-04 01:46:06,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2018-02-04 01:46:06,527 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:46:06,527 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 01:46:06,527 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:46:06,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1473885647, now seen corresponding path program 1 times
[2018-02-04 01:46:06,528 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:46:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:46:06,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:46:06,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:06,588 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 01:46:06,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-02-04 01:46:06,588 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:46:06,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:06,588 INFO L182 omatonBuilderFactory]: Interpolants [2480#true, 2481#false, 2482#(and (<= 1 main_~n~0) (<= main_~n~0 1)), 2483#(and (<= 1 |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| 1)), 2484#(and (<= 1 cstpncpy_~n) (<= cstpncpy_~n 1)), 2485#(and (<= |cstpncpy_#t~pre9| (* 4294967296 (div |cstpncpy_#t~pre9| 4294967296))) (< 0 (+ (div |cstpncpy_#t~pre9| 4294967296) 1)))]
[2018-02-04 01:46:06,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:06,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-04 01:46:06,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-04 01:46:06,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-04 01:46:06,589 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand 6 states.
[2018-02-04 01:46:06,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:46:06,652 INFO L93 Difference]: Finished difference Result 158 states and 167 transitions.
[2018-02-04 01:46:06,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-04 01:46:06,652 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32
[2018-02-04 01:46:06,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:46:06,653 INFO L225 Difference]: With dead ends: 158
[2018-02-04 01:46:06,653 INFO L226 Difference]: Without dead ends: 158
[2018-02-04 01:46:06,653 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2018-02-04 01:46:06,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states.
[2018-02-04 01:46:06,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 151.
[2018-02-04 01:46:06,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states.
[2018-02-04 01:46:06,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions.
[2018-02-04 01:46:06,657 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 161 transitions. Word has length 32
[2018-02-04 01:46:06,658 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:46:06,658 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 161 transitions.
[2018-02-04 01:46:06,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-04 01:46:06,658 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 161 transitions.
[2018-02-04 01:46:06,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2018-02-04 01:46:06,659 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:46:06,659 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 01:46:06,659 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:46:06,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1333337037, now seen corresponding path program 1 times
[2018-02-04 01:46:06,660 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:46:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:46:06,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:46:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:07,119 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 01:46:07,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18
[2018-02-04 01:46:07,120 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:46:07,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:07,120 INFO L182 omatonBuilderFactory]: Interpolants [2816#(and (<= 1 cstpncpy_~d~0.offset) (or (and (<= |cstpncpy_#t~pre9| (* 4294967296 (div |cstpncpy_#t~pre9| 4294967296))) (< 0 (+ (div |cstpncpy_#t~pre9| 4294967296) 1))) (<= (+ cstpncpy_~d~0.offset 1) (select |#length| cstpncpy_~d~0.base)))), 2817#(and (<= (+ |cstpncpy_#t~post10.offset| 1) (select |#length| |cstpncpy_#t~post10.base|)) (<= 1 |cstpncpy_#t~post10.offset|)), 2799#true, 2800#false, 2801#(and (<= main_~length~0 1) (or (= main_~length~0 main_~n~0) (<= 1 main_~length~0))), 2802#(and (<= main_~length~0 1) (<= 1 main_~length~0)), 2803#(and (or (not (= main_~length~0 main_~n~0)) (and (<= main_~length~0 1) (<= 1 main_~n~0))) (or (= main_~length~0 main_~n~0) (and (<= main_~length~0 1) (= (select |#valid| |main_#t~malloc15.base|) 1) (<= 1 main_~length~0) (= (select |#length| |main_#t~malloc15.base|) main_~n~0))) (= 0 |main_#t~malloc15.offset|)), 2804#(and (or (not (= main_~length~0 main_~n~0)) (and (<= main_~length~0 1) (<= 1 main_~n~0))) (or (= main_~length~0 main_~n~0) (and (<= main_~length~0 1) (= (select |#length| main_~nondetArea~0.base) main_~n~0) (= (select |#valid| main_~nondetArea~0.base) 1) (<= 1 main_~length~0))) (= 0 main_~nondetArea~0.offset)), 2805#(and (or (not (= main_~length~0 main_~n~0)) (and (<= main_~length~0 1) (<= 1 main_~n~0))) (= 0 main_~nondetArea~0.offset) (or (= main_~length~0 main_~n~0) (and (<= main_~length~0 1) (= (select |#length| main_~nondetArea~0.base) main_~n~0) (<= 1 main_~length~0)))), 2806#(and (or (and (<= 1 main_~n~0) (<= main_~n~0 1)) (not (= (select |#length| main_~nondetArea~0.base) 1))) (= 0 main_~nondetArea~0.offset)), 2807#(and (or (not (= (select |#length| |cstpncpy_#in~dst.base|) 1)) (and (<= 1 |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| 1))) (= 0 |cstpncpy_#in~dst.offset|)), 2808#(and (or (and (<= 1 |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| 1)) (not (= (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) 1))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))), 2809#(and (or (and (<= 1 cstpncpy_~n) (<= cstpncpy_~n 1)) (not (= (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) 1))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))), 2810#(and (or (not (= (select |#length| |cstpncpy_#t~mem0.base|) 1)) (and (<= 1 cstpncpy_~n) (<= cstpncpy_~n 1))) (= (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) |cstpncpy_#t~mem0.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))), 2811#(and (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (or (and (<= 1 cstpncpy_~n) (<= cstpncpy_~n 1)) (not (= (select |#length| cstpncpy_~d~0.base) 1))) (= (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) cstpncpy_~d~0.offset)), 2812#(and (= |cstpncpy_#t~mem1.offset| 0) (= |cstpncpy_#t~mem1.offset| cstpncpy_~d~0.offset) (or (and (<= 1 cstpncpy_~n) (<= cstpncpy_~n 1)) (not (= (select |#length| cstpncpy_~d~0.base) 1)))), 2813#(or (and (<= cstpncpy_~d~0.offset 0) (or (<= (+ cstpncpy_~d~0.offset 1) 0) (not (= (select |#length| cstpncpy_~d~0.base) (+ cstpncpy_~d~0.offset 1))))) (and (<= 1 cstpncpy_~n) (<= cstpncpy_~n 1))), 2814#(and (<= (+ |cstpncpy_#t~post4.offset| 1) cstpncpy_~d~0.offset) (or (and (= |cstpncpy_#t~post4.base| cstpncpy_~d~0.base) (<= cstpncpy_~d~0.offset 1) (or (not (= (select |#length| cstpncpy_~d~0.base) cstpncpy_~d~0.offset)) (<= cstpncpy_~d~0.offset 0))) (and (<= 1 cstpncpy_~n) (<= cstpncpy_~n 1)) (and (= |cstpncpy_~#dst.base| |cstpncpy_#t~post4.base|) (= 4 (select |#length| cstpncpy_~d~0.base)) (<= cstpncpy_~d~0.offset 1)))), 2815#(and (<= 1 cstpncpy_~d~0.offset) (or (and (<= 1 cstpncpy_~n) (<= cstpncpy_~n 1)) (<= (+ cstpncpy_~d~0.offset 1) (select |#length| cstpncpy_~d~0.base))))]
[2018-02-04 01:46:07,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:07,120 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states
[2018-02-04 01:46:07,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2018-02-04 01:46:07,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342
[2018-02-04 01:46:07,121 INFO L87 Difference]: Start difference. First operand 151 states and 161 transitions. Second operand 19 states.
[2018-02-04 01:46:07,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:46:07,638 INFO L93 Difference]: Finished difference Result 164 states and 173 transitions.
[2018-02-04 01:46:07,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2018-02-04 01:46:07,639 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32
[2018-02-04 01:46:07,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:46:07,639 INFO L225 Difference]: With dead ends: 164
[2018-02-04 01:46:07,639 INFO L226 Difference]: Without dead ends: 164
[2018-02-04 01:46:07,640 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056
[2018-02-04 01:46:07,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states.
[2018-02-04 01:46:07,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 155.
[2018-02-04 01:46:07,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states.
[2018-02-04 01:46:07,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 166 transitions.
[2018-02-04 01:46:07,642 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 166 transitions. Word has length 32
[2018-02-04 01:46:07,642 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:46:07,643 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 166 transitions.
[2018-02-04 01:46:07,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states.
[2018-02-04 01:46:07,643 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 166 transitions.
[2018-02-04 01:46:07,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2018-02-04 01:46:07,643 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:46:07,643 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 01:46:07,643 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:46:07,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1271297423, now seen corresponding path program 1 times
[2018-02-04 01:46:07,644 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:46:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:46:07,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:46:07,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:07,999 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 01:46:07,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2018-02-04 01:46:07,999 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:46:07,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:07,999 INFO L182 omatonBuilderFactory]: Interpolants [3168#(and (= main_~n~0 (select |#length| |main_#t~malloc15.base|)) (<= 1 main_~n~0) (= (select |#valid| |main_#t~malloc15.base|) 1) (= 0 |main_#t~malloc15.offset|)), 3169#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= (select |#valid| main_~nondetArea~0.base) 1) (<= 1 main_~n~0) (= 0 main_~nondetArea~0.offset)), 3170#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (<= 1 main_~n~0) (= 0 main_~nondetArea~0.offset)), 3171#(and (<= 1 |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| |cstpncpy_#in~dst.base|)) (= 0 |cstpncpy_#in~dst.offset|)), 3172#(and (= 0 |cstpncpy_#in~dst.offset|) (or (and (<= 1 |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| |cstpncpy_#in~dst.base|))) (and (= 4 (select |#length| |cstpncpy_~#dst.base|)) (= |cstpncpy_~#dst.base| |cstpncpy_#in~dst.base|)))), 3173#(and (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (or (and (= 4 (select |#length| |cstpncpy_~#dst.base|)) (= |cstpncpy_~#dst.base| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (and (<= 1 |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)))))), 3174#(and (or (and (<= cstpncpy_~n (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (<= 1 cstpncpy_~n)) (and (= 4 (select |#length| |cstpncpy_~#dst.base|)) (= |cstpncpy_~#dst.base| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))), 3175#(and (= (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) |cstpncpy_#t~mem0.offset|) (or (and (<= 1 cstpncpy_~n) (<= cstpncpy_~n (select |#length| |cstpncpy_#t~mem0.base|))) (and (= 4 (select |#length| |cstpncpy_~#dst.base|)) (= |cstpncpy_#t~mem0.base| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (= |cstpncpy_~#dst.base| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))), 3176#(and (or (and (= 4 (select |#length| |cstpncpy_~#dst.base|)) (= cstpncpy_~d~0.base (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (= |cstpncpy_~#dst.base| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (and (<= cstpncpy_~n (select |#length| cstpncpy_~d~0.base)) (<= 1 cstpncpy_~n))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (= (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) cstpncpy_~d~0.offset)), 3177#(and (= |cstpncpy_#t~mem1.offset| 0) (or (and (= 4 (select |#length| |cstpncpy_~#dst.base|)) (= cstpncpy_~d~0.base (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (= |cstpncpy_~#dst.base| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (and (<= cstpncpy_~n (select |#length| cstpncpy_~d~0.base)) (<= 1 cstpncpy_~n))) (= |cstpncpy_#t~mem1.offset| cstpncpy_~d~0.offset)), 3178#(or (and (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (select |#length| cstpncpy_~d~0.base)) (<= 1 cstpncpy_~n)) (and (= |cstpncpy_~#dst.base| cstpncpy_~d~0.base) (= 4 (select |#length| |cstpncpy_~#dst.base|)) (<= cstpncpy_~d~0.offset 0))), 3179#(and (or (and (= |cstpncpy_#t~post4.base| cstpncpy_~d~0.base) (<= 1 cstpncpy_~n) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| |cstpncpy_#t~post4.base|) 1))) (and (= |cstpncpy_~#dst.base| |cstpncpy_#t~post4.base|) (= 4 (select |#length| cstpncpy_~d~0.base)) (<= cstpncpy_~d~0.offset 1))) (<= (+ |cstpncpy_#t~post4.offset| 1) cstpncpy_~d~0.offset)), 3180#(and (<= 1 cstpncpy_~d~0.offset) (or (and (= 4 (select |#length| cstpncpy_~d~0.base)) (<= cstpncpy_~d~0.offset 1)) (and (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1)) (<= 1 cstpncpy_~n)))), 3181#(and (<= 1 cstpncpy_~d~0.offset) (or (<= |cstpncpy_#t~pre9| (* 4294967296 (div |cstpncpy_#t~pre9| 4294967296))) (and (= 4 (select |#length| cstpncpy_~d~0.base)) (<= cstpncpy_~d~0.offset 1)) (and (< 0 (+ (div |cstpncpy_#t~pre9| 4294967296) 1)) (<= (+ cstpncpy_~d~0.offset |cstpncpy_#t~pre9|) (select |#length| cstpncpy_~d~0.base))))), 3182#(and (<= (+ |cstpncpy_#t~post10.offset| 1) (select |#length| |cstpncpy_#t~post10.base|)) (<= 1 |cstpncpy_#t~post10.offset|)), 3165#true, 3166#false, 3167#(<= 1 main_~n~0)]
[2018-02-04 01:46:07,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:08,000 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states
[2018-02-04 01:46:08,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2018-02-04 01:46:08,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306
[2018-02-04 01:46:08,000 INFO L87 Difference]: Start difference. First operand 155 states and 166 transitions. Second operand 18 states.
[2018-02-04 01:46:08,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:46:08,635 INFO L93 Difference]: Finished difference Result 162 states and 174 transitions.
[2018-02-04 01:46:08,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2018-02-04 01:46:08,636 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32
[2018-02-04 01:46:08,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:46:08,637 INFO L225 Difference]: With dead ends: 162
[2018-02-04 01:46:08,637 INFO L226 Difference]: Without dead ends: 162
[2018-02-04 01:46:08,638 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=757, Unknown=0, NotChecked=0, Total=870
[2018-02-04 01:46:08,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states.
[2018-02-04 01:46:08,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160.
[2018-02-04 01:46:08,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states.
[2018-02-04 01:46:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 172 transitions.
[2018-02-04 01:46:08,642 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 172 transitions. Word has length 32
[2018-02-04 01:46:08,642 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:46:08,642 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 172 transitions.
[2018-02-04 01:46:08,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states.
[2018-02-04 01:46:08,643 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 172 transitions.
[2018-02-04 01:46:08,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2018-02-04 01:46:08,643 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:46:08,643 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-04 01:46:08,643 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:46:08,643 INFO L82 PathProgramCache]: Analyzing trace with hash -589995253, now seen corresponding path program 1 times
[2018-02-04 01:46:08,644 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:46:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:46:08,656 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:46:09,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:09,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-04 01:46:09,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18
[2018-02-04 01:46:09,029 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:46:09,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:09,029 INFO L182 omatonBuilderFactory]: Interpolants [3529#true, 3530#false, 3531#(<= 1 main_~n~0), 3532#(and (= main_~n~0 (select |#length| |main_#t~malloc15.base|)) (<= 1 main_~n~0) (= (select |#valid| |main_#t~malloc15.base|) 1) (= 0 |main_#t~malloc15.offset|)), 3533#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= (select |#valid| main_~nondetArea~0.base) 1) (<= 1 main_~n~0) (= 0 main_~nondetArea~0.offset)), 3534#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (<= 1 main_~n~0) (= 0 main_~nondetArea~0.offset)), 3535#(and (<= 1 |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| |cstpncpy_#in~dst.base|)) (= 0 |cstpncpy_#in~dst.offset|)), 3536#(and (or (= 4 (select |#length| |cstpncpy_#in~dst.base|)) (and (<= 1 |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| |cstpncpy_#in~dst.base|)))) (= 0 |cstpncpy_#in~dst.offset|)), 3537#(and (or (and (<= 1 |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))), 3538#(and (or (and (<= cstpncpy_~n (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (<= 1 cstpncpy_~n)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))), 3539#(and (= (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) |cstpncpy_#t~mem0.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (or (= 4 (select |#length| |cstpncpy_#t~mem0.base|)) (and (<= 1 cstpncpy_~n) (<= cstpncpy_~n (select |#length| |cstpncpy_#t~mem0.base|))))), 3540#(and (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (= (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) cstpncpy_~d~0.offset) (or (= 4 (select |#length| cstpncpy_~d~0.base)) (and (<= cstpncpy_~n (select |#length| cstpncpy_~d~0.base)) (<= 1 cstpncpy_~n)))), 3541#(and (= |cstpncpy_#t~mem1.offset| 0) (= |cstpncpy_#t~mem1.offset| cstpncpy_~d~0.offset) (or (= 4 (select |#length| cstpncpy_~d~0.base)) (and (<= cstpncpy_~n (select |#length| cstpncpy_~d~0.base)) (<= 1 cstpncpy_~n)))), 3542#(and (or (= 4 (select |#length| cstpncpy_~d~0.base)) (and (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (select |#length| cstpncpy_~d~0.base)) (<= 1 cstpncpy_~n))) (<= cstpncpy_~d~0.offset 0)), 3543#(and (<= cstpncpy_~d~0.offset 1) (or (= 4 (select |#length| cstpncpy_~d~0.base)) (and (= |cstpncpy_#t~post4.base| cstpncpy_~d~0.base) (<= 1 cstpncpy_~n) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| |cstpncpy_#t~post4.base|) 1)))) (<= (+ |cstpncpy_#t~post4.offset| 1) cstpncpy_~d~0.offset)), 3544#(and (or (= 4 (select |#length| cstpncpy_~d~0.base)) (and (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1)) (<= 1 cstpncpy_~n))) (<= 1 cstpncpy_~d~0.offset) (<= cstpncpy_~d~0.offset 1)), 3545#(and (or (= 4 (select |#length| cstpncpy_~d~0.base)) (and (or (<= (+ cstpncpy_~d~0.offset |cstpncpy_#t~pre3|) (select |#length| cstpncpy_~d~0.base)) (<= |cstpncpy_#t~pre3| (* 4294967296 (div |cstpncpy_#t~pre3| 4294967296)))) (< 0 (+ (div |cstpncpy_#t~pre3| 4294967296) 1)))) (<= 1 cstpncpy_~d~0.offset) (<= cstpncpy_~d~0.offset 1)), 3546#(and (<= 1 cstpncpy_~d~0.offset) (<= cstpncpy_~d~0.offset 1) (<= (+ cstpncpy_~d~0.offset 1) (select |#length| cstpncpy_~d~0.base))), 3547#(and (<= (+ |cstpncpy_#t~post4.offset| 1) (select |#length| |cstpncpy_#t~post4.base|)) (<= 1 |cstpncpy_#t~post4.offset|) (or (<= |cstpncpy_#t~post4.offset| 1) (not (= (select |#length| |cstpncpy_#t~post4.base|) 4))))]
[2018-02-04 01:46:09,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:09,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states
[2018-02-04 01:46:09,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2018-02-04 01:46:09,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342
[2018-02-04 01:46:09,030 INFO L87 Difference]: Start difference. First operand 160 states and 172 transitions. Second operand 19 states.
[2018-02-04 01:46:09,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:46:09,660 INFO L93 Difference]: Finished difference Result 162 states and 175 transitions.
[2018-02-04 01:46:09,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2018-02-04 01:46:09,660 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32
[2018-02-04 01:46:09,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:46:09,661 INFO L225 Difference]: With dead ends: 162
[2018-02-04 01:46:09,661 INFO L226 Difference]: Without dead ends: 162
[2018-02-04 01:46:09,661 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=990, Unknown=0, NotChecked=0, Total=1122
[2018-02-04 01:46:09,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states.
[2018-02-04 01:46:09,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161.
[2018-02-04 01:46:09,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states.
[2018-02-04 01:46:09,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 173 transitions.
[2018-02-04 01:46:09,665 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 173 transitions. Word has length 32
[2018-02-04 01:46:09,665 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:46:09,665 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 173 transitions.
[2018-02-04 01:46:09,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states.
[2018-02-04 01:46:09,665 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions.
[2018-02-04 01:46:09,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2018-02-04 01:46:09,666 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:46:09,666 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 01:46:09,666 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:46:09,666 INFO L82 PathProgramCache]: Analyzing trace with hash 449987274, now seen corresponding path program 1 times
[2018-02-04 01:46:09,667 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:46:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:46:09,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:46:10,088 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-04 01:46:10,088 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-04 01:46:10,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19
[2018-02-04 01:46:10,088 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:46:10,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:10,089 INFO L182 omatonBuilderFactory]: Interpolants [3904#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= (select |#valid| main_~nondetArea~0.base) 1) (= 0 main_~nondetArea~0.offset)), 3905#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= 0 main_~nondetArea~0.offset)), 3906#(and (<= (select |#length| |cstpncpy_#in~dst.base|) |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| |cstpncpy_#in~dst.base|)) (= 0 |cstpncpy_#in~dst.offset|)), 3907#(and (or (and (= 4 (select |#length| |cstpncpy_~#dst.base|)) (= |cstpncpy_~#dst.base| |cstpncpy_#in~dst.base|)) (and (<= (select |#length| |cstpncpy_#in~dst.base|) |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| |cstpncpy_#in~dst.base|)))) (= 0 |cstpncpy_#in~dst.offset|)), 3908#(and (or (and (= 4 (select |#length| |cstpncpy_~#dst.base|)) (= |cstpncpy_~#dst.base| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (and (<= (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))), 3909#(and (or (and (= 4 (select |#length| |cstpncpy_~#dst.base|)) (= |cstpncpy_~#dst.base| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (and (<= cstpncpy_~n (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (<= (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) cstpncpy_~n))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))), 3910#(and (= (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) |cstpncpy_#t~mem0.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (or (and (= 4 (select |#length| |cstpncpy_~#dst.base|)) (= |cstpncpy_~#dst.base| |cstpncpy_#t~mem0.base|)) (and (<= (select |#length| |cstpncpy_#t~mem0.base|) cstpncpy_~n) (<= cstpncpy_~n (select |#length| |cstpncpy_#t~mem0.base|))))), 3911#(and (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (or (and (<= cstpncpy_~n (select |#length| cstpncpy_~d~0.base)) (<= (select |#length| cstpncpy_~d~0.base) cstpncpy_~n)) (and (= |cstpncpy_~#dst.base| cstpncpy_~d~0.base) (= 4 (select |#length| |cstpncpy_~#dst.base|)))) (= (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) cstpncpy_~d~0.offset)), 3912#(and (= |cstpncpy_#t~mem1.offset| 0) (= |cstpncpy_#t~mem1.offset| cstpncpy_~d~0.offset) (or (and (<= cstpncpy_~n (select |#length| cstpncpy_~d~0.base)) (<= (select |#length| cstpncpy_~d~0.base) cstpncpy_~n)) (and (= |cstpncpy_~#dst.base| cstpncpy_~d~0.base) (= 4 (select |#length| |cstpncpy_~#dst.base|))))), 3913#(or (and (= |cstpncpy_~#dst.base| cstpncpy_~d~0.base) (= 4 (select |#length| |cstpncpy_~#dst.base|)) (<= cstpncpy_~d~0.offset 0)) (and (<= (select |#length| cstpncpy_~d~0.base) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (select |#length| cstpncpy_~d~0.base)))), 3914#(and (or (and (= 4 (select |#length| cstpncpy_~d~0.base)) (= |cstpncpy_#t~post4.base| |cstpncpy_~#dst.base|) (<= cstpncpy_~d~0.offset 1)) (and (= |cstpncpy_#t~post4.base| cstpncpy_~d~0.base) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| |cstpncpy_#t~post4.base|) 1)) (<= (+ (select |#length| |cstpncpy_#t~post4.base|) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)))) (<= (+ |cstpncpy_#t~post4.offset| 1) cstpncpy_~d~0.offset)), 3915#(and (<= 1 cstpncpy_~d~0.offset) (or (and (<= (+ (select |#length| cstpncpy_~d~0.base) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1))) (and (= 4 (select |#length| cstpncpy_~d~0.base)) (<= cstpncpy_~d~0.offset 1)))), 3916#(and (or (and (= 4 (select |#length| cstpncpy_~d~0.base)) (<= cstpncpy_~d~0.offset 1)) (and (<= (select |#length| cstpncpy_~d~0.base) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (select |#length| cstpncpy_~d~0.base)))) (<= 1 cstpncpy_~d~0.offset)), 3917#(and (<= 2 cstpncpy_~d~0.offset) (= |cstpncpy_#t~post10.base| cstpncpy_~d~0.base) (or (and (<= (select |#length| |cstpncpy_#t~post10.base|) (+ |cstpncpy_#t~post10.offset| cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| |cstpncpy_#t~post10.base|) 1))) (and (<= cstpncpy_~d~0.offset 2) (= 4 (select |#length| |cstpncpy_#t~post10.base|))))), 3918#(and (<= 2 cstpncpy_~d~0.offset) (or (<= (+ cstpncpy_~d~0.offset 2) (select |#length| cstpncpy_~d~0.base)) (and (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1)) (<= 1 cstpncpy_~n)))), 3919#(and (or (and (< 0 (+ (div |cstpncpy_#t~pre9| 4294967296) 1)) (or (<= |cstpncpy_#t~pre9| (* 4294967296 (div |cstpncpy_#t~pre9| 4294967296))) (<= (+ cstpncpy_~d~0.offset |cstpncpy_#t~pre9|) (select |#length| cstpncpy_~d~0.base)))) (<= (+ cstpncpy_~d~0.offset 2) (select |#length| cstpncpy_~d~0.base))) (<= 2 cstpncpy_~d~0.offset)), 3920#(and (<= (+ |cstpncpy_#t~post10.offset| 1) (select |#length| |cstpncpy_#t~post10.base|)) (<= 2 |cstpncpy_#t~post10.offset|)), 3901#true, 3902#false, 3903#(and (= main_~n~0 (select |#length| |main_#t~malloc15.base|)) (= (select |#valid| |main_#t~malloc15.base|) 1) (= 0 |main_#t~malloc15.offset|))]
[2018-02-04 01:46:10,089 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-04 01:46:10,089 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states
[2018-02-04 01:46:10,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2018-02-04 01:46:10,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380
[2018-02-04 01:46:10,089 INFO L87 Difference]: Start difference. First operand 161 states and 173 transitions. Second operand 20 states.
[2018-02-04 01:46:11,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:46:11,005 INFO L93 Difference]: Finished difference Result 185 states and 199 transitions.
[2018-02-04 01:46:11,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-02-04 01:46:11,005 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37
[2018-02-04 01:46:11,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:46:11,006 INFO L225 Difference]: With dead ends: 185
[2018-02-04 01:46:11,006 INFO L226 Difference]: Without dead ends: 185
[2018-02-04 01:46:11,006 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=139, Invalid=1193, Unknown=0, NotChecked=0, Total=1332
[2018-02-04 01:46:11,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states.
[2018-02-04 01:46:11,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 171.
[2018-02-04 01:46:11,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states.
[2018-02-04 01:46:11,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 185 transitions.
[2018-02-04 01:46:11,010 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 185 transitions. Word has length 37
[2018-02-04 01:46:11,010 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:46:11,010 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 185 transitions.
[2018-02-04 01:46:11,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states.
[2018-02-04 01:46:11,010 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 185 transitions.
[2018-02-04 01:46:11,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2018-02-04 01:46:11,010 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:46:11,010 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 01:46:11,010 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:46:11,011 INFO L82 PathProgramCache]: Analyzing trace with hash -490194150, now seen corresponding path program 2 times
[2018-02-04 01:46:11,011 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:46:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:46:11,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:46:11,378 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-04 01:46:11,379 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-04 01:46:11,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20
[2018-02-04 01:46:11,379 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:46:11,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:11,379 INFO L182 omatonBuilderFactory]: Interpolants [4320#(and (or (<= (select |#length| |cstpncpy_#in~src.base|) 1) (and (not (= (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) |cstpncpy_#in~src.base|)) (not (= |cstpncpy_~#dst.base| |cstpncpy_#in~src.base|)) (= 0 (select (select |#memory_int| |cstpncpy_#in~src.base|) 1))) (<= 3 (select |#length| |cstpncpy_#in~src.base|))) (= 0 |cstpncpy_#in~src.offset|)), 4321#(and (= 0 cstpncpy_~src.offset) (or (<= (select |#length| cstpncpy_~src.base) 1) (and (= 0 (select (select |#memory_int| cstpncpy_~src.base) 1)) (not (= (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) cstpncpy_~src.base)) (not (= |cstpncpy_~#dst.base| cstpncpy_~src.base))) (<= 3 (select |#length| cstpncpy_~src.base)))), 4322#(and (= 0 cstpncpy_~src.offset) (or (<= (select |#length| cstpncpy_~src.base) 1) (and (= 0 (select (select |#memory_int| cstpncpy_~src.base) 1)) (= |cstpncpy_#t~mem0.base| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (not (= (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) cstpncpy_~src.base)) (not (= |cstpncpy_~#dst.base| cstpncpy_~src.base))) (<= 3 (select |#length| cstpncpy_~src.base)))), 4323#(and (= 0 cstpncpy_~s~0.offset) (or (<= 3 (select |#length| cstpncpy_~s~0.base)) (<= (select |#length| cstpncpy_~s~0.base) 1) (and (= 0 (select (select |#memory_int| cstpncpy_~s~0.base) 1)) (= cstpncpy_~d~0.base (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (not (= |cstpncpy_~#dst.base| cstpncpy_~s~0.base)) (not (= (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) cstpncpy_~s~0.base))))), 4324#(and (= 0 cstpncpy_~s~0.offset) (or (<= 3 (select |#length| cstpncpy_~s~0.base)) (<= (select |#length| cstpncpy_~s~0.base) 1) (and (not (= cstpncpy_~d~0.base cstpncpy_~s~0.base)) (= 0 (select (select |#memory_int| cstpncpy_~s~0.base) 1))))), 4325#(and (or (and (<= (+ |cstpncpy_#t~post5.offset| 1) cstpncpy_~s~0.offset) (not (= |cstpncpy_#t~post5.base| |cstpncpy_#t~post4.base|)) (= |cstpncpy_#t~post5.base| cstpncpy_~s~0.base) (<= cstpncpy_~s~0.offset (+ |cstpncpy_#t~post5.offset| 1)) (= 0 (select (select |#memory_int| |cstpncpy_#t~post5.base|) 1))) (and (<= (+ |cstpncpy_#t~post5.offset| 1) cstpncpy_~s~0.offset) (= |cstpncpy_#t~post5.base| cstpncpy_~s~0.base) (or (<= (+ (select |#length| |cstpncpy_#t~post5.base|) |cstpncpy_#t~post5.offset|) cstpncpy_~s~0.offset) (<= (+ cstpncpy_~s~0.offset 2) (+ (select |#length| |cstpncpy_#t~post5.base|) |cstpncpy_#t~post5.offset|))))) (= |cstpncpy_#t~post5.offset| 0)), 4326#(or (and (<= 1 cstpncpy_~s~0.offset) (= 0 (select (select (store |#memory_int| |cstpncpy_#t~post4.base| (store (select |#memory_int| |cstpncpy_#t~post4.base|) |cstpncpy_#t~post4.offset| |cstpncpy_#t~mem7|)) cstpncpy_~s~0.base) 1)) (<= cstpncpy_~s~0.offset 1)) (and (or (<= (+ cstpncpy_~s~0.offset 2) (select |#length| cstpncpy_~s~0.base)) (<= (select |#length| cstpncpy_~s~0.base) cstpncpy_~s~0.offset)) (<= 1 cstpncpy_~s~0.offset))), 4327#(or (and (= 0 (select (select |#memory_int| cstpncpy_~s~0.base) 1)) (<= 1 cstpncpy_~s~0.offset) (<= cstpncpy_~s~0.offset 1)) (and (or (<= (+ cstpncpy_~s~0.offset 2) (select |#length| cstpncpy_~s~0.base)) (<= (select |#length| cstpncpy_~s~0.base) cstpncpy_~s~0.offset)) (<= 1 cstpncpy_~s~0.offset))), 4328#(or (and (= |cstpncpy_#t~post5.base| cstpncpy_~s~0.base) (<= 2 cstpncpy_~s~0.offset) (or (<= (+ cstpncpy_~s~0.offset 1) (select |#length| |cstpncpy_#t~post5.base|)) (<= (select |#length| |cstpncpy_#t~post5.base|) |cstpncpy_#t~post5.offset|))) (and (= 1 |cstpncpy_#t~post5.offset|) (= 0 (select (select |#memory_int| |cstpncpy_#t~post5.base|) |cstpncpy_#t~post5.offset|)))), 4329#(or (= |cstpncpy_#t~mem7| 0) (and (<= (+ cstpncpy_~s~0.offset 1) (select |#length| cstpncpy_~s~0.base)) (<= 2 cstpncpy_~s~0.offset))), 4330#(and (<= (+ cstpncpy_~s~0.offset 1) (select |#length| cstpncpy_~s~0.base)) (<= 2 cstpncpy_~s~0.offset)), 4331#(and (<= 2 |cstpncpy_#t~post5.offset|) (<= (+ |cstpncpy_#t~post5.offset| 1) (select |#length| |cstpncpy_#t~post5.base|))), 4311#true, 4312#false, 4313#(= (select |#valid| |main_#t~malloc15.base|) 1), 4314#(= (select |#valid| main_~nondetArea~0.base) 1), 4315#(and (not (= main_~nondetArea~0.base |main_#t~malloc16.base|)) (= 0 |main_#t~malloc16.offset|) (= main_~length~0 (select |#length| |main_#t~malloc16.base|))), 4316#(and (or (= main_~length~0 (select |#length| main_~nondetString~0.base)) (= (+ main_~nondetString~0.offset main_~length~0) 2)) (= 0 main_~nondetString~0.offset) (or (not (= main_~nondetArea~0.base main_~nondetString~0.base)) (not (= (+ main_~nondetString~0.offset main_~length~0) 2)))), 4317#(and (or (<= (+ main_~nondetString~0.offset (select |#length| main_~nondetString~0.base)) 1) (and (not (= main_~nondetArea~0.base main_~nondetString~0.base)) (= 0 (select (select |#memory_int| main_~nondetString~0.base) 1))) (<= 3 (+ main_~nondetString~0.offset (select |#length| main_~nondetString~0.base)))) (= (select |#valid| main_~nondetString~0.base) 1) (= 0 main_~nondetString~0.offset)), 4318#(and (or (and (= (select |#valid| |cstpncpy_#in~src.base|) 1) (= 0 (select (select |#memory_int| |cstpncpy_#in~src.base|) 1)) (not (= |cstpncpy_#in~dst.base| |cstpncpy_#in~src.base|))) (and (or (<= (select |#length| |cstpncpy_#in~src.base|) 1) (<= 3 (select |#length| |cstpncpy_#in~src.base|))) (= (select |#valid| |cstpncpy_#in~src.base|) 1))) (= 0 |cstpncpy_#in~src.offset|)), 4319#(and (= 0 |cstpncpy_#in~src.offset|) (or (<= (select |#length| |cstpncpy_#in~src.base|) 1) (and (not (= |cstpncpy_~#dst.base| |cstpncpy_#in~src.base|)) (= 0 (select (select |#memory_int| |cstpncpy_#in~src.base|) 1)) (not (= |cstpncpy_#in~dst.base| |cstpncpy_#in~src.base|))) (<= 3 (select |#length| |cstpncpy_#in~src.base|))))]
[2018-02-04 01:46:11,379 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-04 01:46:11,379 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states
[2018-02-04 01:46:11,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2018-02-04 01:46:11,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420
[2018-02-04 01:46:11,380 INFO L87 Difference]: Start difference. First operand 171 states and 185 transitions. Second operand 21 states.
[2018-02-04 01:46:12,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:46:12,167 INFO L93 Difference]: Finished difference Result 197 states and 215 transitions.
[2018-02-04 01:46:12,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2018-02-04 01:46:12,167 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 37
[2018-02-04 01:46:12,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:46:12,168 INFO L225 Difference]: With dead ends: 197
[2018-02-04 01:46:12,168 INFO L226 Difference]: Without dead ends: 197
[2018-02-04 01:46:12,169 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=130, Invalid=926, Unknown=0, NotChecked=0, Total=1056
[2018-02-04 01:46:12,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states.
[2018-02-04 01:46:12,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 176.
[2018-02-04 01:46:12,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states.
[2018-02-04 01:46:12,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 192 transitions.
[2018-02-04 01:46:12,173 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 192 transitions. Word has length 37
[2018-02-04 01:46:12,173 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:46:12,173 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 192 transitions.
[2018-02-04 01:46:12,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states.
[2018-02-04 01:46:12,173 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 192 transitions.
[2018-02-04 01:46:12,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2018-02-04 01:46:12,174 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:46:12,174 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 01:46:12,174 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:46:12,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1302548335, now seen corresponding path program 1 times
[2018-02-04 01:46:12,175 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:46:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:46:12,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:46:12,604 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-04 01:46:12,604 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-04 01:46:12,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19
[2018-02-04 01:46:12,604 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:46:12,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:12,605 INFO L182 omatonBuilderFactory]: Interpolants [4736#(and (or (and (<= (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))), 4737#(and (or (= 4 (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (and (<= cstpncpy_~n (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (<= (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) cstpncpy_~n))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))), 4738#(and (or (= 4 (select |#length| |cstpncpy_#t~mem0.base|)) (and (<= (select |#length| |cstpncpy_#t~mem0.base|) cstpncpy_~n) (<= cstpncpy_~n (select |#length| |cstpncpy_#t~mem0.base|)))) (= (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) |cstpncpy_#t~mem0.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))), 4739#(and (or (and (<= cstpncpy_~n (select |#length| cstpncpy_~d~0.base)) (<= (select |#length| cstpncpy_~d~0.base) cstpncpy_~n)) (= 4 (select |#length| cstpncpy_~d~0.base))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (= (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) cstpncpy_~d~0.offset)), 4740#(and (= |cstpncpy_#t~mem1.offset| 0) (= |cstpncpy_#t~mem1.offset| cstpncpy_~d~0.offset) (or (and (<= cstpncpy_~n (select |#length| cstpncpy_~d~0.base)) (<= (select |#length| cstpncpy_~d~0.base) cstpncpy_~n)) (= 4 (select |#length| cstpncpy_~d~0.base)))), 4741#(or (and (= 4 (select |#length| cstpncpy_~d~0.base)) (<= cstpncpy_~d~0.offset 0)) (and (<= (select |#length| cstpncpy_~d~0.base) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (select |#length| cstpncpy_~d~0.base)))), 4742#(and (<= (+ |cstpncpy_#t~post4.offset| 1) cstpncpy_~d~0.offset) (or (and (= 4 (select |#length| cstpncpy_~d~0.base)) (<= cstpncpy_~d~0.offset 1)) (and (= |cstpncpy_#t~post4.base| cstpncpy_~d~0.base) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| |cstpncpy_#t~post4.base|) 1)) (<= (+ (select |#length| |cstpncpy_#t~post4.base|) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n))))), 4743#(and (<= 1 cstpncpy_~d~0.offset) (or (and (<= (+ (select |#length| cstpncpy_~d~0.base) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1))) (and (= 4 (select |#length| cstpncpy_~d~0.base)) (<= cstpncpy_~d~0.offset 1)))), 4744#(and (or (and (= 4 (select |#length| cstpncpy_~d~0.base)) (<= cstpncpy_~d~0.offset 1)) (and (<= (select |#length| cstpncpy_~d~0.base) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (select |#length| cstpncpy_~d~0.base)))) (<= 1 cstpncpy_~d~0.offset)), 4745#(and (or (and (<= cstpncpy_~d~0.offset (+ |cstpncpy_#t~post4.offset| 1)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| |cstpncpy_#t~post4.base|) 1)) (<= (+ (select |#length| |cstpncpy_#t~post4.base|) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n))) (and (<= cstpncpy_~d~0.offset 2) (= (select |#length| |cstpncpy_#t~post4.base|) 4))) (= |cstpncpy_#t~post4.base| cstpncpy_~d~0.base) (<= 2 cstpncpy_~d~0.offset)), 4746#(and (or (<= (+ cstpncpy_~d~0.offset 1) (select |#length| cstpncpy_~d~0.base)) (and (<= (+ (select |#length| cstpncpy_~d~0.base) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1)) (<= cstpncpy_~d~0.offset (select |#length| cstpncpy_~d~0.base)))) (<= 2 cstpncpy_~d~0.offset)), 4747#(and (or (and (<= |cstpncpy_#t~pre9| (* 4294967296 (div |cstpncpy_#t~pre9| 4294967296))) (<= (select |#length| cstpncpy_~d~0.base) (+ cstpncpy_~d~0.offset |cstpncpy_#t~pre9|)) (<= cstpncpy_~d~0.offset (select |#length| cstpncpy_~d~0.base))) (<= (+ cstpncpy_~d~0.offset 1) (select |#length| cstpncpy_~d~0.base))) (<= 2 cstpncpy_~d~0.offset)), 4748#(and (<= (+ |cstpncpy_#t~post10.offset| 1) (select |#length| |cstpncpy_#t~post10.base|)) (<= 2 |cstpncpy_#t~post10.offset|)), 4729#true, 4730#false, 4731#(and (= main_~n~0 (select |#length| |main_#t~malloc15.base|)) (= (select |#valid| |main_#t~malloc15.base|) 1) (= 0 |main_#t~malloc15.offset|)), 4732#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= (select |#valid| main_~nondetArea~0.base) 1) (= 0 main_~nondetArea~0.offset)), 4733#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= 0 main_~nondetArea~0.offset)), 4734#(and (<= (select |#length| |cstpncpy_#in~dst.base|) |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| |cstpncpy_#in~dst.base|)) (= 0 |cstpncpy_#in~dst.offset|)), 4735#(and (or (= 4 (select |#length| |cstpncpy_#in~dst.base|)) (and (<= (select |#length| |cstpncpy_#in~dst.base|) |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| |cstpncpy_#in~dst.base|)))) (= 0 |cstpncpy_#in~dst.offset|))]
[2018-02-04 01:46:12,605 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-04 01:46:12,605 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states
[2018-02-04 01:46:12,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2018-02-04 01:46:12,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380
[2018-02-04 01:46:12,605 INFO L87 Difference]: Start difference. First operand 176 states and 192 transitions. Second operand 20 states.
[2018-02-04 01:46:13,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:46:13,415 INFO L93 Difference]: Finished difference Result 194 states and 211 transitions.
[2018-02-04 01:46:13,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2018-02-04 01:46:13,415 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38
[2018-02-04 01:46:13,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:46:13,416 INFO L225 Difference]: With dead ends: 194
[2018-02-04 01:46:13,416 INFO L226 Difference]: Without dead ends: 194
[2018-02-04 01:46:13,416 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=139, Invalid=1193, Unknown=0, NotChecked=0, Total=1332
[2018-02-04 01:46:13,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states.
[2018-02-04 01:46:13,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 177.
[2018-02-04 01:46:13,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states.
[2018-02-04 01:46:13,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 193 transitions.
[2018-02-04 01:46:13,419 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 193 transitions. Word has length 38
[2018-02-04 01:46:13,419 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:46:13,419 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 193 transitions.
[2018-02-04 01:46:13,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states.
[2018-02-04 01:46:13,419 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 193 transitions.
[2018-02-04 01:46:13,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2018-02-04 01:46:13,420 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:46:13,422 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-04 01:46:13,422 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:46:13,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1983850505, now seen corresponding path program 2 times
[2018-02-04 01:46:13,423 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:46:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:46:13,434 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:46:13,966 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-04 01:46:13,966 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-04 01:46:13,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20
[2018-02-04 01:46:13,966 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:46:13,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:13,967 INFO L182 omatonBuilderFactory]: Interpolants [5154#true, 5155#false, 5156#(and (= main_~n~0 (select |#length| |main_#t~malloc15.base|)) (= (select |#valid| |main_#t~malloc15.base|) 1) (= 0 |main_#t~malloc15.offset|)), 5157#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= (select |#valid| main_~nondetArea~0.base) 1) (= 0 main_~nondetArea~0.offset)), 5158#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= 0 main_~nondetArea~0.offset)), 5159#(and (<= (select |#length| |cstpncpy_#in~dst.base|) |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| |cstpncpy_#in~dst.base|)) (= 0 |cstpncpy_#in~dst.offset|)), 5160#(and (or (= 4 (select |#length| |cstpncpy_#in~dst.base|)) (and (<= (select |#length| |cstpncpy_#in~dst.base|) |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| |cstpncpy_#in~dst.base|)))) (= 0 |cstpncpy_#in~dst.offset|)), 5161#(and (or (and (<= (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))), 5162#(and (or (= 4 (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (and (<= cstpncpy_~n (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (<= (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) cstpncpy_~n))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))), 5163#(and (or (= 4 (select |#length| |cstpncpy_#t~mem0.base|)) (and (<= (select |#length| |cstpncpy_#t~mem0.base|) cstpncpy_~n) (<= cstpncpy_~n (select |#length| |cstpncpy_#t~mem0.base|)))) (= (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) |cstpncpy_#t~mem0.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))), 5164#(and (or (and (<= cstpncpy_~n (select |#length| cstpncpy_~d~0.base)) (<= (select |#length| cstpncpy_~d~0.base) cstpncpy_~n)) (= 4 (select |#length| cstpncpy_~d~0.base))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (= (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) cstpncpy_~d~0.offset)), 5165#(and (= |cstpncpy_#t~mem1.offset| 0) (= |cstpncpy_#t~mem1.offset| cstpncpy_~d~0.offset) (or (and (<= cstpncpy_~n (select |#length| cstpncpy_~d~0.base)) (<= (select |#length| cstpncpy_~d~0.base) cstpncpy_~n)) (= 4 (select |#length| cstpncpy_~d~0.base)))), 5166#(or (and (= 4 (select |#length| cstpncpy_~d~0.base)) (<= cstpncpy_~d~0.offset 0)) (and (<= (select |#length| cstpncpy_~d~0.base) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (select |#length| cstpncpy_~d~0.base)))), 5167#(and (<= (+ |cstpncpy_#t~post4.offset| 1) cstpncpy_~d~0.offset) (or (and (= 4 (select |#length| cstpncpy_~d~0.base)) (<= cstpncpy_~d~0.offset 1)) (and (= |cstpncpy_#t~post4.base| cstpncpy_~d~0.base) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| |cstpncpy_#t~post4.base|) 1)) (<= (+ (select |#length| |cstpncpy_#t~post4.base|) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n))))), 5168#(and (<= 1 cstpncpy_~d~0.offset) (or (and (<= (+ (select |#length| cstpncpy_~d~0.base) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1))) (and (= 4 (select |#length| cstpncpy_~d~0.base)) (<= cstpncpy_~d~0.offset 1)))), 5169#(and (or (and (= 4 (select |#length| cstpncpy_~d~0.base)) (<= cstpncpy_~d~0.offset 1)) (and (<= (select |#length| cstpncpy_~d~0.base) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (select |#length| cstpncpy_~d~0.base)))) (<= 1 cstpncpy_~d~0.offset)), 5170#(and (or (and (<= cstpncpy_~d~0.offset (+ |cstpncpy_#t~post4.offset| 1)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| |cstpncpy_#t~post4.base|) 1)) (<= (+ (select |#length| |cstpncpy_#t~post4.base|) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n))) (and (<= cstpncpy_~d~0.offset 2) (= (select |#length| |cstpncpy_#t~post4.base|) 4))) (= |cstpncpy_#t~post4.base| cstpncpy_~d~0.base) (<= 2 cstpncpy_~d~0.offset)), 5171#(and (or (<= (+ cstpncpy_~d~0.offset 2) (select |#length| cstpncpy_~d~0.base)) (and (<= (+ (select |#length| cstpncpy_~d~0.base) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1)) (<= cstpncpy_~d~0.offset (select |#length| cstpncpy_~d~0.base)))) (<= 2 cstpncpy_~d~0.offset)), 5172#(and (or (and (or (<= (+ cstpncpy_~d~0.offset |cstpncpy_#t~pre3|) (select |#length| cstpncpy_~d~0.base)) (<= |cstpncpy_#t~pre3| (* 4294967296 (div |cstpncpy_#t~pre3| 4294967296)))) (<= cstpncpy_~d~0.offset (select |#length| cstpncpy_~d~0.base)) (< 0 (+ (div |cstpncpy_#t~pre3| 4294967296) 1))) (<= (+ cstpncpy_~d~0.offset 2) (select |#length| cstpncpy_~d~0.base))) (<= 2 cstpncpy_~d~0.offset)), 5173#(and (<= 2 cstpncpy_~d~0.offset) (<= (+ cstpncpy_~d~0.offset 1) (select |#length| cstpncpy_~d~0.base))), 5174#(and (<= (+ |cstpncpy_#t~post4.offset| 1) (select |#length| |cstpncpy_#t~post4.base|)) (<= 2 |cstpncpy_#t~post4.offset|))]
[2018-02-04 01:46:13,967 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-04 01:46:13,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states
[2018-02-04 01:46:13,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2018-02-04 01:46:13,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420
[2018-02-04 01:46:13,967 INFO L87 Difference]: Start difference. First operand 177 states and 193 transitions. Second operand 21 states.
[2018-02-04 01:46:14,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:46:14,760 INFO L93 Difference]: Finished difference Result 193 states and 210 transitions.
[2018-02-04 01:46:14,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-02-04 01:46:14,760 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38
[2018-02-04 01:46:14,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:46:14,761 INFO L225 Difference]: With dead ends: 193
[2018-02-04 01:46:14,761 INFO L226 Difference]: Without dead ends: 193
[2018-02-04 01:46:14,761 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=1337, Unknown=0, NotChecked=0, Total=1482
[2018-02-04 01:46:14,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states.
[2018-02-04 01:46:14,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 178.
[2018-02-04 01:46:14,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states.
[2018-02-04 01:46:14,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 194 transitions.
[2018-02-04 01:46:14,764 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 194 transitions. Word has length 38
[2018-02-04 01:46:14,765 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:46:14,765 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 194 transitions.
[2018-02-04 01:46:14,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states.
[2018-02-04 01:46:14,765 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 194 transitions.
[2018-02-04 01:46:14,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2018-02-04 01:46:14,765 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:46:14,766 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 01:46:14,766 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:46:14,766 INFO L82 PathProgramCache]: Analyzing trace with hash -503906977, now seen corresponding path program 1 times
[2018-02-04 01:46:14,766 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:46:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:46:14,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:46:15,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-04 01:46:15,194 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 01:46:15,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2018-02-04 01:46:15,194 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:46:15,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:15,194 INFO L182 omatonBuilderFactory]: Interpolants [5582#true, 5583#false, 5584#(= |#valid| |old(#valid)|), 5585#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= (store |#valid| |main_#t~malloc15.base| 0) |old(#valid)|)), 5586#(and (= |main_#t~malloc15.base| main_~nondetArea~0.base) (= (select |#valid| |main_#t~malloc15.base|) 1) (= (store |#valid| |main_#t~malloc15.base| 0) |old(#valid)|)), 5587#(and (= (store (store |#valid| |main_#t~malloc15.base| 0) |main_#t~malloc16.base| 0) |old(#valid)|) (= |main_#t~malloc15.base| main_~nondetArea~0.base) (= (select |#valid| |main_#t~malloc15.base|) 1) (not (= |main_#t~malloc15.base| |main_#t~malloc16.base|))), 5588#(and (= (store (store |#valid| |main_#t~malloc15.base| 0) |main_#t~malloc16.base| 0) |old(#valid)|) (= |main_#t~malloc15.base| main_~nondetArea~0.base) (= (select |#valid| |main_#t~malloc15.base|) 1) (= main_~nondetString~0.base |main_#t~malloc16.base|) (not (= |main_#t~malloc15.base| |main_#t~malloc16.base|))), 5589#(and (= (store (store |#valid| |main_#t~malloc15.base| 0) |main_#t~malloc16.base| 0) |old(#valid)|) (= (select |#valid| main_~nondetString~0.base) 1) (= |main_#t~malloc15.base| main_~nondetArea~0.base) (= (select |#valid| |main_#t~malloc15.base|) 1) (= main_~nondetString~0.base |main_#t~malloc16.base|) (not (= |main_#t~malloc15.base| |main_#t~malloc16.base|))), 5590#(and (= (store |old(#valid)| |cstpncpy_~#dst.base| (select (store |#valid| |cstpncpy_~#dst.base| 0) |cstpncpy_~#dst.base|)) (store |#valid| |cstpncpy_~#dst.base| 0)) (= 0 (select |old(#valid)| |cstpncpy_~#dst.base|))), 5591#(and (= (store |old(#valid)| |cstpncpy_~#dst.base| (select (store |#valid| |cstpncpy_~#dst.base| 0) |cstpncpy_~#dst.base|)) (store |#valid| |cstpncpy_~#dst.base| 0)) (= (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) |cstpncpy_#in~dst.base|) (= 0 (select |old(#valid)| |cstpncpy_~#dst.base|))), 5592#(and (= (store |old(#valid)| |cstpncpy_~#dst.base| (select (store |#valid| |cstpncpy_~#dst.base| 0) |cstpncpy_~#dst.base|)) (store |#valid| |cstpncpy_~#dst.base| 0)) (= (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) |cstpncpy_#in~dst.base|) (= |cstpncpy_#t~mem0.base| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (= 0 (select |old(#valid)| |cstpncpy_~#dst.base|))), 5593#(and (= (store |old(#valid)| |cstpncpy_~#dst.base| (select (store |#valid| |cstpncpy_~#dst.base| 0) |cstpncpy_~#dst.base|)) (store |#valid| |cstpncpy_~#dst.base| 0)) (= cstpncpy_~d~0.base (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (= cstpncpy_~d~0.base |cstpncpy_#in~dst.base|) (= 0 (select |old(#valid)| |cstpncpy_~#dst.base|))), 5594#(and (= (store |old(#valid)| |cstpncpy_~#dst.base| (select (store |#valid| |cstpncpy_~#dst.base| 0) |cstpncpy_~#dst.base|)) (store |#valid| |cstpncpy_~#dst.base| 0)) (= cstpncpy_~d~0.base |cstpncpy_#in~dst.base|) (= 0 (select |old(#valid)| |cstpncpy_~#dst.base|))), 5595#(and (or (and (= |cstpncpy_~#dst.base| |cstpncpy_#in~dst.base|) (= 0 (select |old(#valid)| |cstpncpy_~#dst.base|))) (not (= |cstpncpy_~#dst.base| |cstpncpy_#t~post4.base|))) (or (= |cstpncpy_~#dst.base| |cstpncpy_#t~post4.base|) (and (= (store |old(#valid)| |cstpncpy_~#dst.base| (select (store |#valid| |cstpncpy_~#dst.base| 0) |cstpncpy_~#dst.base|)) (store |#valid| |cstpncpy_~#dst.base| 0)) (= |cstpncpy_#t~post4.base| |cstpncpy_#in~dst.base|) (= 0 (select |old(#valid)| |cstpncpy_~#dst.base|))))), 5596#(or (and (= (store |old(#valid)| |cstpncpy_~#dst.base| (select (store |#valid| |cstpncpy_~#dst.base| 0) |cstpncpy_~#dst.base|)) (store |#valid| |cstpncpy_~#dst.base| 0)) (= 0 (select |old(#valid)| |cstpncpy_~#dst.base|))) (and (= |cstpncpy_~#dst.base| |cstpncpy_#in~dst.base|) (= 0 (select |old(#valid)| |cstpncpy_~#dst.base|)))), 5597#(or (= 0 (select |old(#valid)| |cstpncpy_#in~dst.base|)) (= |#valid| |old(#valid)|)), 5598#(and (= (store (store |#valid| |main_#t~malloc15.base| 0) |main_#t~malloc16.base| 0) |old(#valid)|) (not (= |main_#t~malloc15.base| |main_#t~malloc16.base|))), 5599#(= (store |#valid| |main_#t~malloc16.base| 0) |old(#valid)|)]
[2018-02-04 01:46:15,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:15,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states
[2018-02-04 01:46:15,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2018-02-04 01:46:15,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306
[2018-02-04 01:46:15,195 INFO L87 Difference]: Start difference. First operand 178 states and 194 transitions. Second operand 18 states.
[2018-02-04 01:46:15,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:46:15,428 INFO L93 Difference]: Finished difference Result 198 states and 216 transitions.
[2018-02-04 01:46:15,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2018-02-04 01:46:15,428 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41
[2018-02-04 01:46:15,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:46:15,429 INFO L225 Difference]: With dead ends: 198
[2018-02-04 01:46:15,429 INFO L226 Difference]: Without dead ends: 108
[2018-02-04 01:46:15,429 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506
[2018-02-04 01:46:15,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states.
[2018-02-04 01:46:15,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 84.
[2018-02-04 01:46:15,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states.
[2018-02-04 01:46:15,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions.
[2018-02-04 01:46:15,430 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 41
[2018-02-04 01:46:15,430 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:46:15,430 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions.
[2018-02-04 01:46:15,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states.
[2018-02-04 01:46:15,431 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions.
[2018-02-04 01:46:15,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2018-02-04 01:46:15,431 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:46:15,431 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 01:46:15,431 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:46:15,431 INFO L82 PathProgramCache]: Analyzing trace with hash -794989933, now seen corresponding path program 2 times
[2018-02-04 01:46:15,432 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:46:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:46:15,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:46:16,040 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-04 01:46:16,040 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-04 01:46:16,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22
[2018-02-04 01:46:16,041 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:46:16,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:16,041 INFO L182 omatonBuilderFactory]: Interpolants [5892#true, 5893#false, 5894#(and (= main_~n~0 (select |#length| |main_#t~malloc15.base|)) (= (select |#valid| |main_#t~malloc15.base|) 1) (= 0 |main_#t~malloc15.offset|)), 5895#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= (select |#valid| main_~nondetArea~0.base) 1) (= 0 main_~nondetArea~0.offset)), 5896#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= 0 main_~nondetArea~0.offset)), 5897#(and (<= (select |#length| |cstpncpy_#in~dst.base|) |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| |cstpncpy_#in~dst.base|)) (= 0 |cstpncpy_#in~dst.offset|)), 5898#(and (or (and (= 4 (select |#length| |cstpncpy_~#dst.base|)) (= |cstpncpy_~#dst.base| |cstpncpy_#in~dst.base|)) (and (<= (select |#length| |cstpncpy_#in~dst.base|) |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| |cstpncpy_#in~dst.base|)))) (= 0 |cstpncpy_#in~dst.offset|)), 5899#(and (or (and (= 4 (select |#length| |cstpncpy_~#dst.base|)) (= |cstpncpy_~#dst.base| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (and (<= (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))), 5900#(and (or (and (= 4 (select |#length| |cstpncpy_~#dst.base|)) (= |cstpncpy_~#dst.base| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (and (<= cstpncpy_~n (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (<= (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) cstpncpy_~n))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))), 5901#(and (= (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) |cstpncpy_#t~mem0.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (or (and (= 4 (select |#length| |cstpncpy_~#dst.base|)) (= |cstpncpy_~#dst.base| |cstpncpy_#t~mem0.base|)) (and (<= (select |#length| |cstpncpy_#t~mem0.base|) cstpncpy_~n) (<= cstpncpy_~n (select |#length| |cstpncpy_#t~mem0.base|))))), 5902#(and (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (or (and (<= cstpncpy_~n (select |#length| cstpncpy_~d~0.base)) (<= (select |#length| cstpncpy_~d~0.base) cstpncpy_~n)) (and (= |cstpncpy_~#dst.base| cstpncpy_~d~0.base) (= 4 (select |#length| |cstpncpy_~#dst.base|)))) (= (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) cstpncpy_~d~0.offset)), 5903#(and (= |cstpncpy_#t~mem1.offset| 0) (= |cstpncpy_#t~mem1.offset| cstpncpy_~d~0.offset) (or (and (<= cstpncpy_~n (select |#length| cstpncpy_~d~0.base)) (<= (select |#length| cstpncpy_~d~0.base) cstpncpy_~n)) (and (= |cstpncpy_~#dst.base| cstpncpy_~d~0.base) (= 4 (select |#length| |cstpncpy_~#dst.base|))))), 5904#(or (and (= |cstpncpy_~#dst.base| cstpncpy_~d~0.base) (= 4 (select |#length| |cstpncpy_~#dst.base|)) (<= cstpncpy_~d~0.offset 0)) (and (<= (select |#length| cstpncpy_~d~0.base) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (select |#length| cstpncpy_~d~0.base)))), 5905#(or (and (= 4 (select |#length| cstpncpy_~d~0.base)) (= |cstpncpy_#t~post4.base| |cstpncpy_~#dst.base|) (<= cstpncpy_~d~0.offset 1)) (and (= |cstpncpy_#t~post4.base| cstpncpy_~d~0.base) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| |cstpncpy_#t~post4.base|) 1)) (<= (+ (select |#length| |cstpncpy_#t~post4.base|) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)))), 5906#(or (and (<= (+ (select |#length| cstpncpy_~d~0.base) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1))) (and (= 4 (select |#length| cstpncpy_~d~0.base)) (<= cstpncpy_~d~0.offset 1))), 5907#(or (and (= 4 (select |#length| cstpncpy_~d~0.base)) (<= cstpncpy_~d~0.offset 1)) (and (<= (select |#length| cstpncpy_~d~0.base) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (select |#length| cstpncpy_~d~0.base)))), 5908#(and (or (and (<= cstpncpy_~d~0.offset 2) (= 4 (select |#length| |cstpncpy_#t~post10.base|))) (and (<= (+ (select |#length| |cstpncpy_#t~post10.base|) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| |cstpncpy_#t~post10.base|) 1)))) (= |cstpncpy_#t~post10.base| cstpncpy_~d~0.base)), 5909#(or (and (<= (+ (select |#length| cstpncpy_~d~0.base) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1))) (<= (+ cstpncpy_~d~0.offset 2) (select |#length| cstpncpy_~d~0.base))), 5910#(or (<= (+ cstpncpy_~d~0.offset 2) (select |#length| cstpncpy_~d~0.base)) (and (<= (select |#length| cstpncpy_~d~0.base) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (select |#length| cstpncpy_~d~0.base)))), 5911#(and (or (<= (+ cstpncpy_~d~0.offset 1) (select |#length| cstpncpy_~d~0.base)) (and (<= (+ (select |#length| cstpncpy_~d~0.base) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1)) (<= (+ (select |#length| |cstpncpy_#t~post10.base|) cstpncpy_~d~0.offset) (+ (select |#length| cstpncpy_~d~0.base) |cstpncpy_#t~post10.offset| 1)))) (<= (+ |cstpncpy_#t~post10.offset| 1) cstpncpy_~d~0.offset)), 5912#(and (<= 1 cstpncpy_~d~0.offset) (or (<= (+ cstpncpy_~d~0.offset 1) (select |#length| cstpncpy_~d~0.base)) (and (<= (+ (select |#length| cstpncpy_~d~0.base) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1)) (<= cstpncpy_~d~0.offset (select |#length| cstpncpy_~d~0.base))))), 5913#(and (<= 1 cstpncpy_~d~0.offset) (or (and (<= |cstpncpy_#t~pre9| (* 4294967296 (div |cstpncpy_#t~pre9| 4294967296))) (<= (select |#length| cstpncpy_~d~0.base) (+ cstpncpy_~d~0.offset |cstpncpy_#t~pre9|)) (<= cstpncpy_~d~0.offset (select |#length| cstpncpy_~d~0.base))) (<= (+ cstpncpy_~d~0.offset 1) (select |#length| cstpncpy_~d~0.base)))), 5914#(and (<= (+ |cstpncpy_#t~post10.offset| 1) (select |#length| |cstpncpy_#t~post10.base|)) (<= 1 |cstpncpy_#t~post10.offset|))]
[2018-02-04 01:46:16,041 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-04 01:46:16,042 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states
[2018-02-04 01:46:16,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2018-02-04 01:46:16,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506
[2018-02-04 01:46:16,042 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 23 states.
[2018-02-04 01:46:17,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:46:17,173 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions.
[2018-02-04 01:46:17,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2018-02-04 01:46:17,173 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42
[2018-02-04 01:46:17,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:46:17,174 INFO L225 Difference]: With dead ends: 95
[2018-02-04 01:46:17,174 INFO L226 Difference]: Without dead ends: 95
[2018-02-04 01:46:17,175 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=226, Invalid=1844, Unknown=0, NotChecked=0, Total=2070
[2018-02-04 01:46:17,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states.
[2018-02-04 01:46:17,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89.
[2018-02-04 01:46:17,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states.
[2018-02-04 01:46:17,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions.
[2018-02-04 01:46:17,177 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 42
[2018-02-04 01:46:17,177 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:46:17,177 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions.
[2018-02-04 01:46:17,177 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states.
[2018-02-04 01:46:17,177 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions.
[2018-02-04 01:46:17,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2018-02-04 01:46:17,178 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:46:17,178 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 01:46:17,178 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:46:17,178 INFO L82 PathProgramCache]: Analyzing trace with hash -364387108, now seen corresponding path program 3 times
[2018-02-04 01:46:17,179 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:46:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:46:17,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:46:17,578 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-02-04 01:46:17,578 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-04 01:46:17,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22
[2018-02-04 01:46:17,579 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:46:17,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:17,579 INFO L182 omatonBuilderFactory]: Interpolants [6145#true, 6146#false, 6147#(= (select |#valid| |main_#t~malloc15.base|) 1), 6148#(= (select |#valid| main_~nondetArea~0.base) 1), 6149#(and (not (= main_~nondetArea~0.base |main_#t~malloc16.base|)) (= 0 |main_#t~malloc16.offset|) (= main_~length~0 (select |#length| |main_#t~malloc16.base|))), 6150#(and (= main_~length~0 (select |#length| main_~nondetString~0.base)) (not (= main_~nondetArea~0.base main_~nondetString~0.base)) (= main_~nondetString~0.offset 0)), 6151#(and (not (= main_~nondetArea~0.base main_~nondetString~0.base)) (= (select |#valid| main_~nondetString~0.base) 1) (= main_~nondetString~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString~0.base) (+ (select |#length| main_~nondetString~0.base) (+ main_~nondetString~0.offset (- 1)))))), 6152#(and (= (select |#valid| |cstpncpy_#in~src.base|) 1) (= 0 (select (select |#memory_int| |cstpncpy_#in~src.base|) (+ (select |#length| |cstpncpy_#in~src.base|) (- 1)))) (not (= |cstpncpy_#in~dst.base| |cstpncpy_#in~src.base|))), 6153#(and (not (= |cstpncpy_~#dst.base| |cstpncpy_#in~src.base|)) (= 0 (select (select |#memory_int| |cstpncpy_#in~src.base|) (+ (select |#length| |cstpncpy_#in~src.base|) (- 1)))) (not (= |cstpncpy_#in~dst.base| |cstpncpy_#in~src.base|))), 6154#(and (not (= (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) |cstpncpy_#in~src.base|)) (not (= |cstpncpy_~#dst.base| |cstpncpy_#in~src.base|)) (= 0 (select (select |#memory_int| |cstpncpy_#in~src.base|) (+ (select |#length| |cstpncpy_#in~src.base|) (- 1))))), 6155#(and (= 0 (select (select |#memory_int| cstpncpy_~src.base) (+ (select |#length| cstpncpy_~src.base) (- 1)))) (not (= (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) cstpncpy_~src.base)) (not (= |cstpncpy_~#dst.base| cstpncpy_~src.base))), 6156#(and (= 0 (select (select |#memory_int| cstpncpy_~src.base) (+ (select |#length| cstpncpy_~src.base) (- 1)))) (= |cstpncpy_#t~mem0.base| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (not (= (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) cstpncpy_~src.base)) (not (= |cstpncpy_~#dst.base| cstpncpy_~src.base))), 6157#(and (= cstpncpy_~d~0.base (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (not (= |cstpncpy_~#dst.base| cstpncpy_~s~0.base)) (not (= (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) cstpncpy_~s~0.base)) (= 0 (select (select |#memory_int| cstpncpy_~s~0.base) (+ (select |#length| cstpncpy_~s~0.base) (- 1))))), 6158#(and (not (= cstpncpy_~d~0.base cstpncpy_~s~0.base)) (= 0 (select (select |#memory_int| cstpncpy_~s~0.base) (+ (select |#length| cstpncpy_~s~0.base) (- 1))))), 6159#(and (not (= |cstpncpy_#t~post5.base| |cstpncpy_#t~post4.base|)) (= |cstpncpy_#t~post5.base| cstpncpy_~s~0.base) (not (= cstpncpy_~d~0.base |cstpncpy_#t~post5.base|)) (= 0 (select (select |#memory_int| |cstpncpy_#t~post5.base|) (+ (select |#length| cstpncpy_~s~0.base) (- 1))))), 6160#(and (not (= cstpncpy_~d~0.base cstpncpy_~s~0.base)) (= 0 (select (select (store |#memory_int| |cstpncpy_#t~post4.base| (store (select |#memory_int| |cstpncpy_#t~post4.base|) |cstpncpy_#t~post4.offset| |cstpncpy_#t~mem7|)) cstpncpy_~s~0.base) (+ (select |#length| cstpncpy_~s~0.base) (- 1))))), 6161#(and (= |cstpncpy_#t~post5.base| cstpncpy_~s~0.base) (not (= |cstpncpy_#t~post4.base| cstpncpy_~s~0.base)) (= 0 (select (select |#memory_int| cstpncpy_~s~0.base) (+ (select |#length| |cstpncpy_#t~post5.base|) (- 1))))), 6162#(= 0 (select (select (store |#memory_int| |cstpncpy_#t~post4.base| (store (select |#memory_int| |cstpncpy_#t~post4.base|) |cstpncpy_#t~post4.offset| |cstpncpy_#t~mem7|)) cstpncpy_~s~0.base) (+ (select |#length| cstpncpy_~s~0.base) (- 1)))), 6163#(= 0 (select (select |#memory_int| cstpncpy_~s~0.base) (+ (select |#length| cstpncpy_~s~0.base) (- 1)))), 6164#(and (<= (+ |cstpncpy_#t~post5.offset| 1) cstpncpy_~s~0.offset) (or (<= (+ cstpncpy_~s~0.offset 1) (select |#length| cstpncpy_~s~0.base)) (= 0 (select (select |#memory_int| |cstpncpy_#t~post5.base|) |cstpncpy_#t~post5.offset|)) (<= (select |#length| |cstpncpy_#t~post5.base|) |cstpncpy_#t~post5.offset|))), 6165#(and (or (= |cstpncpy_#t~mem7| 0) (<= (+ cstpncpy_~s~0.offset 1) (select |#length| cstpncpy_~s~0.base))) (<= 1 cstpncpy_~s~0.offset)), 6166#(and (<= (+ cstpncpy_~s~0.offset 1) (select |#length| cstpncpy_~s~0.base)) (<= 1 cstpncpy_~s~0.offset)), 6167#(and (<= 1 |cstpncpy_#t~post5.offset|) (<= (+ |cstpncpy_#t~post5.offset| 1) (select |#length| |cstpncpy_#t~post5.base|)))]
[2018-02-04 01:46:17,579 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-02-04 01:46:17,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states
[2018-02-04 01:46:17,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2018-02-04 01:46:17,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506
[2018-02-04 01:46:17,580 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 23 states.
[2018-02-04 01:46:18,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:46:18,088 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions.
[2018-02-04 01:46:18,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2018-02-04 01:46:18,088 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43
[2018-02-04 01:46:18,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:46:18,089 INFO L225 Difference]: With dead ends: 88
[2018-02-04 01:46:18,089 INFO L226 Difference]: Without dead ends: 88
[2018-02-04 01:46:18,089 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=200, Invalid=1282, Unknown=0, NotChecked=0, Total=1482
[2018-02-04 01:46:18,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states.
[2018-02-04 01:46:18,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88.
[2018-02-04 01:46:18,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states.
[2018-02-04 01:46:18,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions.
[2018-02-04 01:46:18,091 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 43
[2018-02-04 01:46:18,091 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:46:18,091 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions.
[2018-02-04 01:46:18,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states.
[2018-02-04 01:46:18,091 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions.
[2018-02-04 01:46:18,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2018-02-04 01:46:18,092 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:46:18,092 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 01:46:18,092 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:46:18,092 INFO L82 PathProgramCache]: Analyzing trace with hash 907599341, now seen corresponding path program 2 times
[2018-02-04 01:46:18,092 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:46:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:46:18,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:46:18,741 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-04 01:46:18,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-04 01:46:18,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22
[2018-02-04 01:46:18,742 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:46:18,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:18,742 INFO L182 omatonBuilderFactory]: Interpolants [6376#true, 6377#false, 6378#(and (= main_~n~0 (select |#length| |main_#t~malloc15.base|)) (= (select |#valid| |main_#t~malloc15.base|) 1) (= 0 |main_#t~malloc15.offset|)), 6379#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= (select |#valid| main_~nondetArea~0.base) 1) (= 0 main_~nondetArea~0.offset)), 6380#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= 0 main_~nondetArea~0.offset)), 6381#(and (<= (select |#length| |cstpncpy_#in~dst.base|) |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| |cstpncpy_#in~dst.base|)) (= 0 |cstpncpy_#in~dst.offset|)), 6382#(and (or (and (= 4 (select |#length| |cstpncpy_~#dst.base|)) (= |cstpncpy_~#dst.base| |cstpncpy_#in~dst.base|)) (and (<= (select |#length| |cstpncpy_#in~dst.base|) |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| |cstpncpy_#in~dst.base|)))) (= 0 |cstpncpy_#in~dst.offset|)), 6383#(and (or (and (= 4 (select |#length| |cstpncpy_~#dst.base|)) (= |cstpncpy_~#dst.base| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (and (<= (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))), 6384#(and (or (and (= 4 (select |#length| |cstpncpy_~#dst.base|)) (= |cstpncpy_~#dst.base| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (and (<= cstpncpy_~n (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (<= (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) cstpncpy_~n))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))), 6385#(and (= (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) |cstpncpy_#t~mem0.offset|) (or (and (= 4 (select |#length| |cstpncpy_~#dst.base|)) (= |cstpncpy_#t~mem0.base| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (= |cstpncpy_~#dst.base| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (and (<= (select |#length| |cstpncpy_#t~mem0.base|) cstpncpy_~n) (<= cstpncpy_~n (select |#length| |cstpncpy_#t~mem0.base|)))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))), 6386#(and (or (and (<= cstpncpy_~n (select |#length| cstpncpy_~d~0.base)) (<= (select |#length| cstpncpy_~d~0.base) cstpncpy_~n)) (and (= 4 (select |#length| |cstpncpy_~#dst.base|)) (= cstpncpy_~d~0.base (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (= |cstpncpy_~#dst.base| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (= (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) cstpncpy_~d~0.offset)), 6387#(and (= |cstpncpy_#t~mem1.offset| 0) (= |cstpncpy_#t~mem1.offset| cstpncpy_~d~0.offset) (or (and (<= cstpncpy_~n (select |#length| cstpncpy_~d~0.base)) (<= (select |#length| cstpncpy_~d~0.base) cstpncpy_~n)) (and (= 4 (select |#length| |cstpncpy_~#dst.base|)) (= cstpncpy_~d~0.base (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (= |cstpncpy_~#dst.base| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))))), 6388#(or (and (= |cstpncpy_~#dst.base| cstpncpy_~d~0.base) (= 4 (select |#length| |cstpncpy_~#dst.base|)) (<= cstpncpy_~d~0.offset 0)) (and (<= (select |#length| cstpncpy_~d~0.base) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (select |#length| cstpncpy_~d~0.base)))), 6389#(or (and (= |cstpncpy_#t~post4.base| cstpncpy_~d~0.base) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| |cstpncpy_#t~post4.base|) 1)) (<= (+ (select |#length| |cstpncpy_#t~post4.base|) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n))) (and (= |cstpncpy_~#dst.base| |cstpncpy_#t~post4.base|) (= 4 (select |#length| cstpncpy_~d~0.base)) (<= cstpncpy_~d~0.offset 1))), 6390#(or (and (<= (+ (select |#length| cstpncpy_~d~0.base) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1))) (and (= 4 (select |#length| cstpncpy_~d~0.base)) (<= cstpncpy_~d~0.offset 1))), 6391#(or (and (= 4 (select |#length| cstpncpy_~d~0.base)) (<= cstpncpy_~d~0.offset 1)) (and (<= (select |#length| cstpncpy_~d~0.base) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (select |#length| cstpncpy_~d~0.base)))), 6392#(and (or (and (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| |cstpncpy_#t~post4.base|) 1)) (<= (+ (select |#length| |cstpncpy_#t~post4.base|) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n))) (and (<= cstpncpy_~d~0.offset 2) (= (select |#length| |cstpncpy_#t~post4.base|) 4))) (= |cstpncpy_#t~post4.base| cstpncpy_~d~0.base)), 6393#(or (and (<= (+ (select |#length| cstpncpy_~d~0.base) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1))) (<= (+ cstpncpy_~d~0.offset 2) (select |#length| cstpncpy_~d~0.base))), 6394#(or (<= (+ cstpncpy_~d~0.offset 2) (select |#length| cstpncpy_~d~0.base)) (and (<= (select |#length| cstpncpy_~d~0.base) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (select |#length| cstpncpy_~d~0.base)))), 6395#(and (<= (+ |cstpncpy_#t~post4.offset| 1) cstpncpy_~d~0.offset) (or (and (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1)) (<= (select |#length| |cstpncpy_#t~post4.base|) (+ |cstpncpy_#t~post4.offset| cstpncpy_~n))) (<= (+ cstpncpy_~d~0.offset 1) (select |#length| cstpncpy_~d~0.base)))), 6396#(and (<= 1 cstpncpy_~d~0.offset) (or (and (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1)) (<= 1 cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset 1) (select |#length| cstpncpy_~d~0.base)))), 6397#(and (<= 1 cstpncpy_~d~0.offset) (or (and (<= |cstpncpy_#t~pre9| (* 4294967296 (div |cstpncpy_#t~pre9| 4294967296))) (< 0 (+ (div |cstpncpy_#t~pre9| 4294967296) 1))) (<= (+ cstpncpy_~d~0.offset 1) (select |#length| cstpncpy_~d~0.base)))), 6398#(and (<= (+ |cstpncpy_#t~post10.offset| 1) (select |#length| |cstpncpy_#t~post10.base|)) (<= 1 |cstpncpy_#t~post10.offset|))]
[2018-02-04 01:46:18,742 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-04 01:46:18,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states
[2018-02-04 01:46:18,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2018-02-04 01:46:18,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506
[2018-02-04 01:46:18,743 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 23 states.
[2018-02-04 01:46:20,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:46:20,135 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions.
[2018-02-04 01:46:20,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states.
[2018-02-04 01:46:20,135 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44
[2018-02-04 01:46:20,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:46:20,136 INFO L225 Difference]: With dead ends: 96
[2018-02-04 01:46:20,136 INFO L226 Difference]: Without dead ends: 96
[2018-02-04 01:46:20,136 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=246, Invalid=1916, Unknown=0, NotChecked=0, Total=2162
[2018-02-04 01:46:20,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states.
[2018-02-04 01:46:20,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90.
[2018-02-04 01:46:20,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states.
[2018-02-04 01:46:20,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions.
[2018-02-04 01:46:20,138 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 44
[2018-02-04 01:46:20,138 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:46:20,138 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions.
[2018-02-04 01:46:20,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states.
[2018-02-04 01:46:20,138 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions.
[2018-02-04 01:46:20,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2018-02-04 01:46:20,138 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:46:20,138 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-04 01:46:20,138 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:46:20,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1588901511, now seen corresponding path program 3 times
[2018-02-04 01:46:20,139 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:46:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:46:20,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:46:20,728 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:20,728 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-04 01:46:20,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23
[2018-02-04 01:46:20,729 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:46:20,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:20,732 INFO L182 omatonBuilderFactory]: Interpolants [6656#(and (<= (+ |cstpncpy_#t~post4.offset| 1) (select |#length| |cstpncpy_#t~post4.base|)) (<= 1 |cstpncpy_#t~post4.offset|)), 6633#true, 6634#false, 6635#(and (= main_~n~0 (select |#length| |main_#t~malloc15.base|)) (= (select |#valid| |main_#t~malloc15.base|) 1) (= 0 |main_#t~malloc15.offset|)), 6636#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= (select |#valid| main_~nondetArea~0.base) 1) (= 0 main_~nondetArea~0.offset)), 6637#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= 0 main_~nondetArea~0.offset)), 6638#(and (<= (select |#length| |cstpncpy_#in~dst.base|) |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| |cstpncpy_#in~dst.base|)) (= 0 |cstpncpy_#in~dst.offset|)), 6639#(and (or (= 4 (select |#length| |cstpncpy_#in~dst.base|)) (and (<= (select |#length| |cstpncpy_#in~dst.base|) |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| |cstpncpy_#in~dst.base|)))) (= 0 |cstpncpy_#in~dst.offset|)), 6640#(and (or (and (<= (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))), 6641#(and (or (= 4 (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (and (<= cstpncpy_~n (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (<= (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) cstpncpy_~n))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))), 6642#(and (= (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) |cstpncpy_#t~mem0.offset|) (or (and (= |cstpncpy_#t~mem0.base| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)))) (and (<= (select |#length| |cstpncpy_#t~mem0.base|) cstpncpy_~n) (<= cstpncpy_~n (select |#length| |cstpncpy_#t~mem0.base|)))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))), 6643#(and (or (and (<= cstpncpy_~n (select |#length| cstpncpy_~d~0.base)) (<= (select |#length| cstpncpy_~d~0.base) cstpncpy_~n)) (and (= cstpncpy_~d~0.base (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (= (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) cstpncpy_~d~0.offset)), 6644#(and (= |cstpncpy_#t~mem1.offset| 0) (= |cstpncpy_#t~mem1.offset| cstpncpy_~d~0.offset) (or (and (<= cstpncpy_~n (select |#length| cstpncpy_~d~0.base)) (<= (select |#length| cstpncpy_~d~0.base) cstpncpy_~n)) (and (= cstpncpy_~d~0.base (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)))))), 6645#(or (and (= 4 (select |#length| cstpncpy_~d~0.base)) (<= cstpncpy_~d~0.offset 0)) (and (<= (select |#length| cstpncpy_~d~0.base) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (select |#length| cstpncpy_~d~0.base)))), 6646#(or (and (= 4 (select |#length| cstpncpy_~d~0.base)) (<= cstpncpy_~d~0.offset 1)) (and (= |cstpncpy_#t~post4.base| cstpncpy_~d~0.base) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| |cstpncpy_#t~post4.base|) 1)) (<= (+ (select |#length| |cstpncpy_#t~post4.base|) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)))), 6647#(or (and (<= (+ (select |#length| cstpncpy_~d~0.base) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1))) (and (= 4 (select |#length| cstpncpy_~d~0.base)) (<= cstpncpy_~d~0.offset 1))), 6648#(or (and (= 4 (select |#length| cstpncpy_~d~0.base)) (<= cstpncpy_~d~0.offset 1)) (and (<= (select |#length| cstpncpy_~d~0.base) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (select |#length| cstpncpy_~d~0.base)))), 6649#(and (or (and (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| |cstpncpy_#t~post4.base|) 1)) (<= (+ (select |#length| |cstpncpy_#t~post4.base|) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n))) (and (<= cstpncpy_~d~0.offset 2) (= (select |#length| |cstpncpy_#t~post4.base|) 4))) (= |cstpncpy_#t~post4.base| cstpncpy_~d~0.base)), 6650#(or (and (<= (+ (select |#length| cstpncpy_~d~0.base) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1))) (<= (+ cstpncpy_~d~0.offset 2) (select |#length| cstpncpy_~d~0.base))), 6651#(or (<= (+ cstpncpy_~d~0.offset 2) (select |#length| cstpncpy_~d~0.base)) (and (<= (select |#length| cstpncpy_~d~0.base) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (select |#length| cstpncpy_~d~0.base)))), 6652#(and (or (and (<= (+ (select |#length| cstpncpy_~d~0.base) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1)) (<= (+ (select |#length| |cstpncpy_#t~post4.base|) cstpncpy_~d~0.offset) (+ (select |#length| cstpncpy_~d~0.base) |cstpncpy_#t~post4.offset| 1))) (<= (+ cstpncpy_~d~0.offset 1) (select |#length| cstpncpy_~d~0.base))) (<= (+ |cstpncpy_#t~post4.offset| 1) cstpncpy_~d~0.offset)), 6653#(and (<= 1 cstpncpy_~d~0.offset) (or (<= (+ cstpncpy_~d~0.offset 1) (select |#length| cstpncpy_~d~0.base)) (and (<= (+ (select |#length| cstpncpy_~d~0.base) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1)) (<= cstpncpy_~d~0.offset (select |#length| cstpncpy_~d~0.base))))), 6654#(and (<= 1 cstpncpy_~d~0.offset) (or (and (<= |cstpncpy_#t~pre3| (* 4294967296 (div |cstpncpy_#t~pre3| 4294967296))) (<= cstpncpy_~d~0.offset (select |#length| cstpncpy_~d~0.base)) (< 0 (+ (div |cstpncpy_#t~pre3| 4294967296) 1))) (<= (+ cstpncpy_~d~0.offset 1) (select |#length| cstpncpy_~d~0.base)))), 6655#(and (<= 1 cstpncpy_~d~0.offset) (<= (+ cstpncpy_~d~0.offset 1) (select |#length| cstpncpy_~d~0.base)))]
[2018-02-04 01:46:20,732 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:20,732 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states
[2018-02-04 01:46:20,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2018-02-04 01:46:20,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552
[2018-02-04 01:46:20,732 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 24 states.
[2018-02-04 01:46:21,350 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 54 DAG size of output 42
[2018-02-04 01:46:22,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:46:22,099 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions.
[2018-02-04 01:46:22,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states.
[2018-02-04 01:46:22,099 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44
[2018-02-04 01:46:22,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:46:22,099 INFO L225 Difference]: With dead ends: 100
[2018-02-04 01:46:22,099 INFO L226 Difference]: Without dead ends: 100
[2018-02-04 01:46:22,100 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=262, Invalid=1994, Unknown=0, NotChecked=0, Total=2256
[2018-02-04 01:46:22,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states.
[2018-02-04 01:46:22,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95.
[2018-02-04 01:46:22,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states.
[2018-02-04 01:46:22,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions.
[2018-02-04 01:46:22,101 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 44
[2018-02-04 01:46:22,101 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:46:22,101 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions.
[2018-02-04 01:46:22,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states.
[2018-02-04 01:46:22,101 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions.
[2018-02-04 01:46:22,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2018-02-04 01:46:22,102 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:46:22,102 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 01:46:22,102 INFO L371 AbstractCegarLoop]: === Iteration 28 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:46:22,102 INFO L82 PathProgramCache]: Analyzing trace with hash -441403286, now seen corresponding path program 3 times
[2018-02-04 01:46:22,102 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:46:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:46:22,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:46:22,557 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:22,558 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-04 01:46:22,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26
[2018-02-04 01:46:22,558 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:46:22,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:22,559 INFO L182 omatonBuilderFactory]: Interpolants [6912#(and (<= cstpncpy_~n (select |#length| cstpncpy_~d~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (= (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) cstpncpy_~d~0.offset) (<= (select |#length| cstpncpy_~d~0.base) cstpncpy_~n)), 6913#(and (= |cstpncpy_#t~mem1.offset| 0) (= |cstpncpy_#t~mem1.offset| cstpncpy_~d~0.offset) (<= cstpncpy_~n (select |#length| cstpncpy_~d~0.base)) (<= (select |#length| cstpncpy_~d~0.base) cstpncpy_~n)), 6914#(and (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (select |#length| cstpncpy_~d~0.base)) (<= (select |#length| cstpncpy_~d~0.base) cstpncpy_~n)), 6915#(and (<= (+ (select |#length| |cstpncpy_#t~post4.base|) |cstpncpy_#t~post4.offset| 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (= |cstpncpy_#t~post4.base| cstpncpy_~d~0.base) (<= (+ |cstpncpy_#t~post4.offset| 1) cstpncpy_~d~0.offset) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| |cstpncpy_#t~post4.base|) 1))), 6916#(and (<= (+ (select |#length| cstpncpy_~d~0.base) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1)) (<= 1 cstpncpy_~d~0.offset)), 6917#(and (<= 1 cstpncpy_~d~0.offset) (<= (select |#length| cstpncpy_~d~0.base) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (select |#length| cstpncpy_~d~0.base))), 6918#(and (<= (+ (select |#length| |cstpncpy_#t~post10.base|) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= 2 cstpncpy_~d~0.offset) (= |cstpncpy_#t~post10.base| cstpncpy_~d~0.base) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| |cstpncpy_#t~post10.base|) 1))), 6919#(and (<= (+ (select |#length| cstpncpy_~d~0.base) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1)) (<= 2 cstpncpy_~d~0.offset)), 6920#(and (<= (select |#length| cstpncpy_~d~0.base) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= 2 cstpncpy_~d~0.offset) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (select |#length| cstpncpy_~d~0.base))), 6921#(and (<= (+ (select |#length| cstpncpy_~d~0.base) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1)) (<= 3 cstpncpy_~d~0.offset)), 6922#(and (<= (select |#length| cstpncpy_~d~0.base) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= 3 cstpncpy_~d~0.offset) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (select |#length| cstpncpy_~d~0.base))), 6923#(and (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1)) (<= 4 cstpncpy_~d~0.offset) (<= (select |#length| |cstpncpy_#t~post10.base|) (+ |cstpncpy_#t~post10.offset| cstpncpy_~n))), 6924#(and (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1)) (<= 4 cstpncpy_~d~0.offset) (<= 1 cstpncpy_~n)), 6925#(and (<= 4 cstpncpy_~d~0.offset) (< 0 (+ (div |cstpncpy_#t~pre9| 4294967296) 1)) (or (<= |cstpncpy_#t~pre9| (* 4294967296 (div |cstpncpy_#t~pre9| 4294967296))) (<= (+ cstpncpy_~d~0.offset |cstpncpy_#t~pre9|) (select |#length| cstpncpy_~d~0.base)))), 6926#(and (<= (+ |cstpncpy_#t~post10.offset| 1) (select |#length| |cstpncpy_#t~post10.base|)) (<= 4 |cstpncpy_#t~post10.offset|)), 6900#true, 6901#false, 6902#(and (= main_~n~0 (select |#length| |main_#t~malloc15.base|)) (= (select |#valid| |main_#t~malloc15.base|) 1) (= 0 |main_#t~malloc15.offset|)), 6903#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= (select |#valid| main_~nondetArea~0.base) 1) (= 0 main_~nondetArea~0.offset)), 6904#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (or (= main_~nondetArea~0.base |main_#t~malloc16.base|) (= (select |#valid| main_~nondetArea~0.base) 1)) (= 0 main_~nondetArea~0.offset)), 6905#(and (or (= main_~nondetString~0.base main_~nondetArea~0.base) (= (select |#valid| main_~nondetArea~0.base) 1)) (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= 0 main_~nondetArea~0.offset)), 6906#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= (select |#valid| main_~nondetArea~0.base) 1) (= (select |#valid| main_~nondetString~0.base) 1) (= 0 main_~nondetArea~0.offset)), 6907#(and (= (select |#valid| |cstpncpy_#in~dst.base|) 1) (<= (select |#length| |cstpncpy_#in~dst.base|) |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| |cstpncpy_#in~dst.base|)) (= 0 |cstpncpy_#in~dst.offset|)), 6908#(and (<= (select |#length| |cstpncpy_#in~dst.base|) |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| |cstpncpy_#in~dst.base|)) (= 0 |cstpncpy_#in~dst.offset|)), 6909#(and (<= (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))), 6910#(and (<= cstpncpy_~n (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (<= (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) cstpncpy_~n)), 6911#(and (= (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) |cstpncpy_#t~mem0.offset|) (<= (select |#length| |cstpncpy_#t~mem0.base|) cstpncpy_~n) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (<= cstpncpy_~n (select |#length| |cstpncpy_#t~mem0.base|)))]
[2018-02-04 01:46:22,559 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:22,559 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states
[2018-02-04 01:46:22,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2018-02-04 01:46:22,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702
[2018-02-04 01:46:22,560 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 27 states.
[2018-02-04 01:46:23,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:46:23,478 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions.
[2018-02-04 01:46:23,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2018-02-04 01:46:23,478 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 47
[2018-02-04 01:46:23,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:46:23,479 INFO L225 Difference]: With dead ends: 100
[2018-02-04 01:46:23,479 INFO L226 Difference]: Without dead ends: 57
[2018-02-04 01:46:23,479 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=287, Invalid=2263, Unknown=0, NotChecked=0, Total=2550
[2018-02-04 01:46:23,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states.
[2018-02-04 01:46:23,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57.
[2018-02-04 01:46:23,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states.
[2018-02-04 01:46:23,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions.
[2018-02-04 01:46:23,480 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 47
[2018-02-04 01:46:23,480 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:46:23,480 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions.
[2018-02-04 01:46:23,480 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states.
[2018-02-04 01:46:23,480 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions.
[2018-02-04 01:46:23,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51
[2018-02-04 01:46:23,481 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:46:23,481 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 01:46:23,481 INFO L371 AbstractCegarLoop]: === Iteration 29 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:46:23,481 INFO L82 PathProgramCache]: Analyzing trace with hash -251849237, now seen corresponding path program 3 times
[2018-02-04 01:46:23,481 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:46:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:46:23,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:46:23,961 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:23,961 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-04 01:46:23,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26
[2018-02-04 01:46:23,962 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:46:23,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:23,962 INFO L182 omatonBuilderFactory]: Interpolants [7132#true, 7133#false, 7134#(and (= main_~n~0 (select |#length| |main_#t~malloc15.base|)) (= (select |#valid| |main_#t~malloc15.base|) 1) (= 0 |main_#t~malloc15.offset|)), 7135#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= (select |#valid| main_~nondetArea~0.base) 1) (= 0 main_~nondetArea~0.offset)), 7136#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (or (= main_~nondetArea~0.base |main_#t~malloc16.base|) (= (select |#valid| main_~nondetArea~0.base) 1)) (= 0 main_~nondetArea~0.offset)), 7137#(and (or (= main_~nondetString~0.base main_~nondetArea~0.base) (= (select |#valid| main_~nondetArea~0.base) 1)) (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= 0 main_~nondetArea~0.offset)), 7138#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= (select |#valid| main_~nondetArea~0.base) 1) (= (select |#valid| main_~nondetString~0.base) 1) (= 0 main_~nondetArea~0.offset)), 7139#(and (= (select |#valid| |cstpncpy_#in~dst.base|) 1) (<= (select |#length| |cstpncpy_#in~dst.base|) |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| |cstpncpy_#in~dst.base|)) (= 0 |cstpncpy_#in~dst.offset|)), 7140#(and (<= (select |#length| |cstpncpy_#in~dst.base|) |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| |cstpncpy_#in~dst.base|)) (= 0 |cstpncpy_#in~dst.offset|)), 7141#(and (<= (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))), 7142#(and (<= cstpncpy_~n (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (<= (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) cstpncpy_~n)), 7143#(and (= (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) |cstpncpy_#t~mem0.offset|) (<= (select |#length| |cstpncpy_#t~mem0.base|) cstpncpy_~n) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (<= cstpncpy_~n (select |#length| |cstpncpy_#t~mem0.base|))), 7144#(and (<= cstpncpy_~n (select |#length| cstpncpy_~d~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (= (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) cstpncpy_~d~0.offset) (<= (select |#length| cstpncpy_~d~0.base) cstpncpy_~n)), 7145#(and (= |cstpncpy_#t~mem1.offset| 0) (= |cstpncpy_#t~mem1.offset| cstpncpy_~d~0.offset) (<= cstpncpy_~n (select |#length| cstpncpy_~d~0.base)) (<= (select |#length| cstpncpy_~d~0.base) cstpncpy_~n)), 7146#(and (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (select |#length| cstpncpy_~d~0.base)) (<= (select |#length| cstpncpy_~d~0.base) cstpncpy_~n)), 7147#(and (<= (+ (select |#length| |cstpncpy_#t~post4.base|) |cstpncpy_#t~post4.offset| 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (= |cstpncpy_#t~post4.base| cstpncpy_~d~0.base) (<= (+ |cstpncpy_#t~post4.offset| 1) cstpncpy_~d~0.offset) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| |cstpncpy_#t~post4.base|) 1))), 7148#(and (<= (+ (select |#length| cstpncpy_~d~0.base) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1)) (<= 1 cstpncpy_~d~0.offset)), 7149#(and (<= 1 cstpncpy_~d~0.offset) (<= (select |#length| cstpncpy_~d~0.base) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (select |#length| cstpncpy_~d~0.base))), 7150#(and (= |cstpncpy_#t~post4.base| cstpncpy_~d~0.base) (<= 2 cstpncpy_~d~0.offset) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| |cstpncpy_#t~post4.base|) 1)) (<= (+ (select |#length| |cstpncpy_#t~post4.base|) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n))), 7151#(and (<= (+ (select |#length| cstpncpy_~d~0.base) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1)) (<= 2 cstpncpy_~d~0.offset)), 7152#(and (<= (select |#length| cstpncpy_~d~0.base) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= 2 cstpncpy_~d~0.offset) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (select |#length| cstpncpy_~d~0.base))), 7153#(and (<= (+ (select |#length| cstpncpy_~d~0.base) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1)) (<= 3 cstpncpy_~d~0.offset)), 7154#(and (<= (select |#length| cstpncpy_~d~0.base) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= 3 cstpncpy_~d~0.offset) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (select |#length| cstpncpy_~d~0.base))), 7155#(and (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1)) (<= 4 cstpncpy_~d~0.offset) (<= (select |#length| |cstpncpy_#t~post4.base|) (+ |cstpncpy_#t~post4.offset| cstpncpy_~n))), 7156#(and (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1)) (<= 4 cstpncpy_~d~0.offset) (<= 1 cstpncpy_~n)), 7157#(and (<= 4 cstpncpy_~d~0.offset) (< 0 (+ (div |cstpncpy_#t~pre9| 4294967296) 1)) (or (<= |cstpncpy_#t~pre9| (* 4294967296 (div |cstpncpy_#t~pre9| 4294967296))) (<= (+ cstpncpy_~d~0.offset |cstpncpy_#t~pre9|) (select |#length| cstpncpy_~d~0.base)))), 7158#(and (<= (+ |cstpncpy_#t~post10.offset| 1) (select |#length| |cstpncpy_#t~post10.base|)) (<= 4 |cstpncpy_#t~post10.offset|))]
[2018-02-04 01:46:23,962 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:23,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states
[2018-02-04 01:46:23,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2018-02-04 01:46:23,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702
[2018-02-04 01:46:23,963 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 27 states.
[2018-02-04 01:46:24,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:46:24,701 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions.
[2018-02-04 01:46:24,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2018-02-04 01:46:24,701 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50
[2018-02-04 01:46:24,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:46:24,702 INFO L225 Difference]: With dead ends: 56
[2018-02-04 01:46:24,702 INFO L226 Difference]: Without dead ends: 51
[2018-02-04 01:46:24,703 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=281, Invalid=2269, Unknown=0, NotChecked=0, Total=2550
[2018-02-04 01:46:24,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2018-02-04 01:46:24,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51.
[2018-02-04 01:46:24,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states.
[2018-02-04 01:46:24,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions.
[2018-02-04 01:46:24,707 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 50
[2018-02-04 01:46:24,707 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:46:24,707 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions.
[2018-02-04 01:46:24,707 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states.
[2018-02-04 01:46:24,708 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions.
[2018-02-04 01:46:24,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51
[2018-02-04 01:46:24,708 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 01:46:24,708 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 01:46:24,708 INFO L371 AbstractCegarLoop]: === Iteration 30 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]===
[2018-02-04 01:46:24,708 INFO L82 PathProgramCache]: Analyzing trace with hash 429452933, now seen corresponding path program 4 times
[2018-02-04 01:46:24,709 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 01:46:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 01:46:24,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 01:46:25,195 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 23 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:25,195 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-04 01:46:25,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24
[2018-02-04 01:46:25,195 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 01:46:25,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:25,195 INFO L182 omatonBuilderFactory]: Interpolants [7314#true, 7315#false, 7316#(and (= main_~n~0 (select |#length| |main_#t~malloc15.base|)) (= (select |#valid| |main_#t~malloc15.base|) 1) (= 0 |main_#t~malloc15.offset|)), 7317#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= (select |#valid| main_~nondetArea~0.base) 1) (= 0 main_~nondetArea~0.offset)), 7318#(and (= (select |#valid| |cstpncpy_#in~dst.base|) 1) (<= (select |#length| |cstpncpy_#in~dst.base|) |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| |cstpncpy_#in~dst.base|)) (= 0 |cstpncpy_#in~dst.offset|)), 7319#(and (<= (select |#length| |cstpncpy_#in~dst.base|) |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| |cstpncpy_#in~dst.base|)) (= 0 |cstpncpy_#in~dst.offset|)), 7320#(and (<= (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) |cstpncpy_#in~n|) (<= |cstpncpy_#in~n| (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))), 7321#(and (<= cstpncpy_~n (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (<= (select |#length| (select (select |#memory_$Pointer$.base| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) cstpncpy_~n)), 7322#(and (= (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) |cstpncpy_#t~mem0.offset|) (<= (select |#length| |cstpncpy_#t~mem0.base|) cstpncpy_~n) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (<= cstpncpy_~n (select |#length| |cstpncpy_#t~mem0.base|))), 7323#(and (<= cstpncpy_~n (select |#length| cstpncpy_~d~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|)) (= (select (select |#memory_$Pointer$.offset| |cstpncpy_~#dst.base|) |cstpncpy_~#dst.offset|) cstpncpy_~d~0.offset) (<= (select |#length| cstpncpy_~d~0.base) cstpncpy_~n)), 7324#(and (= |cstpncpy_#t~mem1.offset| 0) (= |cstpncpy_#t~mem1.offset| cstpncpy_~d~0.offset) (<= cstpncpy_~n (select |#length| cstpncpy_~d~0.base)) (<= (select |#length| cstpncpy_~d~0.base) cstpncpy_~n)), 7325#(and (<= (select |#length| cstpncpy_~d~0.base) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (select |#length| cstpncpy_~d~0.base))), 7326#(and (= |cstpncpy_#t~post4.base| cstpncpy_~d~0.base) (<= (+ |cstpncpy_#t~post4.offset| 1) cstpncpy_~d~0.offset) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| |cstpncpy_#t~post4.base|) 1)) (<= (+ (select |#length| |cstpncpy_#t~post4.base|) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n))), 7327#(and (<= (+ (select |#length| cstpncpy_~d~0.base) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1)) (<= 1 cstpncpy_~d~0.offset)), 7328#(and (<= 1 cstpncpy_~d~0.offset) (<= (select |#length| cstpncpy_~d~0.base) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (select |#length| cstpncpy_~d~0.base))), 7329#(and (= |cstpncpy_#t~post4.base| cstpncpy_~d~0.base) (<= 2 cstpncpy_~d~0.offset) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| |cstpncpy_#t~post4.base|) 1)) (<= (+ (select |#length| |cstpncpy_#t~post4.base|) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n))), 7330#(and (<= (+ (select |#length| cstpncpy_~d~0.base) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1)) (<= 2 cstpncpy_~d~0.offset)), 7331#(and (<= (select |#length| cstpncpy_~d~0.base) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= 2 cstpncpy_~d~0.offset) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (select |#length| cstpncpy_~d~0.base))), 7332#(and (<= (+ (select |#length| cstpncpy_~d~0.base) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1)) (<= 3 cstpncpy_~d~0.offset)), 7333#(and (<= (select |#length| cstpncpy_~d~0.base) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= 3 cstpncpy_~d~0.offset) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (select |#length| cstpncpy_~d~0.base))), 7334#(and (<= (+ (select |#length| cstpncpy_~d~0.base) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1)) (<= 4 cstpncpy_~d~0.offset) (<= (+ (select |#length| |cstpncpy_#t~post4.base|) cstpncpy_~d~0.offset) (+ (select |#length| cstpncpy_~d~0.base) |cstpncpy_#t~post4.offset| 1))), 7335#(and (<= (+ (select |#length| cstpncpy_~d~0.base) 1) (+ cstpncpy_~d~0.offset cstpncpy_~n)) (<= (+ cstpncpy_~d~0.offset cstpncpy_~n) (+ (select |#length| cstpncpy_~d~0.base) 1)) (<= 4 cstpncpy_~d~0.offset) (<= cstpncpy_~d~0.offset (select |#length| cstpncpy_~d~0.base))), 7336#(and (<= 4 cstpncpy_~d~0.offset) (or (<= (+ cstpncpy_~d~0.offset |cstpncpy_#t~pre3|) (select |#length| cstpncpy_~d~0.base)) (<= |cstpncpy_#t~pre3| (* 4294967296 (div |cstpncpy_#t~pre3| 4294967296)))) (<= cstpncpy_~d~0.offset (select |#length| cstpncpy_~d~0.base)) (< 0 (+ (div |cstpncpy_#t~pre3| 4294967296) 1))), 7337#(and (<= 4 cstpncpy_~d~0.offset) (<= (+ cstpncpy_~d~0.offset 1) (select |#length| cstpncpy_~d~0.base))), 7338#(and (<= (+ |cstpncpy_#t~post4.offset| 1) (select |#length| |cstpncpy_#t~post4.base|)) (<= 4 |cstpncpy_#t~post4.offset|))]
[2018-02-04 01:46:25,196 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 23 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 01:46:25,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states
[2018-02-04 01:46:25,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2018-02-04 01:46:25,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600
[2018-02-04 01:46:25,196 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 25 states.
[2018-02-04 01:46:25,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 01:46:25,924 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions.
[2018-02-04 01:46:25,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2018-02-04 01:46:25,924 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50
[2018-02-04 01:46:25,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 01:46:25,925 INFO L225 Difference]: With dead ends: 51
[2018-02-04 01:46:25,925 INFO L226 Difference]: Without dead ends: 0
[2018-02-04 01:46:25,925 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=313, Invalid=2039, Unknown=0, NotChecked=0, Total=2352
[2018-02-04 01:46:25,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2018-02-04 01:46:25,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2018-02-04 01:46:25,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2018-02-04 01:46:25,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2018-02-04 01:46:25,926 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50
[2018-02-04 01:46:25,926 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 01:46:25,926 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2018-02-04 01:46:25,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states.
[2018-02-04 01:46:25,926 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2018-02-04 01:46:25,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2018-02-04 01:46:25,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:46:25 BoogieIcfgContainer
[2018-02-04 01:46:25,929 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-02-04 01:46:25,930 INFO L168 Benchmark]: Toolchain (without parser) took 24117.15 ms. Allocated memory was 382.2 MB in the beginning and 1.0 GB in the end (delta: 631.2 MB). Free memory was 340.4 MB in the beginning and 584.2 MB in the end (delta: -243.8 MB). Peak memory consumption was 387.4 MB. Max. memory is 5.3 GB.
[2018-02-04 01:46:25,930 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 382.2 MB. Free memory is still 345.7 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-02-04 01:46:25,930 INFO L168 Benchmark]: CACSL2BoogieTranslator took 185.10 ms. Allocated memory is still 382.2 MB. Free memory was 339.1 MB in the beginning and 328.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB.
[2018-02-04 01:46:25,931 INFO L168 Benchmark]: Boogie Preprocessor took 35.48 ms. Allocated memory is still 382.2 MB. Free memory was 328.5 MB in the beginning and 327.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB.
[2018-02-04 01:46:25,931 INFO L168 Benchmark]: RCFGBuilder took 347.58 ms. Allocated memory is still 382.2 MB. Free memory was 327.1 MB in the beginning and 302.5 MB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 5.3 GB.
[2018-02-04 01:46:25,931 INFO L168 Benchmark]: TraceAbstraction took 23545.68 ms. Allocated memory was 382.2 MB in the beginning and 1.0 GB in the end (delta: 631.2 MB). Free memory was 301.2 MB in the beginning and 584.2 MB in the end (delta: -283.0 MB). Peak memory consumption was 348.2 MB. Max. memory is 5.3 GB.
[2018-02-04 01:46:25,932 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.17 ms. Allocated memory is still 382.2 MB. Free memory is still 345.7 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 185.10 ms. Allocated memory is still 382.2 MB. Free memory was 339.1 MB in the beginning and 328.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 35.48 ms. Allocated memory is still 382.2 MB. Free memory was 328.5 MB in the beginning and 327.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 347.58 ms. Allocated memory is still 382.2 MB. Free memory was 327.1 MB in the beginning and 302.5 MB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 23545.68 ms. Allocated memory was 382.2 MB in the beginning and 1.0 GB in the end (delta: 631.2 MB). Free memory was 301.2 MB in the beginning and 584.2 MB in the end (delta: -283.0 MB). Peak memory consumption was 348.2 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: 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: 558]: all allocated memory was freed
For all program executions holds that all allocated memory was freed at this location
- PositiveResult [Line: 1]: pointer dereference always succeeds
For all program executions holds that pointer dereference always succeeds at this location
- AllSpecificationsHoldResult: All specifications hold
21 specifications checked. All of them hold
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 71 locations, 21 error locations. SAFE Result, 23.5s OverallTime, 30 OverallIterations, 5 TraceHistogramMax, 14.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1154 SDtfs, 1644 SDslu, 8459 SDs, 0 SdLazy, 9509 SolverSat, 465 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 755 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 705 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4112 ImplicationChecksByTransitivity, 15.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 50/222 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 230 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 984 NumberOfCodeBlocks, 984 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 954 ConstructedInterpolants, 0 QuantifiedInterpolants, 515903 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 17 PerfectInterpolantSequences, 50/222 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_cstpncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_01-46-25-938.csv
Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_01-46-25-938.csv
Received shutdown request...